./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_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_cursor_from_array_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 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:28:38,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:28:38,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:28:38,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:28:38,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:28:38,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:28:38,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:28:38,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:28:38,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:28:38,303 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:28:38,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:28:38,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:28:38,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:28:38,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:28:38,305 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:28:38,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:28:38,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:28:38,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:28:38,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:28:38,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:28:38,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:28:38,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:28:38,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:28:38,308 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:28:38,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:28:38,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:28:38,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:28:38,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:28:38,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:28:38,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:28:38,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:28:38,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:28:38,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:28:38,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:28:38,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:28:38,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:28:38,312 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:28:38,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:28:38,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:28:38,313 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:28:38,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:28:38,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:28:38,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:28:38,629 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:28:38,629 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:28:38,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i [2023-11-23 08:28:39,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:28:40,652 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:28:40,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i [2023-11-23 08:28:40,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c620cc422/798acef7f6d84ec7afc61eccd3c274bc/FLAG8c5d2aade [2023-11-23 08:28:40,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c620cc422/798acef7f6d84ec7afc61eccd3c274bc [2023-11-23 08:28:40,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:28:40,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:28:40,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:28:40,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:28:40,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:28:40,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:28:40" (1/1) ... [2023-11-23 08:28:40,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3760e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:40, skipping insertion in model container [2023-11-23 08:28:40,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:28:40" (1/1) ... [2023-11-23 08:28:40,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:28:41,437 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_cursor_from_array_harness.i[4500,4513] [2023-11-23 08:28:41,449 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_cursor_from_array_harness.i[4560,4573] [2023-11-23 08:28:42,915 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:42,937 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:42,943 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:42,945 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:42,946 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:42,966 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:42,985 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:42,988 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:42,990 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:43,520 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:28:43,534 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:28:43,535 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:28:43,539 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:28:43,543 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:28:43,544 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:28:43,545 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:28:43,546 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:28:43,548 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:28:43,551 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:28:44,164 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,187 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:28:44,405 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:28:44,439 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_cursor_from_array_harness.i[4500,4513] [2023-11-23 08:28:44,439 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_cursor_from_array_harness.i[4560,4573] [2023-11-23 08:28:44,501 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,501 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,501 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,502 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,503 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,509 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,524 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,529 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,530 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,580 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:28:44,581 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:28:44,581 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:28:44,582 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:28:44,582 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:28:44,583 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:28:44,583 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:28:44,584 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:28:44,584 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:28:44,584 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:28:44,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-23 08:28:44,657 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,657 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:28:44,667 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-23 08:28:44,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:28:44,926 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,926 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,926 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,926 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,926 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,927 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,927 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,927 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,928 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,928 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,928 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,928 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,928 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,929 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,929 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,929 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,929 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,930 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:28:44,939 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:28:44,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44 WrapperNode [2023-11-23 08:28:44,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:28:44,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:28:44,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:28:44,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:28:44,950 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:28:44" (1/1) ... [2023-11-23 08:28:45,037 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:28:44" (1/1) ... [2023-11-23 08:28:45,116 INFO L138 Inliner]: procedures = 689, calls = 2612, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 776 [2023-11-23 08:28:45,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:28:45,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:28:45,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:28:45,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:28:45,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:28:45,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:28:45,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:28:45,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:28:45,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (1/1) ... [2023-11-23 08:28:45,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:28:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:28:45,247 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:28:45,272 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:28:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-23 08:28:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-23 08:28:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:28:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:28:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:28:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:28:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:28:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:28:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:28:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:28:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:28:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:28:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:28:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:28:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:28:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:28:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:28:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:28:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:28:45,357 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:28:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:28:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:28:45,648 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:28:45,650 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:28:46,421 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:28:46,527 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:28:46,527 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:28:46,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:28:46 BoogieIcfgContainer [2023-11-23 08:28:46,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:28:46,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:28:46,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:28:46,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:28:46,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:28:40" (1/3) ... [2023-11-23 08:28:46,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd20d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:28:46, skipping insertion in model container [2023-11-23 08:28:46,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:28:44" (2/3) ... [2023-11-23 08:28:46,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd20d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:28:46, skipping insertion in model container [2023-11-23 08:28:46,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:28:46" (3/3) ... [2023-11-23 08:28:46,538 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2023-11-23 08:28:46,560 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:28:46,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:28:46,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:28:46,623 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;@35b839ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:28:46,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:28:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 08:28:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 08:28:46,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:46,634 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:46,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:46,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash 465763112, now seen corresponding path program 1 times [2023-11-23 08:28:46,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:46,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077612747] [2023-11-23 08:28:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:46,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:47,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:28:47,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077612747] [2023-11-23 08:28:47,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077612747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:47,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:47,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 08:28:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219988801] [2023-11-23 08:28:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:47,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:28:47,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:47,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:28:47,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:28:47,431 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:28:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:47,658 INFO L93 Difference]: Finished difference Result 102 states and 139 transitions. [2023-11-23 08:28:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:28:47,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2023-11-23 08:28:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:47,668 INFO L225 Difference]: With dead ends: 102 [2023-11-23 08:28:47,669 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 08:28:47,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:28:47,679 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:47,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 47 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:28:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 08:28:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-23 08:28:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 08:28:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-11-23 08:28:47,727 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 26 [2023-11-23 08:28:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:47,741 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-11-23 08:28:47,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:28:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-11-23 08:28:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 08:28:47,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:47,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:47,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:28:47,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:47,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash 301658924, now seen corresponding path program 1 times [2023-11-23 08:28:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926833462] [2023-11-23 08:28:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:48,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:28:48,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926833462] [2023-11-23 08:28:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926833462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:48,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:28:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539794706] [2023-11-23 08:28:48,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:48,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:28:48,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:48,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:28:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:28:48,433 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:28:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:48,644 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2023-11-23 08:28:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:28:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2023-11-23 08:28:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:48,647 INFO L225 Difference]: With dead ends: 90 [2023-11-23 08:28:48,647 INFO L226 Difference]: Without dead ends: 51 [2023-11-23 08:28:48,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:28:48,648 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 39 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:48,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 97 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:28:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-23 08:28:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-23 08:28:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 08:28:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-11-23 08:28:48,656 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 26 [2023-11-23 08:28:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:48,657 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-11-23 08:28:48,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:28:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-11-23 08:28:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 08:28:48,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:48,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 08:28:48,658 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:48,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 624190695, now seen corresponding path program 1 times [2023-11-23 08:28:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585966801] [2023-11-23 08:28:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:49,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:49,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:49,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:28:49,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:49,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585966801] [2023-11-23 08:28:49,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585966801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:49,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:49,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:28:49,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323644966] [2023-11-23 08:28:49,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:49,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:28:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:28:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:28:49,430 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:28:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:49,740 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-11-23 08:28:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:28:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-11-23 08:28:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:49,742 INFO L225 Difference]: With dead ends: 62 [2023-11-23 08:28:49,742 INFO L226 Difference]: Without dead ends: 60 [2023-11-23 08:28:49,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:28:49,743 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:49,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:28:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-23 08:28:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-11-23 08:28:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:28:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2023-11-23 08:28:49,751 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 28 [2023-11-23 08:28:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:49,752 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2023-11-23 08:28:49,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:28:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2023-11-23 08:28:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 08:28:49,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:49,753 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:49,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 08:28:49,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:49,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1012006559, now seen corresponding path program 1 times [2023-11-23 08:28:49,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:49,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947740281] [2023-11-23 08:28:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:49,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:50,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:50,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:50,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:28:50,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:50,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947740281] [2023-11-23 08:28:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947740281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:50,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 08:28:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579343195] [2023-11-23 08:28:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:50,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:28:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:50,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:28:50,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:28:50,981 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 08:28:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:51,484 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2023-11-23 08:28:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:28:51,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2023-11-23 08:28:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:51,485 INFO L225 Difference]: With dead ends: 114 [2023-11-23 08:28:51,485 INFO L226 Difference]: Without dead ends: 70 [2023-11-23 08:28:51,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:28:51,487 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 66 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:51,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 157 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:28:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-23 08:28:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2023-11-23 08:28:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:28:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2023-11-23 08:28:51,500 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 32 [2023-11-23 08:28:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:51,500 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2023-11-23 08:28:51,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 08:28:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2023-11-23 08:28:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 08:28:51,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:51,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:51,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:28:51,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:51,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1713071137, now seen corresponding path program 1 times [2023-11-23 08:28:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:51,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466249509] [2023-11-23 08:28:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:28:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466249509] [2023-11-23 08:28:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466249509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:52,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:52,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:28:52,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212747455] [2023-11-23 08:28:52,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:52,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:28:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:28:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:28:52,696 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:28:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:52,887 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2023-11-23 08:28:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:28:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-11-23 08:28:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:52,889 INFO L225 Difference]: With dead ends: 109 [2023-11-23 08:28:52,889 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 08:28:52,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:28:52,890 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:52,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 78 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:28:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 08:28:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-23 08:28:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:28:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2023-11-23 08:28:52,897 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 32 [2023-11-23 08:28:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:52,898 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2023-11-23 08:28:52,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:28:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2023-11-23 08:28:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 08:28:52,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:52,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:52,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 08:28:52,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:52,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1933966842, now seen corresponding path program 1 times [2023-11-23 08:28:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862245212] [2023-11-23 08:28:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:53,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:53,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:28:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862245212] [2023-11-23 08:28:53,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862245212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:53,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:53,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 08:28:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924425190] [2023-11-23 08:28:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:53,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:28:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:53,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:28:53,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:28:53,707 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:28:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:54,059 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2023-11-23 08:28:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:28:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2023-11-23 08:28:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:54,061 INFO L225 Difference]: With dead ends: 74 [2023-11-23 08:28:54,061 INFO L226 Difference]: Without dead ends: 72 [2023-11-23 08:28:54,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:28:54,062 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:54,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 208 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:28:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-23 08:28:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2023-11-23 08:28:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:28:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2023-11-23 08:28:54,074 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 34 [2023-11-23 08:28:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:54,074 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2023-11-23 08:28:54,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:28:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2023-11-23 08:28:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 08:28:54,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:54,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:54,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 08:28:54,079 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:54,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1540939832, now seen corresponding path program 1 times [2023-11-23 08:28:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205705545] [2023-11-23 08:28:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:28:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:55,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205705545] [2023-11-23 08:28:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205705545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:55,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:55,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 08:28:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294339097] [2023-11-23 08:28:55,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:55,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:28:55,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:28:55,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:28:55,348 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:28:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:55,888 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-11-23 08:28:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:28:55,889 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2023-11-23 08:28:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:55,890 INFO L225 Difference]: With dead ends: 73 [2023-11-23 08:28:55,890 INFO L226 Difference]: Without dead ends: 71 [2023-11-23 08:28:55,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-11-23 08:28:55,891 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:55,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 248 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:28:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-23 08:28:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2023-11-23 08:28:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 08:28:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-11-23 08:28:55,897 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 34 [2023-11-23 08:28:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:55,897 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-11-23 08:28:55,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:28:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-11-23 08:28:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-23 08:28:55,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:55,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:55,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 08:28:55,899 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:55,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:55,899 INFO L85 PathProgramCache]: Analyzing trace with hash 680462994, now seen corresponding path program 1 times [2023-11-23 08:28:55,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:55,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856886779] [2023-11-23 08:28:55,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:56,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:56,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 08:28:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:56,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:28:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:28:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856886779] [2023-11-23 08:28:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856886779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:28:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820165120] [2023-11-23 08:28:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:56,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:28:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:28:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:28:56,214 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:28:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:56,528 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2023-11-23 08:28:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:28:56,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2023-11-23 08:28:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:56,530 INFO L225 Difference]: With dead ends: 83 [2023-11-23 08:28:56,530 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 08:28:56,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:28:56,533 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:56,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 63 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:28:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 08:28:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 08:28:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 08:28:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-11-23 08:28:56,542 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 39 [2023-11-23 08:28:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:56,543 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-11-23 08:28:56,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:28:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-11-23 08:28:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-23 08:28:56,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:56,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:56,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:28:56,561 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:56,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:56,561 INFO L85 PathProgramCache]: Analyzing trace with hash 216931021, now seen corresponding path program 1 times [2023-11-23 08:28:56,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:56,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071268597] [2023-11-23 08:28:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:57,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:57,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:28:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:57,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:28:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 08:28:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:28:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 08:28:57,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:57,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071268597] [2023-11-23 08:28:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071268597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:57,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:28:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161277240] [2023-11-23 08:28:57,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:28:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:28:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:28:57,735 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:28:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:58,116 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2023-11-23 08:28:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:28:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2023-11-23 08:28:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:58,118 INFO L225 Difference]: With dead ends: 68 [2023-11-23 08:28:58,118 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 08:28:58,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:28:58,119 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:58,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 163 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:28:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 08:28:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-11-23 08:28:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 45 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:28:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2023-11-23 08:28:58,130 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 41 [2023-11-23 08:28:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:58,131 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2023-11-23 08:28:58,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:28:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2023-11-23 08:28:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-23 08:28:58,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:58,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:28:58,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 08:28:58,135 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:58,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1300885115, now seen corresponding path program 1 times [2023-11-23 08:28:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:58,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782474779] [2023-11-23 08:28:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:29:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:29:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 08:29:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:29:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:29:00,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782474779] [2023-11-23 08:29:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782474779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:29:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888462242] [2023-11-23 08:29:00,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:00,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:29:00,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:29:00,936 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:29:00,937 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:29:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:01,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 2412 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-23 08:29:01,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:29:01,512 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 15 treesize of output 1 [2023-11-23 08:29:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:29:02,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:29:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888462242] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:29:02,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:29:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2023-11-23 08:29:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952761769] [2023-11-23 08:29:02,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:29:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-23 08:29:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-23 08:29:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2023-11-23 08:29:02,839 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-23 08:29:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:05,257 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2023-11-23 08:29:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 08:29:05,258 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 45 [2023-11-23 08:29:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:05,259 INFO L225 Difference]: With dead ends: 138 [2023-11-23 08:29:05,259 INFO L226 Difference]: Without dead ends: 101 [2023-11-23 08:29:05,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2023-11-23 08:29:05,260 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 135 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:05,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 96 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-23 08:29:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-23 08:29:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2023-11-23 08:29:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.078125) internal successors, (69), 67 states have internal predecessors, (69), 20 states have call successors, (20), 12 states have call predecessors, (20), 14 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2023-11-23 08:29:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-11-23 08:29:05,297 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 45 [2023-11-23 08:29:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:05,298 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-11-23 08:29:05,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-23 08:29:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-11-23 08:29:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 08:29:05,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:05,300 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-23 08:29:05,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 08:29:05,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:29:05,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:05,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1413870083, now seen corresponding path program 1 times [2023-11-23 08:29:05,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:05,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114553950] [2023-11-23 08:29:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:07,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:29:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:07,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:29:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 08:29:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:29:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:07,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:29:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 08:29:07,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:07,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114553950] [2023-11-23 08:29:07,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114553950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:29:07,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:29:07,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:29:07,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376645299] [2023-11-23 08:29:07,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:29:07,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:29:07,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:07,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:29:07,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:29:07,460 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-23 08:29:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:07,933 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-11-23 08:29:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 08:29:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2023-11-23 08:29:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:07,935 INFO L225 Difference]: With dead ends: 109 [2023-11-23 08:29:07,935 INFO L226 Difference]: Without dead ends: 107 [2023-11-23 08:29:07,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-11-23 08:29:07,936 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:07,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 124 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:29:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-23 08:29:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-23 08:29:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 73 states have internal predecessors, (75), 20 states have call successors, (20), 14 states have call predecessors, (20), 16 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2023-11-23 08:29:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-11-23 08:29:07,948 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 47 [2023-11-23 08:29:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:07,949 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-11-23 08:29:07,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-23 08:29:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-11-23 08:29:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 08:29:07,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:07,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:29:07,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 08:29:07,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:07,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash -276995886, now seen corresponding path program 1 times [2023-11-23 08:29:07,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944765784] [2023-11-23 08:29:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:08,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:08,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:29:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:08,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:29:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:29:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:08,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:29:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:29:08,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:08,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944765784] [2023-11-23 08:29:08,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944765784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:29:08,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153129418] [2023-11-23 08:29:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:08,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:29:08,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:29:08,968 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:29:08,988 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:29:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:09,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 2429 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:29:09,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:29:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:29:09,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:29:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153129418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:29:09,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:29:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2023-11-23 08:29:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678723780] [2023-11-23 08:29:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:29:09,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:29:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:29:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:29:09,478 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:29:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:09,751 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2023-11-23 08:29:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:29:09,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2023-11-23 08:29:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:09,753 INFO L225 Difference]: With dead ends: 191 [2023-11-23 08:29:09,753 INFO L226 Difference]: Without dead ends: 107 [2023-11-23 08:29:09,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:29:09,754 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:09,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 175 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:29:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-23 08:29:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-23 08:29:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 73 states have internal predecessors, (74), 20 states have call successors, (20), 14 states have call predecessors, (20), 16 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2023-11-23 08:29:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2023-11-23 08:29:09,766 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 51 [2023-11-23 08:29:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:09,766 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2023-11-23 08:29:09,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:29:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2023-11-23 08:29:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 08:29:09,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:09,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:29:09,788 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:29:09,985 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,SelfDestructingSolverStorable11 [2023-11-23 08:29:09,986 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:09,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1646232148, now seen corresponding path program 1 times [2023-11-23 08:29:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457489383] [2023-11-23 08:29:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:10,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:10,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:29:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:29:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:10,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:29:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:10,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:29:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:29:11,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457489383] [2023-11-23 08:29:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457489383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:29:11,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:29:11,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 08:29:11,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523873317] [2023-11-23 08:29:11,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:29:11,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:29:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:29:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:29:11,024 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 08:29:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:11,424 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2023-11-23 08:29:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:29:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-11-23 08:29:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:11,427 INFO L225 Difference]: With dead ends: 135 [2023-11-23 08:29:11,427 INFO L226 Difference]: Without dead ends: 103 [2023-11-23 08:29:11,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:29:11,427 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:11,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 122 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:29:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-23 08:29:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-23 08:29:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 20 states have call successors, (20), 14 states have call predecessors, (20), 15 states have return successors, (20), 19 states have call predecessors, (20), 18 states have call successors, (20) [2023-11-23 08:29:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2023-11-23 08:29:11,441 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 51 [2023-11-23 08:29:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:11,442 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2023-11-23 08:29:11,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 08:29:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2023-11-23 08:29:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-23 08:29:11,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:11,443 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:29:11,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 08:29:11,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:11,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1106406243, now seen corresponding path program 1 times [2023-11-23 08:29:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:11,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667818959] [2023-11-23 08:29:11,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:29:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:29:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 08:29:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:29:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:29:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:29:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 08:29:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667818959] [2023-11-23 08:29:13,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667818959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:29:13,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:29:13,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 08:29:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994890162] [2023-11-23 08:29:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:29:13,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:29:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:29:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:29:13,024 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:29:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:13,453 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2023-11-23 08:29:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:29:13,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2023-11-23 08:29:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:13,455 INFO L225 Difference]: With dead ends: 113 [2023-11-23 08:29:13,455 INFO L226 Difference]: Without dead ends: 109 [2023-11-23 08:29:13,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:29:13,456 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:13,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 125 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:29:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-23 08:29:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-23 08:29:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 73 states have internal predecessors, (74), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (20), 19 states have call predecessors, (20), 18 states have call successors, (20) [2023-11-23 08:29:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2023-11-23 08:29:13,468 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 54 [2023-11-23 08:29:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:13,468 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2023-11-23 08:29:13,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:29:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2023-11-23 08:29:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 08:29:13,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:13,469 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:29:13,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 08:29:13,470 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:13,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1780624045, now seen corresponding path program 1 times [2023-11-23 08:29:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263364034] [2023-11-23 08:29:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:29:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:29:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:14,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:29:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:29:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 08:29:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263364034] [2023-11-23 08:29:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263364034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:29:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:29:14,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 08:29:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910030250] [2023-11-23 08:29:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:29:14,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:29:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:29:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:29:14,643 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:29:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:15,125 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2023-11-23 08:29:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 08:29:15,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2023-11-23 08:29:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:15,127 INFO L225 Difference]: With dead ends: 115 [2023-11-23 08:29:15,127 INFO L226 Difference]: Without dead ends: 111 [2023-11-23 08:29:15,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-11-23 08:29:15,128 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 55 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:15,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 247 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:29:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-23 08:29:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2023-11-23 08:29:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 72 states have internal predecessors, (72), 19 states have call successors, (19), 16 states have call predecessors, (19), 16 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2023-11-23 08:29:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2023-11-23 08:29:15,139 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 53 [2023-11-23 08:29:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:15,139 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2023-11-23 08:29:15,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:29:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2023-11-23 08:29:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:29:15,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:15,141 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:29:15,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 08:29:15,141 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:15,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash 21782756, now seen corresponding path program 1 times [2023-11-23 08:29:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382394898] [2023-11-23 08:29:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:29:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:29:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 08:29:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:29:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:29:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:29:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:29:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:29:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 08:29:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 08:29:16,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:16,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382394898] [2023-11-23 08:29:16,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382394898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:29:16,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:29:16,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 08:29:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862872106] [2023-11-23 08:29:16,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:29:16,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:29:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:29:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:29:16,387 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-23 08:29:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:16,959 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2023-11-23 08:29:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:29:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 70 [2023-11-23 08:29:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:16,960 INFO L225 Difference]: With dead ends: 117 [2023-11-23 08:29:16,960 INFO L226 Difference]: Without dead ends: 67 [2023-11-23 08:29:16,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:29:16,961 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:16,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 103 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:29:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-23 08:29:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-23 08:29:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.0) internal successors, (45), 45 states have internal predecessors, (45), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 08:29:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2023-11-23 08:29:16,973 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 70 [2023-11-23 08:29:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:16,973 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2023-11-23 08:29:16,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-23 08:29:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2023-11-23 08:29:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:29:16,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:16,977 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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] [2023-11-23 08:29:16,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 08:29:16,977 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:16,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1438440708, now seen corresponding path program 1 times [2023-11-23 08:29:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:16,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23195514] [2023-11-23 08:29:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:29:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:29:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:29:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:29:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:29:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:29:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:29:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:29:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:29:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-23 08:29:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23195514] [2023-11-23 08:29:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23195514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:29:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:29:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 08:29:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767150213] [2023-11-23 08:29:19,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:29:19,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:29:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:29:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:29:19,566 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 08:29:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:20,169 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2023-11-23 08:29:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:29:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 82 [2023-11-23 08:29:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:20,170 INFO L225 Difference]: With dead ends: 67 [2023-11-23 08:29:20,170 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 08:29:20,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:29:20,171 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:20,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 134 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:29:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 08:29:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 08:29:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 08:29:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 08:29:20,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-11-23 08:29:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:20,172 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 08:29:20,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 08:29:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 08:29:20,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 08:29:20,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:29:20,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 08:29:20,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 08:29:21,500 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12|))) (or (not (= .cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 0))) (< (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616))) 0)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2023-11-23 08:29:21,500 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12|))) (or (not (= .cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 0))) (< (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616))) 0)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,501 INFO L899 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,502 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7384 7388) the Hoare annotation is: true [2023-11-23 08:29:21,502 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2023-11-23 08:29:21,502 INFO L899 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,502 INFO L899 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2023-11-23 08:29:21,502 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-23 08:29:21,502 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-23 08:29:21,502 INFO L899 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2023-11-23 08:29:21,502 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 08:29:21,502 INFO L895 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 0)) (.cse13 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse3 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse8 (= .cse13 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse12)) (.cse10 (not (= .cse13 0))) (.cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8) 0))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse12) 18446744073709551616)) .cse12)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2023-11-23 08:29:21,502 INFO L895 garLoopResultBuilder]: At program point L8256(line 8256) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 0)) (not (= .cse0 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8) 0))) [2023-11-23 08:29:21,503 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2023-11-23 08:29:21,503 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2023-11-23 08:29:21,503 INFO L899 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2023-11-23 08:29:21,506 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2023-11-23 08:29:21,507 INFO L895 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12|))) (and (<= 0 (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)))) (= .cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 0))))) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) [2023-11-23 08:29:21,508 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse1 (= .cse10 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (not (= .cse10 0))) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0))) (.cse0 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse7 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) .cse7) (let ((.cse8 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse9 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (and (or (not .cse7) (and .cse0 .cse8) (not .cse9)) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse4 .cse5 .cse6 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) (or (not .cse0) (not .cse8) (and .cse9 .cse7))))))) [2023-11-23 08:29:21,508 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 08:29:21,508 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse0 (= .cse7 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1217#1|)) (.cse3 (not (= .cse7 0))) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))))))) [2023-11-23 08:29:21,509 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2023-11-23 08:29:21,509 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2023-11-23 08:29:21,509 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= .cse0 0)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-23 08:29:21,509 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2023-11-23 08:29:21,509 INFO L899 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2023-11-23 08:29:21,509 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|)) (.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) 0) (not (= (select .cse1 8) 0)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_#t~mem594#1| |ULTIMATE.start_assert_bytes_match_#t~mem593#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select .cse1 .cse0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-23 08:29:21,510 INFO L895 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12|))) (and (<= 0 (+ .cse0 (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)))) (= .cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 0))))) [2023-11-23 08:29:21,510 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= .cse0 0)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-23 08:29:21,510 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)) (.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse0 (= .cse8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse4 (not (= .cse8 0))) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse3))) (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12| Int)) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12|))) (and (<= 0 (+ .cse2 (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)))) (= .cse2 .cse3)))) .cse4 .cse5 .cse6 .cse7) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse4 .cse5 .cse6 .cse7)))) [2023-11-23 08:29:21,510 INFO L899 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2023-11-23 08:29:21,510 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse0 (= .cse7 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1216#1| 1)) (.cse3 (not (= .cse7 0))) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616)))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2023-11-23 08:29:21,511 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2023-11-23 08:29:21,511 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2023-11-23 08:29:21,511 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 08:29:21,512 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 08:29:21,513 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:29:21,513 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:29:21,513 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 08:29:21,513 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 08:29:21,515 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:29:21,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:29:21,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:29:21 BoogieIcfgContainer [2023-11-23 08:29:21,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:29:21,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:29:21,522 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:29:21,522 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:29:21,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:28:46" (3/4) ... [2023-11-23 08:29:21,524 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 08:29:21,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-23 08:29:21,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2023-11-23 08:29:21,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-23 08:29:21,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 08:29:21,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 08:29:21,555 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2023-11-23 08:29:21,557 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2023-11-23 08:29:21,558 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-23 08:29:21,558 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-23 08:29:21,559 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 08:29:21,560 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 08:29:21,564 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 08:29:21,565 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 08:29:22,386 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 08:29:22,387 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 08:29:22,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:29:22,407 INFO L158 Benchmark]: Toolchain (without parser) took 41662.74ms. Allocated memory was 169.9MB in the beginning and 755.0MB in the end (delta: 585.1MB). Free memory was 131.0MB in the beginning and 360.0MB in the end (delta: -229.0MB). Peak memory consumption was 355.0MB. Max. memory is 16.1GB. [2023-11-23 08:29:22,407 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:29:22,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4185.58ms. Allocated memory was 169.9MB in the beginning and 234.9MB in the end (delta: 65.0MB). Free memory was 130.2MB in the beginning and 129.3MB in the end (delta: 942.3kB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2023-11-23 08:29:22,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 176.75ms. Allocated memory is still 234.9MB. Free memory was 129.3MB in the beginning and 117.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 08:29:22,408 INFO L158 Benchmark]: Boogie Preprocessor took 95.52ms. Allocated memory is still 234.9MB. Free memory was 117.7MB in the beginning and 111.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:29:22,409 INFO L158 Benchmark]: RCFGBuilder took 1313.95ms. Allocated memory is still 234.9MB. Free memory was 111.5MB in the beginning and 132.3MB in the end (delta: -20.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-11-23 08:29:22,409 INFO L158 Benchmark]: TraceAbstraction took 34990.71ms. Allocated memory was 234.9MB in the beginning and 755.0MB in the end (delta: 520.1MB). Free memory was 131.2MB in the beginning and 491.1MB in the end (delta: -359.9MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. [2023-11-23 08:29:22,410 INFO L158 Benchmark]: Witness Printer took 884.10ms. Allocated memory is still 755.0MB. Free memory was 491.1MB in the beginning and 360.0MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2023-11-23 08:29:22,411 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4185.58ms. Allocated memory was 169.9MB in the beginning and 234.9MB in the end (delta: 65.0MB). Free memory was 130.2MB in the beginning and 129.3MB in the end (delta: 942.3kB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 176.75ms. Allocated memory is still 234.9MB. Free memory was 129.3MB in the beginning and 117.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.52ms. Allocated memory is still 234.9MB. Free memory was 117.7MB in the beginning and 111.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1313.95ms. Allocated memory is still 234.9MB. Free memory was 111.5MB in the beginning and 132.3MB in the end (delta: -20.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34990.71ms. Allocated memory was 234.9MB in the beginning and 755.0MB in the end (delta: 520.1MB). Free memory was 131.2MB in the beginning and 491.1MB in the end (delta: -359.9MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. * Witness Printer took 884.10ms. Allocated memory is still 755.0MB. Free memory was 491.1MB in the beginning and 360.0MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8269]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] - GenericResultAtLocation [Line: 8755]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.9s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 927 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 2351 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1856 mSDsCounter, 309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5283 IncrementalHoareTripleChecker+Invalid, 5592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 309 mSolverCounterUnsat, 495 mSDtfsCounter, 5283 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 337 SyntacticMatches, 5 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=14, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 38 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 98 PreInvPairs, 113 NumberOfFragments, 944 HoareAnnotationTreeSize, 98 FomulaSimplifications, 231 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 629 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 822 ConstructedInterpolants, 16 QuantifiedInterpolants, 3440 SizeOfPredicates, 17 NumberOfNonLiveVariables, 4841 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 277/292 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-23 08:29:22,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE