./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_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.graphml --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 1baae56bade188786b6c048f5a5545dd6165460ea50e58a0310e4360c89d1838 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:47:07,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:47:07,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:47:07,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:47:07,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:47:07,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:47:07,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:47:07,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:47:07,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:47:07,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:47:07,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:47:07,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:47:07,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:47:07,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:47:07,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:47:07,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:47:07,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:47:07,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:47:07,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:47:07,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:47:07,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:47:07,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:47:07,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:47:07,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:47:07,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:47:07,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:47:07,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:47:07,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:47:07,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:47:07,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:47:07,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:47:07,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:47:07,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:47:07,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:47:07,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:47:07,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:47:07,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:47:07,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:47:07,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:47:07,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:47:07,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:47:07,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 21:47:07,529 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:47:07,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:47:07,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:47:07,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:47:07,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:47:07,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:47:07,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:47:07,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:47:07,531 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:47:07,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:47:07,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 21:47:07,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:47:07,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:47:07,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:47:07,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:47:07,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:47:07,533 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:47:07,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:47:07,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:47:07,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:47:07,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:47:07,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:47:07,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:47:07,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:47:07,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:47:07,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 21:47:07,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 21:47:07,535 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:47:07,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:47:07,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:47:07,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:47:07,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 1baae56bade188786b6c048f5a5545dd6165460ea50e58a0310e4360c89d1838 [2021-11-16 21:47:07,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:47:07,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:47:07,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:47:07,755 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:47:07,755 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:47:07,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-11-16 21:47:07,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d732cce49/8049a4bc4f2146c3b2c78dc819acbd6b/FLAGaa0348f91 [2021-11-16 21:47:08,404 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:47:08,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-11-16 21:47:08,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d732cce49/8049a4bc4f2146c3b2c78dc819acbd6b/FLAGaa0348f91 [2021-11-16 21:47:08,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d732cce49/8049a4bc4f2146c3b2c78dc819acbd6b [2021-11-16 21:47:08,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:47:08,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:47:08,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:47:08,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:47:08,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:47:08,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:47:08" (1/1) ... [2021-11-16 21:47:08,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb42114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:08, skipping insertion in model container [2021-11-16 21:47:08,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:47:08" (1/1) ... [2021-11-16 21:47:08,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:47:08,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:47:08,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4497,4510] [2021-11-16 21:47:08,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4557,4570] [2021-11-16 21:47:08,849 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:47:08,858 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:47:09,268 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:47:09,322 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,323 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,323 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,324 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,324 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,331 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,331 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,332 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,333 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,505 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:47:09,506 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:47:09,506 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:47:09,507 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:47:09,508 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:47:09,508 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:47:09,509 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:47:09,509 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:47:09,510 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:47:09,510 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:47:09,584 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,584 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,615 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:47:09,644 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:47:09,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4497,4510] [2021-11-16 21:47:09,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4557,4570] [2021-11-16 21:47:09,655 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:47:09,655 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:47:09,671 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:47:09,679 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,680 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,680 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,681 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,681 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,685 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,685 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,686 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,686 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,705 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:47:09,705 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:47:09,706 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:47:09,707 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:47:09,707 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:47:09,707 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:47:09,708 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:47:09,708 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:47:09,708 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:47:09,709 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:47:09,726 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,727 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:47:09,739 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:47:09,916 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:47:09,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09 WrapperNode [2021-11-16 21:47:09,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:47:09,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:47:09,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:47:09,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:47:09,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:09,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,053 INFO L137 Inliner]: procedures = 691, calls = 1533, calls flagged for inlining = 55, calls inlined = 10, statements flattened = 664 [2021-11-16 21:47:10,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:47:10,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:47:10,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:47:10,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:47:10,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:47:10,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:47:10,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:47:10,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:47:10,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (1/1) ... [2021-11-16 21:47:10,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:47:10,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:10,175 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) [2021-11-16 21:47:10,207 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 [2021-11-16 21:47:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2021-11-16 21:47:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2021-11-16 21:47:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:47:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2021-11-16 21:47:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2021-11-16 21:47:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2021-11-16 21:47:10,225 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2021-11-16 21:47:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:47:10,225 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:47:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 21:47:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 21:47:10,225 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 21:47:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:47:10,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:47:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:47:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:47:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2021-11-16 21:47:10,226 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2021-11-16 21:47:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:47:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:47:10,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:47:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:47:10,226 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:47:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 21:47:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 21:47:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 21:47:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 21:47:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2021-11-16 21:47:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2021-11-16 21:47:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2021-11-16 21:47:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2021-11-16 21:47:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:47:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:47:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:47:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 21:47:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:47:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:47:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 21:47:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 21:47:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 21:47:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 21:47:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 21:47:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure assert_array_list_equivalence [2021-11-16 21:47:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_array_list_equivalence [2021-11-16 21:47:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:47:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:47:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 21:47:10,492 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:47:10,493 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:47:11,392 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:47:11,401 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:47:11,403 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-16 21:47:11,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:47:11 BoogieIcfgContainer [2021-11-16 21:47:11,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:47:11,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:47:11,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:47:11,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:47:11,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:47:08" (1/3) ... [2021-11-16 21:47:11,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c552762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:47:11, skipping insertion in model container [2021-11-16 21:47:11,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:47:09" (2/3) ... [2021-11-16 21:47:11,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c552762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:47:11, skipping insertion in model container [2021-11-16 21:47:11,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:47:11" (3/3) ... [2021-11-16 21:47:11,414 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_size_harness.i [2021-11-16 21:47:11,418 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:47:11,418 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 21:47:11,468 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:47:11,483 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 21:47:11,484 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 21:47:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 114 states have internal predecessors, (139), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2021-11-16 21:47:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-16 21:47:11,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:11,522 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:11,522 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1923135121, now seen corresponding path program 1 times [2021-11-16 21:47:11,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:11,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872591550] [2021-11-16 21:47:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:11,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:11,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:47:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:47:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:47:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:47:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:47:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:47:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:47:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:47:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:47:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:47:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:47:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:47:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:47:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-16 21:47:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 21:47:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 21:47:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:47:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-11-16 21:47:12,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:12,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872591550] [2021-11-16 21:47:12,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872591550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:12,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:12,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:47:12,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216568346] [2021-11-16 21:47:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:12,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:47:12,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:47:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:47:12,230 INFO L87 Difference]: Start difference. First operand has 171 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 114 states have internal predecessors, (139), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 21:47:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:13,223 INFO L93 Difference]: Finished difference Result 399 states and 564 transitions. [2021-11-16 21:47:13,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:47:13,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2021-11-16 21:47:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:13,232 INFO L225 Difference]: With dead ends: 399 [2021-11-16 21:47:13,233 INFO L226 Difference]: Without dead ends: 234 [2021-11-16 21:47:13,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:47:13,238 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 131 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:13,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 356 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-16 21:47:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-11-16 21:47:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 166. [2021-11-16 21:47:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 110 states have internal predecessors, (132), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-16 21:47:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2021-11-16 21:47:13,278 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 107 [2021-11-16 21:47:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:13,278 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2021-11-16 21:47:13,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 21:47:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2021-11-16 21:47:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-16 21:47:13,281 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:13,281 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:13,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 21:47:13,282 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:13,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:13,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1898390481, now seen corresponding path program 1 times [2021-11-16 21:47:13,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:13,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265343655] [2021-11-16 21:47:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:13,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:47:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:47:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:47:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:47:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:47:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:47:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:47:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:47:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:47:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:47:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:47:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:47:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 21:47:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-16 21:47:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 21:47:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 21:47:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:47:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-11-16 21:47:13,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:13,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265343655] [2021-11-16 21:47:13,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265343655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:13,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:13,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 21:47:13,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637220544] [2021-11-16 21:47:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:13,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:47:13,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:13,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:47:13,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:47:13,605 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 21:47:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:14,413 INFO L93 Difference]: Finished difference Result 358 states and 477 transitions. [2021-11-16 21:47:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:47:14,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 107 [2021-11-16 21:47:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:14,417 INFO L225 Difference]: With dead ends: 358 [2021-11-16 21:47:14,418 INFO L226 Difference]: Without dead ends: 234 [2021-11-16 21:47:14,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:47:14,419 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 288 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:14,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 580 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 21:47:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-11-16 21:47:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 166. [2021-11-16 21:47:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.201834862385321) internal successors, (131), 110 states have internal predecessors, (131), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-16 21:47:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2021-11-16 21:47:14,433 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 107 [2021-11-16 21:47:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:14,433 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2021-11-16 21:47:14,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-16 21:47:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2021-11-16 21:47:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-16 21:47:14,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:14,435 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:14,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 21:47:14,435 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 413511437, now seen corresponding path program 1 times [2021-11-16 21:47:14,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:14,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23478276] [2021-11-16 21:47:14,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:14,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:47:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:47:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:47:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:47:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:47:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:47:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:47:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:47:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:47:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:47:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:47:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 21:47:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 21:47:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:47:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 21:47:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 21:47:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-16 21:47:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 21:47:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-16 21:47:14,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:14,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23478276] [2021-11-16 21:47:14,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23478276] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:14,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475490938] [2021-11-16 21:47:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:14,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:14,724 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) [2021-11-16 21:47:14,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 21:47:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:15,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 2281 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:47:15,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-16 21:47:15,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:15,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475490938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:15,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:15,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2021-11-16 21:47:15,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566869184] [2021-11-16 21:47:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:15,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:47:15,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:15,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:47:15,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:47:15,341 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-16 21:47:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:15,442 INFO L93 Difference]: Finished difference Result 309 states and 396 transitions. [2021-11-16 21:47:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:47:15,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 115 [2021-11-16 21:47:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:15,444 INFO L225 Difference]: With dead ends: 309 [2021-11-16 21:47:15,444 INFO L226 Difference]: Without dead ends: 168 [2021-11-16 21:47:15,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-11-16 21:47:15,446 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 81 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:15,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1075 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:47:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-16 21:47:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-11-16 21:47:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.2) internal successors, (132), 112 states have internal predecessors, (132), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-11-16 21:47:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2021-11-16 21:47:15,468 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 115 [2021-11-16 21:47:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:15,469 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2021-11-16 21:47:15,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-16 21:47:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2021-11-16 21:47:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 21:47:15,470 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:15,471 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:15,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:15,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:15,706 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:15,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash -445935835, now seen corresponding path program 1 times [2021-11-16 21:47:15,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:15,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614404078] [2021-11-16 21:47:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:15,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:15,738 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:15,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430144829] [2021-11-16 21:47:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:15,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:15,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:15,756 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) [2021-11-16 21:47:15,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 21:47:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:16,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 2397 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:47:16,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-16 21:47:16,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:16,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:16,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614404078] [2021-11-16 21:47:16,299 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:16,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430144829] [2021-11-16 21:47:16,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430144829] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:16,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:16,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 21:47:16,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996071852] [2021-11-16 21:47:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:16,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:47:16,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:16,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:47:16,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:47:16,301 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-16 21:47:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:16,332 INFO L93 Difference]: Finished difference Result 297 states and 384 transitions. [2021-11-16 21:47:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:47:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2021-11-16 21:47:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:16,335 INFO L225 Difference]: With dead ends: 297 [2021-11-16 21:47:16,335 INFO L226 Difference]: Without dead ends: 173 [2021-11-16 21:47:16,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:47:16,336 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:16,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 611 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:47:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-16 21:47:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2021-11-16 21:47:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 114 states have internal predecessors, (134), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-11-16 21:47:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2021-11-16 21:47:16,344 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 130 [2021-11-16 21:47:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:16,344 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2021-11-16 21:47:16,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-16 21:47:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2021-11-16 21:47:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 21:47:16,347 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:16,347 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:16,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:16,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-11-16 21:47:16,567 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash -879664921, now seen corresponding path program 1 times [2021-11-16 21:47:16,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:16,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427385518] [2021-11-16 21:47:16,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:16,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:16,610 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:16,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086884291] [2021-11-16 21:47:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:16,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:16,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:16,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:16,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 21:47:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:16,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 2402 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:47:16,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-16 21:47:17,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:17,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:17,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427385518] [2021-11-16 21:47:17,182 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:17,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086884291] [2021-11-16 21:47:17,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086884291] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:17,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:17,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 21:47:17,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345953463] [2021-11-16 21:47:17,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:17,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:47:17,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:17,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:47:17,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:47:17,184 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-11-16 21:47:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:17,306 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2021-11-16 21:47:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:47:17,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 130 [2021-11-16 21:47:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:17,308 INFO L225 Difference]: With dead ends: 299 [2021-11-16 21:47:17,308 INFO L226 Difference]: Without dead ends: 170 [2021-11-16 21:47:17,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:47:17,309 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 243 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:17,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 830 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:47:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-16 21:47:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-11-16 21:47:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.1875) internal successors, (133), 114 states have internal predecessors, (133), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-11-16 21:47:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2021-11-16 21:47:17,317 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 130 [2021-11-16 21:47:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:17,317 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2021-11-16 21:47:17,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-11-16 21:47:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2021-11-16 21:47:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-16 21:47:17,319 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:17,319 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:17,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:17,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:17,543 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash 391202648, now seen corresponding path program 1 times [2021-11-16 21:47:17,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:17,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660434950] [2021-11-16 21:47:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:17,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:17,576 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:17,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107195074] [2021-11-16 21:47:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:17,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:17,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:17,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 21:47:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:17,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:47:17,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-16 21:47:18,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:18,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:18,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660434950] [2021-11-16 21:47:18,219 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:18,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107195074] [2021-11-16 21:47:18,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107195074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:18,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:18,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 21:47:18,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130141123] [2021-11-16 21:47:18,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:18,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:47:18,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:18,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:47:18,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:47:18,221 INFO L87 Difference]: Start difference. First operand 170 states and 213 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2021-11-16 21:47:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:18,351 INFO L93 Difference]: Finished difference Result 312 states and 395 transitions. [2021-11-16 21:47:18,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:47:18,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 146 [2021-11-16 21:47:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:18,353 INFO L225 Difference]: With dead ends: 312 [2021-11-16 21:47:18,353 INFO L226 Difference]: Without dead ends: 170 [2021-11-16 21:47:18,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:47:18,355 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 104 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:18,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 1200 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:47:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-16 21:47:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-11-16 21:47:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.1875) internal successors, (133), 114 states have internal predecessors, (133), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2021-11-16 21:47:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 212 transitions. [2021-11-16 21:47:18,372 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 212 transitions. Word has length 146 [2021-11-16 21:47:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:18,373 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 212 transitions. [2021-11-16 21:47:18,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2021-11-16 21:47:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 212 transitions. [2021-11-16 21:47:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-16 21:47:18,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:18,375 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:18,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:18,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:18,596 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:18,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1071073244, now seen corresponding path program 2 times [2021-11-16 21:47:18,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:18,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127565146] [2021-11-16 21:47:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:18,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:18,627 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:18,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309214583] [2021-11-16 21:47:18,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:47:18,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:18,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:18,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:18,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 21:47:19,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:47:19,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:47:19,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 2595 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:47:19,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-11-16 21:47:19,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:19,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:19,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127565146] [2021-11-16 21:47:19,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:19,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309214583] [2021-11-16 21:47:19,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309214583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:19,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:19,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:47:19,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568216983] [2021-11-16 21:47:19,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:19,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:47:19,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:47:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:47:19,518 INFO L87 Difference]: Start difference. First operand 170 states and 212 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 21:47:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:19,751 INFO L93 Difference]: Finished difference Result 277 states and 343 transitions. [2021-11-16 21:47:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:47:19,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 161 [2021-11-16 21:47:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:19,753 INFO L225 Difference]: With dead ends: 277 [2021-11-16 21:47:19,753 INFO L226 Difference]: Without dead ends: 168 [2021-11-16 21:47:19,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:47:19,754 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 213 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:19,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 1147 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:47:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-16 21:47:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-11-16 21:47:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 112 states have internal predecessors, (131), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-16 21:47:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2021-11-16 21:47:19,765 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 161 [2021-11-16 21:47:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:19,766 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2021-11-16 21:47:19,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 21:47:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2021-11-16 21:47:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-16 21:47:19,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:19,767 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:19,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:19,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:19,987 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 153523288, now seen corresponding path program 1 times [2021-11-16 21:47:19,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:19,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17386378] [2021-11-16 21:47:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:19,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:20,052 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:20,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264386249] [2021-11-16 21:47:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:20,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:20,054 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:20,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 21:47:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:20,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 2837 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:47:20,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 21:47:20,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:20,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:20,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17386378] [2021-11-16 21:47:20,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:20,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264386249] [2021-11-16 21:47:20,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264386249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:20,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:20,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:47:20,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999249606] [2021-11-16 21:47:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:20,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:47:20,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:20,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:47:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:47:20,837 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:47:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:21,864 INFO L93 Difference]: Finished difference Result 310 states and 389 transitions. [2021-11-16 21:47:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:47:21,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 191 [2021-11-16 21:47:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:21,866 INFO L225 Difference]: With dead ends: 310 [2021-11-16 21:47:21,866 INFO L226 Difference]: Without dead ends: 186 [2021-11-16 21:47:21,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:47:21,867 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 21 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:21,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 903 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-16 21:47:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-16 21:47:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2021-11-16 21:47:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 115 states have (on average 1.182608695652174) internal successors, (136), 116 states have internal predecessors, (136), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-16 21:47:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 213 transitions. [2021-11-16 21:47:21,874 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 213 transitions. Word has length 191 [2021-11-16 21:47:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:21,875 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 213 transitions. [2021-11-16 21:47:21,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:47:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2021-11-16 21:47:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-16 21:47:21,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:21,877 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:21,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:22,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:22,087 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:22,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1805051498, now seen corresponding path program 1 times [2021-11-16 21:47:22,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:22,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642474695] [2021-11-16 21:47:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:22,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:22,133 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:22,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123386166] [2021-11-16 21:47:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:22,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:22,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:22,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:22,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 21:47:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:22,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 2834 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:47:22,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 21:47:22,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:22,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:22,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642474695] [2021-11-16 21:47:22,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:22,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123386166] [2021-11-16 21:47:22,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123386166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:22,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:22,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 21:47:22,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907638416] [2021-11-16 21:47:22,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:22,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:47:22,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:47:22,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:47:22,773 INFO L87 Difference]: Start difference. First operand 172 states and 213 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:47:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:22,794 INFO L93 Difference]: Finished difference Result 304 states and 379 transitions. [2021-11-16 21:47:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:47:22,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 191 [2021-11-16 21:47:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:22,796 INFO L225 Difference]: With dead ends: 304 [2021-11-16 21:47:22,796 INFO L226 Difference]: Without dead ends: 176 [2021-11-16 21:47:22,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:47:22,796 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 3 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:22,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 604 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:47:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-16 21:47:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2021-11-16 21:47:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 118 states have internal predecessors, (138), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-16 21:47:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2021-11-16 21:47:22,803 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 191 [2021-11-16 21:47:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:22,803 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2021-11-16 21:47:22,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:47:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2021-11-16 21:47:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-16 21:47:22,804 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:22,805 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:22,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:23,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:23,005 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 610784852, now seen corresponding path program 1 times [2021-11-16 21:47:23,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:23,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453667279] [2021-11-16 21:47:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:23,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:23,038 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:23,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516234870] [2021-11-16 21:47:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:23,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:23,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:23,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:23,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-16 21:47:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:23,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 2829 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-16 21:47:23,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:23,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2021-11-16 21:47:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-16 21:47:23,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:23,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:23,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453667279] [2021-11-16 21:47:23,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:23,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516234870] [2021-11-16 21:47:23,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516234870] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:23,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:23,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 21:47:23,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938906892] [2021-11-16 21:47:23,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:23,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:47:23,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:23,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:47:23,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:47:23,925 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 6 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-16 21:47:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:25,283 INFO L93 Difference]: Finished difference Result 330 states and 416 transitions. [2021-11-16 21:47:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-16 21:47:25,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 6 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 191 [2021-11-16 21:47:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:25,285 INFO L225 Difference]: With dead ends: 330 [2021-11-16 21:47:25,285 INFO L226 Difference]: Without dead ends: 200 [2021-11-16 21:47:25,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-11-16 21:47:25,286 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 127 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:25,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 1521 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-16 21:47:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-16 21:47:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 181. [2021-11-16 21:47:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 123 states have (on average 1.1788617886178863) internal successors, (145), 124 states have internal predecessors, (145), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2021-11-16 21:47:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2021-11-16 21:47:25,296 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 191 [2021-11-16 21:47:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:25,297 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2021-11-16 21:47:25,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 6 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-16 21:47:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2021-11-16 21:47:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-16 21:47:25,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:25,299 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:25,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:25,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-16 21:47:25,517 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash -841170410, now seen corresponding path program 1 times [2021-11-16 21:47:25,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:25,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419253196] [2021-11-16 21:47:25,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:25,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:25,548 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:25,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792636092] [2021-11-16 21:47:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:25,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:25,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:25,568 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:25,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-16 21:47:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:25,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 2832 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-16 21:47:25,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 21:47:26,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:26,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:26,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419253196] [2021-11-16 21:47:26,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:26,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792636092] [2021-11-16 21:47:26,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792636092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:26,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:26,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:47:26,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965257430] [2021-11-16 21:47:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:26,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:47:26,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:47:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:47:26,297 INFO L87 Difference]: Start difference. First operand 181 states and 226 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:47:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:26,324 INFO L93 Difference]: Finished difference Result 328 states and 413 transitions. [2021-11-16 21:47:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:47:26,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 191 [2021-11-16 21:47:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:26,327 INFO L225 Difference]: With dead ends: 328 [2021-11-16 21:47:26,328 INFO L226 Difference]: Without dead ends: 191 [2021-11-16 21:47:26,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:47:26,329 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 9 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:26,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 807 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:47:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-16 21:47:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2021-11-16 21:47:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 127 states have (on average 1.1732283464566928) internal successors, (149), 128 states have internal predecessors, (149), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2021-11-16 21:47:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 230 transitions. [2021-11-16 21:47:26,342 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 230 transitions. Word has length 191 [2021-11-16 21:47:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:26,342 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 230 transitions. [2021-11-16 21:47:26,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:47:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 230 transitions. [2021-11-16 21:47:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-11-16 21:47:26,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:26,344 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:26,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-11-16 21:47:26,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:26,559 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:26,560 INFO L85 PathProgramCache]: Analyzing trace with hash 955866556, now seen corresponding path program 1 times [2021-11-16 21:47:26,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:26,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073911400] [2021-11-16 21:47:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:26,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:26,608 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:26,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653338167] [2021-11-16 21:47:26,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:26,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:26,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:26,610 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:26,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-16 21:47:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:26,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 2829 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:47:26,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-11-16 21:47:27,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:47:27,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:27,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073911400] [2021-11-16 21:47:27,284 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:27,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653338167] [2021-11-16 21:47:27,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653338167] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:47:27,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:47:27,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:47:27,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723991513] [2021-11-16 21:47:27,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:27,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:47:27,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:47:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:47:27,286 INFO L87 Difference]: Start difference. First operand 185 states and 230 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:47:28,746 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:47:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:28,920 INFO L93 Difference]: Finished difference Result 326 states and 413 transitions. [2021-11-16 21:47:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:47:28,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 193 [2021-11-16 21:47:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:28,922 INFO L225 Difference]: With dead ends: 326 [2021-11-16 21:47:28,922 INFO L226 Difference]: Without dead ends: 185 [2021-11-16 21:47:28,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:47:28,923 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:28,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 755 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-16 21:47:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-16 21:47:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-11-16 21:47:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 128 states have internal predecessors, (148), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2021-11-16 21:47:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 229 transitions. [2021-11-16 21:47:28,930 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 229 transitions. Word has length 193 [2021-11-16 21:47:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:28,930 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 229 transitions. [2021-11-16 21:47:28,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:47:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 229 transitions. [2021-11-16 21:47:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-11-16 21:47:28,931 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:28,931 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:28,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:29,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-16 21:47:29,153 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:29,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash -100864646, now seen corresponding path program 1 times [2021-11-16 21:47:29,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:29,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868920894] [2021-11-16 21:47:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:29,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:29,185 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:29,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736160599] [2021-11-16 21:47:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:29,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:29,187 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:29,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-16 21:47:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:29,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 2834 conjuncts, 103 conjunts are in the unsatisfiable core [2021-11-16 21:47:29,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:33,046 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-16 21:47:33,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 74 [2021-11-16 21:47:33,051 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-16 21:47:33,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 48 [2021-11-16 21:47:33,055 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-16 21:47:33,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2021-11-16 21:47:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 129 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-16 21:47:33,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:34,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:47:34,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868920894] [2021-11-16 21:47:34,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:47:34,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736160599] [2021-11-16 21:47:34,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736160599] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:34,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:34,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2021-11-16 21:47:34,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904370767] [2021-11-16 21:47:34,063 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-16 21:47:34,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-16 21:47:34,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:47:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-16 21:47:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=842, Unknown=1, NotChecked=0, Total=930 [2021-11-16 21:47:34,064 INFO L87 Difference]: Start difference. First operand 185 states and 229 transitions. Second operand has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 20 states have internal predecessors, (98), 8 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) [2021-11-16 21:47:36,172 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:47:38,233 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:47:40,291 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:47:42,431 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:47:44,463 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:47:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:52,084 INFO L93 Difference]: Finished difference Result 421 states and 537 transitions. [2021-11-16 21:47:52,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-16 21:47:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 20 states have internal predecessors, (98), 8 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) Word has length 193 [2021-11-16 21:47:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:52,086 INFO L225 Difference]: With dead ends: 421 [2021-11-16 21:47:52,086 INFO L226 Difference]: Without dead ends: 292 [2021-11-16 21:47:52,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=354, Invalid=3183, Unknown=3, NotChecked=0, Total=3540 [2021-11-16 21:47:52,088 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 242 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 110 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 3330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:52,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 1474 Invalid, 3330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2957 Invalid, 3 Unknown, 260 Unchecked, 12.5s Time] [2021-11-16 21:47:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-16 21:47:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 210. [2021-11-16 21:47:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 148 states have internal predecessors, (168), 43 states have call successors, (43), 18 states have call predecessors, (43), 21 states have return successors, (51), 43 states have call predecessors, (51), 42 states have call successors, (51) [2021-11-16 21:47:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2021-11-16 21:47:52,098 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 193 [2021-11-16 21:47:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:52,099 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2021-11-16 21:47:52,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 20 states have internal predecessors, (98), 8 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) [2021-11-16 21:47:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2021-11-16 21:47:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-11-16 21:47:52,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:52,100 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:52,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:52,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-16 21:47:52,321 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash -348469826, now seen corresponding path program 1 times [2021-11-16 21:47:52,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:47:52,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162645092] [2021-11-16 21:47:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:52,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:47:52,357 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:47:52,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455038121] [2021-11-16 21:47:52,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:52,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:47:52,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:47:52,358 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:47:52,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-16 21:47:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:52,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 2855 conjuncts, 111 conjunts are in the unsatisfiable core [2021-11-16 21:47:52,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:52,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:47:53,188 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-16 21:47:53,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-11-16 21:47:55,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:47:55,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-11-16 21:48:07,610 WARN L860 $PredicateComparison]: unable to prove that (exists ((|aws_mul_size_checked_aws_mul_u64_checked_~b#1| Int) (|aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| Int) (|aws_mul_size_checked_aws_mul_u64_checked_~a#1| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_aws_mul_size_checked_#in~r#1.base| (store (select |c_old(#memory_int)| |c_aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| (* |aws_mul_size_checked_aws_mul_u64_checked_~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|))))) is different from true [2021-11-16 21:48:32,817 INFO L354 Elim1Store]: treesize reduction 116, result has 0.9 percent of original size [2021-11-16 21:48:32,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 1 [2021-11-16 21:48:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 139 proven. 22 refuted. 0 times theorem prover too weak. 53 trivial. 3 not checked. [2021-11-16 21:48:32,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:48:35,048 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_aws_priority_queue_size_harness_~#old_backpointers~0#1.base_8| Int) (|v_ULTIMATE.start_aws_priority_queue_size_harness_~#old_backpointers~0#1.offset_8| Int)) (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_aws_priority_queue_size_harness_~#queue~0#1.base|) (+ 56 |c_ULTIMATE.start_aws_priority_queue_size_harness_~#queue~0#1.offset|)) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_priority_queue_size_harness_~#old_backpointers~0#1.base_8|) (+ |v_ULTIMATE.start_aws_priority_queue_size_harness_~#old_backpointers~0#1.offset_8| 8))))) is different from false [2021-11-16 21:48:35,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:48:35,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162645092] [2021-11-16 21:48:35,060 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:48:35,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455038121] [2021-11-16 21:48:35,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455038121] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:48:35,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:48:35,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2021-11-16 21:48:35,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921438916] [2021-11-16 21:48:35,060 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-16 21:48:35,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-16 21:48:35,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:48:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-16 21:48:35,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=802, Unknown=22, NotChecked=118, Total=1056 [2021-11-16 21:48:35,062 INFO L87 Difference]: Start difference. First operand 210 states and 262 transitions. Second operand has 32 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 12 states have call successors, (28), 7 states have call predecessors, (28), 12 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2021-11-16 21:48:37,581 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:48:40,442 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:48:42,658 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:48:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:48:50,676 INFO L93 Difference]: Finished difference Result 452 states and 572 transitions. [2021-11-16 21:48:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-16 21:48:50,677 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 12 states have call successors, (28), 7 states have call predecessors, (28), 12 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) Word has length 200 [2021-11-16 21:48:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:48:50,678 INFO L225 Difference]: With dead ends: 452 [2021-11-16 21:48:50,679 INFO L226 Difference]: Without dead ends: 289 [2021-11-16 21:48:50,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 238 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=158, Invalid=1230, Unknown=26, NotChecked=146, Total=1560 [2021-11-16 21:48:50,680 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 174 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 104 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1939 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:48:50,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1500 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1006 Invalid, 2 Unknown, 1939 Unchecked, 8.4s Time] [2021-11-16 21:48:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-16 21:48:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2021-11-16 21:48:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 191 states have (on average 1.1518324607329844) internal successors, (220), 198 states have internal predecessors, (220), 47 states have call successors, (47), 22 states have call predecessors, (47), 30 states have return successors, (76), 48 states have call predecessors, (76), 46 states have call successors, (76) [2021-11-16 21:48:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 343 transitions. [2021-11-16 21:48:50,692 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 343 transitions. Word has length 200 [2021-11-16 21:48:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:48:50,692 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 343 transitions. [2021-11-16 21:48:50,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 12 states have call successors, (28), 7 states have call predecessors, (28), 12 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2021-11-16 21:48:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 343 transitions. [2021-11-16 21:48:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-16 21:48:50,693 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:48:50,694 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:48:50,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-11-16 21:48:50,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-16 21:48:50,917 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:48:50,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:48:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2062409755, now seen corresponding path program 1 times [2021-11-16 21:48:50,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:48:50,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009518204] [2021-11-16 21:48:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:48:50,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:48:50,953 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:48:50,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048666724] [2021-11-16 21:48:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:48:50,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:48:50,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:48:50,955 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:48:50,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-16 21:48:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:48:51,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 2878 conjuncts, 150 conjunts are in the unsatisfiable core [2021-11-16 21:48:51,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:48:51,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:48:51,802 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-16 21:48:51,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-11-16 21:49:06,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:49:06,642 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-11-16 21:49:06,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 30 [2021-11-16 21:49:15,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:15,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2021-11-16 21:49:15,628 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-16 21:49:15,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-16 21:49:17,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:17,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:17,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:49:17,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2021-11-16 21:49:19,313 WARN L860 $PredicateComparison]: unable to prove that (exists ((|aws_mul_size_checked_aws_mul_u64_checked_~b#1| Int) (|aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| Int) (|aws_mul_size_checked_aws_mul_u64_checked_~a#1| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_aws_mul_size_checked_#in~r#1.base| (store (select |c_old(#memory_int)| |c_aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| (* |aws_mul_size_checked_aws_mul_u64_checked_~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|))))) is different from true [2021-11-16 21:49:35,768 WARN L860 $PredicateComparison]: unable to prove that (exists ((|aws_mul_size_checked_aws_mul_u64_checked_~b#1| Int) (|aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| Int) (|aws_mul_size_checked_aws_mul_u64_checked_~a#1| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| (store (select |c_old(#memory_int)| |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base|) |c_aws_mul_size_checked_#in~r#1.offset| (* |aws_mul_size_checked_aws_mul_u64_checked_~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|))))) is different from true [2021-11-16 21:50:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 127 proven. 22 refuted. 4 times theorem prover too weak. 54 trivial. 3 not checked. [2021-11-16 21:50:03,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:50:09,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:50:09,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009518204] [2021-11-16 21:50:09,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:50:09,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048666724] [2021-11-16 21:50:09,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048666724] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:50:09,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:50:09,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2021-11-16 21:50:09,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606595950] [2021-11-16 21:50:09,161 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-16 21:50:09,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-11-16 21:50:09,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:50:09,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-16 21:50:09,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2244, Unknown=28, NotChecked=194, Total=2652 [2021-11-16 21:50:09,163 INFO L87 Difference]: Start difference. First operand 269 states and 343 transitions. Second operand has 45 states, 40 states have (on average 2.925) internal successors, (117), 38 states have internal predecessors, (117), 15 states have call successors, (29), 10 states have call predecessors, (29), 14 states have return successors, (27), 14 states have call predecessors, (27), 15 states have call successors, (27) [2021-11-16 21:50:10,311 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:50:12,112 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:50:13,905 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:51:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:51:20,073 INFO L93 Difference]: Finished difference Result 571 states and 732 transitions. [2021-11-16 21:51:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-16 21:51:20,073 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.925) internal successors, (117), 38 states have internal predecessors, (117), 15 states have call successors, (29), 10 states have call predecessors, (29), 14 states have return successors, (27), 14 states have call predecessors, (27), 15 states have call successors, (27) Word has length 206 [2021-11-16 21:51:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:51:20,076 INFO L225 Difference]: With dead ends: 571 [2021-11-16 21:51:20,076 INFO L226 Difference]: Without dead ends: 366 [2021-11-16 21:51:20,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 231 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 136.6s TimeCoverageRelationStatistics Valid=256, Invalid=3356, Unknown=56, NotChecked=238, Total=3906 [2021-11-16 21:51:20,077 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 171 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 4110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2769 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:51:20,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 1869 Invalid, 4110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1245 Invalid, 0 Unknown, 2769 Unchecked, 6.0s Time] [2021-11-16 21:51:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-16 21:51:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 316. [2021-11-16 21:51:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 223 states have (on average 1.15695067264574) internal successors, (258), 231 states have internal predecessors, (258), 54 states have call successors, (54), 29 states have call predecessors, (54), 38 states have return successors, (91), 55 states have call predecessors, (91), 53 states have call successors, (91) [2021-11-16 21:51:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 403 transitions. [2021-11-16 21:51:20,106 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 403 transitions. Word has length 206 [2021-11-16 21:51:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:51:20,106 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 403 transitions. [2021-11-16 21:51:20,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.925) internal successors, (117), 38 states have internal predecessors, (117), 15 states have call successors, (29), 10 states have call predecessors, (29), 14 states have return successors, (27), 14 states have call predecessors, (27), 15 states have call successors, (27) [2021-11-16 21:51:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 403 transitions. [2021-11-16 21:51:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-16 21:51:20,111 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:51:20,111 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:51:20,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-16 21:51:20,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-16 21:51:20,332 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:51:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:51:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash -836732481, now seen corresponding path program 1 times [2021-11-16 21:51:20,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:51:20,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303791134] [2021-11-16 21:51:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:51:20,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:51:20,365 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:51:20,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302619842] [2021-11-16 21:51:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:51:20,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:51:20,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:51:20,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:51:20,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-16 21:51:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:51:20,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 2907 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-16 21:51:20,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:51:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-11-16 21:51:21,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:51:21,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:51:21,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303791134] [2021-11-16 21:51:21,206 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:51:21,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302619842] [2021-11-16 21:51:21,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302619842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:51:21,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:51:21,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 21:51:21,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228107656] [2021-11-16 21:51:21,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:51:21,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:51:21,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:51:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:51:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:51:21,207 INFO L87 Difference]: Start difference. First operand 316 states and 403 transitions. Second operand has 14 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 4 states have call successors, (29), 2 states have call predecessors, (29), 6 states have return successors, (28), 5 states have call predecessors, (28), 4 states have call successors, (28) [2021-11-16 21:51:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:51:21,378 INFO L93 Difference]: Finished difference Result 521 states and 661 transitions. [2021-11-16 21:51:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 21:51:21,379 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 4 states have call successors, (29), 2 states have call predecessors, (29), 6 states have return successors, (28), 5 states have call predecessors, (28), 4 states have call successors, (28) Word has length 218 [2021-11-16 21:51:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:51:21,380 INFO L225 Difference]: With dead ends: 521 [2021-11-16 21:51:21,380 INFO L226 Difference]: Without dead ends: 337 [2021-11-16 21:51:21,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:51:21,381 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 12 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:51:21,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 2690 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:51:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-16 21:51:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 332. [2021-11-16 21:51:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 237 states have (on average 1.160337552742616) internal successors, (275), 246 states have internal predecessors, (275), 54 states have call successors, (54), 29 states have call predecessors, (54), 40 states have return successors, (91), 56 states have call predecessors, (91), 53 states have call successors, (91) [2021-11-16 21:51:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 420 transitions. [2021-11-16 21:51:21,393 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 420 transitions. Word has length 218 [2021-11-16 21:51:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:51:21,393 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 420 transitions. [2021-11-16 21:51:21,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 4 states have call successors, (29), 2 states have call predecessors, (29), 6 states have return successors, (28), 5 states have call predecessors, (28), 4 states have call successors, (28) [2021-11-16 21:51:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 420 transitions. [2021-11-16 21:51:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-16 21:51:21,395 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:51:21,395 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:51:21,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-16 21:51:21,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:51:21,611 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:51:21,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:51:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1542726051, now seen corresponding path program 1 times [2021-11-16 21:51:21,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:51:21,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076482765] [2021-11-16 21:51:21,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:51:21,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:51:21,642 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:51:21,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548908918] [2021-11-16 21:51:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:51:21,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:51:21,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:51:21,644 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:51:21,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-16 21:51:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:51:23,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 2875 conjuncts, 324 conjunts are in the unsatisfiable core [2021-11-16 21:51:23,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:51:23,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:51:23,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-16 21:51:23,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-16 21:51:23,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2021-11-16 21:51:23,588 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-16 21:51:23,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 22 [2021-11-16 21:51:27,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-16 21:51:49,025 INFO L354 Elim1Store]: treesize reduction 58, result has 59.7 percent of original size [2021-11-16 21:51:49,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 137 treesize of output 192 [2021-11-16 21:58:26,363 INFO L354 Elim1Store]: treesize reduction 1174, result has 7.2 percent of original size [2021-11-16 21:58:26,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 58 case distinctions, treesize of input 2761 treesize of output 2745 [2021-11-16 21:58:28,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:58:28,508 INFO L354 Elim1Store]: treesize reduction 176, result has 12.4 percent of original size [2021-11-16 21:58:28,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 58 treesize of output 64 [2021-11-16 21:59:21,485 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-11-16 21:59:21,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:59:21,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076482765] [2021-11-16 21:59:21,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:59:21,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548908918] [2021-11-16 21:59:21,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-11-16 21:59:21,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:59:21,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-16 21:59:21,486 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-16 21:59:21,486 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-16 21:59:21,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2021-11-16 21:59:21,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 21:59:21,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-11-16 21:59:21,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-16 21:59:21,718 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:59:21,723 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:59:21,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:59:21 BoogieIcfgContainer [2021-11-16 21:59:21,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:59:21,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:59:21,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:59:21,796 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:59:21,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:47:11" (3/4) ... [2021-11-16 21:59:21,799 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-16 21:59:21,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:59:21,799 INFO L158 Benchmark]: Toolchain (without parser) took 733210.44ms. Allocated memory was 109.1MB in the beginning and 398.5MB in the end (delta: 289.4MB). Free memory was 75.2MB in the beginning and 156.3MB in the end (delta: -81.1MB). Peak memory consumption was 207.2MB. Max. memory is 16.1GB. [2021-11-16 21:59:21,799 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:59:21,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1325.58ms. Allocated memory was 109.1MB in the beginning and 144.7MB in the end (delta: 35.7MB). Free memory was 74.9MB in the beginning and 89.5MB in the end (delta: -14.5MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2021-11-16 21:59:21,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.60ms. Allocated memory is still 144.7MB. Free memory was 89.5MB in the beginning and 80.7MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-16 21:59:21,800 INFO L158 Benchmark]: Boogie Preprocessor took 84.99ms. Allocated memory is still 144.7MB. Free memory was 80.7MB in the beginning and 74.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 21:59:21,800 INFO L158 Benchmark]: RCFGBuilder took 1266.01ms. Allocated memory was 144.7MB in the beginning and 224.4MB in the end (delta: 79.7MB). Free memory was 74.4MB in the beginning and 150.8MB in the end (delta: -76.3MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2021-11-16 21:59:21,800 INFO L158 Benchmark]: TraceAbstraction took 730388.61ms. Allocated memory was 224.4MB in the beginning and 398.5MB in the end (delta: 174.1MB). Free memory was 149.7MB in the beginning and 157.4MB in the end (delta: -7.7MB). Peak memory consumption was 166.4MB. Max. memory is 16.1GB. [2021-11-16 21:59:21,801 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 398.5MB. Free memory was 157.4MB in the beginning and 156.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:59:21,801 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1325.58ms. Allocated memory was 109.1MB in the beginning and 144.7MB in the end (delta: 35.7MB). Free memory was 74.9MB in the beginning and 89.5MB in the end (delta: -14.5MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.60ms. Allocated memory is still 144.7MB. Free memory was 89.5MB in the beginning and 80.7MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.99ms. Allocated memory is still 144.7MB. Free memory was 80.7MB in the beginning and 74.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1266.01ms. Allocated memory was 144.7MB in the beginning and 224.4MB in the end (delta: 79.7MB). Free memory was 74.4MB in the beginning and 150.8MB in the end (delta: -76.3MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * TraceAbstraction took 730388.61ms. Allocated memory was 224.4MB in the beginning and 398.5MB in the end (delta: 174.1MB). Free memory was 149.7MB in the beginning and 157.4MB in the end (delta: -7.7MB). Peak memory consumption was 166.4MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 398.5MB. Free memory was 157.4MB in the beginning and 156.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 7720. Possible FailurePath: [L2762-L2767] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7310] static __thread int tl_last_error = 0; [L7719-L7867] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L7870-L7873] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7875-L7884] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L7886-L7889] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L7891-L7895] static _Bool s_common_library_initialized = 0 ; [L7934] CALL aws_priority_queue_size_harness() [L7909] struct aws_priority_queue queue; [L7912] CALL, EXPR aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2) [L7012] CALL, EXPR aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size) [L6956] EXPR list->item_size [L6955-L6956] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6959] EXPR list->length [L6958-L6959] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6960] return item_size_is_bounded && length_is_bounded; [L7012] RET, EXPR aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size) [L7010-L7012] _Bool container_is_bounded = aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size); [L7019-L7020] CALL, EXPR aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)) [L6956] EXPR list->item_size [L6955-L6956] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6959] EXPR list->length [L6958-L6959] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6960] return item_size_is_bounded && length_is_bounded; [L7019-L7020] RET, EXPR aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)) [L7018-L7020] _Bool backpointers_list_is_bounded = aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)); [L7021] return container_is_bounded && backpointers_list_is_bounded; [L7912] RET, EXPR aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2) [L7912] CALL assume_abort_if_not(aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2)) [L211] COND FALSE !(!cond) [L7912] RET assume_abort_if_not(aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2)) [L7913] CALL ensure_priority_queue_has_allocated_members(&queue) [L7025] CALL ensure_array_list_has_allocated_data_member(&queue->container) [L6964] EXPR list->current_size [L6964] list->current_size == 0 && list->length == 0 [L6964] EXPR list->length [L6964] list->current_size == 0 && list->length == 0 [L6964] COND TRUE list->current_size == 0 && list->length == 0 [L6965] EXPR list->data [L6965-L6967] CALL assume_abort_if_not(list->data == ((void *)0) ) [L211] COND FALSE !(!cond) [L6965-L6967] RET assume_abort_if_not(list->data == ((void *)0) ) [L6968] CALL, EXPR can_fail_allocator() [L2786] return &s_can_fail_allocator_static; [L6968] RET, EXPR can_fail_allocator() [L6968] list->alloc = can_fail_allocator() [L7025] RET ensure_array_list_has_allocated_data_member(&queue->container) [L7026] CALL ensure_array_list_has_allocated_data_member(&queue->backpointers) [L6964] EXPR list->current_size [L6964] list->current_size == 0 && list->length == 0 [L6964] COND FALSE !(list->current_size == 0 && list->length == 0) [L6970] EXPR list->current_size [L6970] CALL, EXPR bounded_malloc(list->current_size) [L2779-L2781] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) [L2779-L2781] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L2782] return malloc(size); [L6970] RET, EXPR bounded_malloc(list->current_size) [L6970] list->data = bounded_malloc(list->current_size) [L6971] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6971] RET, EXPR nondet_bool() [L6971-L6973] EXPR nondet_bool() ? ((void *)0) : can_fail_allocator() [L6971-L6973] list->alloc = nondet_bool() ? ((void *)0) : can_fail_allocator() [L7026] RET ensure_array_list_has_allocated_data_member(&queue->backpointers) [L7027] queue->pred = nondet_compare [L7913] RET ensure_priority_queue_has_allocated_members(&queue) [L7914] CALL, EXPR aws_priority_queue_is_valid(&queue) [L7501] COND FALSE !(!queue) [L7508] EXPR queue->pred [L7507-L7510] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L7513] CALL, EXPR aws_array_list_is_valid(&queue->container) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L7513] RET, EXPR aws_array_list_is_valid(&queue->container) [L7512-L7513] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L7517] CALL, EXPR aws_priority_queue_backpointers_valid(queue) [L7442] COND FALSE !(!queue) [L7452] CALL, EXPR aws_array_list_is_valid(&queue->backpointers) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3281] EXPR list->current_size [L3281] EXPR (((list->current_size)) == 0) || ((list->data)) [L3281] EXPR list->data [L3281] EXPR (((list->current_size)) == 0) || ((list->data)) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L7452] RET, EXPR aws_array_list_is_valid(&queue->backpointers) [L7452] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L7452] EXPR queue->backpointers.current_size [L7452] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L7452-L7455] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L7453] EXPR queue->backpointers.data [L7452-L7455] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L7450-L7455] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L7463] EXPR queue->backpointers.item_size [L7462-L7463] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L7466] EXPR queue->backpointers.length [L7466] EXPR queue->container.length [L7465-L7466] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L7469] EXPR queue->backpointers.current_size [L7468-L7469] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L7477-L7480] _Bool backpointers_valid_deep = 1 ; [L7485] EXPR queue->backpointers.current_size [L7485] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L7485-L7486] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L7483-L7487] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L7489-L7492] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L7494] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L7494] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L7517] RET, EXPR aws_priority_queue_backpointers_valid(queue) [L7516-L7517] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L7518] return pred_is_valid && container_is_valid && backpointers_valid; [L7914] RET, EXPR aws_priority_queue_is_valid(&queue) [L7914] CALL assume_abort_if_not(aws_priority_queue_is_valid(&queue)) [L211] COND FALSE !(!cond) [L7914] RET assume_abort_if_not(aws_priority_queue_is_valid(&queue)) [L7917] struct aws_array_list old_container = queue.container; [L7918] struct store_byte_from_buffer old_byte_container; [L7919] EXPR old_container.data [L7919] EXPR old_container.current_size [L7919] CALL save_byte_from_array((uint8_t *)old_container.data, old_container.current_size, &old_byte_container) [L7134] COND FALSE !(size > 0 && array && storage) [L7919] RET save_byte_from_array((uint8_t *)old_container.data, old_container.current_size, &old_byte_container) [L7922] struct aws_array_list old_backpointers = queue.backpointers; [L7923] struct store_byte_from_buffer old_byte_backpointers; [L7924] EXPR old_backpointers.data [L7924] EXPR old_backpointers.current_size [L7924] CALL save_byte_from_array((uint8_t *)old_backpointers.data, old_backpointers.current_size, &old_byte_backpointers) [L7134] COND TRUE size > 0 && array && storage [L7135] CALL, EXPR nondet_size_t() [L263] return __VERIFIER_nondet_ulong(); [L7135] RET, EXPR nondet_size_t() [L7135] storage->index = nondet_size_t() [L7136] EXPR storage->index [L7136] CALL assume_abort_if_not(storage->index < size) [L211] COND FALSE !(!cond) [L7136] RET assume_abort_if_not(storage->index < size) [L7137] EXPR storage->index [L7137] EXPR array[storage->index] [L7137] storage->byte = array[storage->index] [L7924] RET save_byte_from_array((uint8_t *)old_backpointers.data, old_backpointers.current_size, &old_byte_backpointers) [L7927] CALL aws_priority_queue_size(&queue) [L7534] CALL aws_array_list_length(&queue->container) [L3475] EXPR list->length [L3475] EXPR !list->length || list->data [L3475] CALL assume_abort_if_not((!list->length || list->data)) [L211] COND FALSE !(!cond) [L3475] RET assume_abort_if_not((!list->length || list->data)) [L3476] CALL, EXPR aws_array_list_is_valid(list) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3476] RET, EXPR aws_array_list_is_valid(list) [L3476] CALL assume_abort_if_not((aws_array_list_is_valid(list))) [L211] COND FALSE !(!cond) [L3476] RET assume_abort_if_not((aws_array_list_is_valid(list))) [L3477] EXPR list->length [L3477] size_t len = list->length; [L3478] CALL, EXPR aws_array_list_is_valid(list) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L3272] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2588] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2496] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] RET __CPROVER_overflow_mult(a, b) [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3272] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3478] RET, EXPR aws_array_list_is_valid(list) [L3478] CALL __VERIFIER_assert((aws_array_list_is_valid(list))) [L223] COND TRUE !cond [L223] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 730.3s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 111.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1978 SdHoareTripleChecker+Valid, 32.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1836 mSDsluCounter, 17922 SdHoareTripleChecker+Invalid, 31.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4968 IncrementalHoareTripleChecker+Unchecked, 14885 mSDsCounter, 632 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7429 IncrementalHoareTripleChecker+Invalid, 13034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 632 mSolverCounterUnsat, 3037 mSDtfsCounter, 7429 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2889 GetRequests, 2599 SyntacticMatches, 19 SemanticMatches, 271 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 193.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=16, InterpolantAutomatonStates: 220, 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, 16 MinimizatonAttempts, 337 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 607.1s InterpolantComputationTime, 2991 NumberOfCodeBlocks, 2991 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2768 ConstructedInterpolants, 137 QuantifiedInterpolants, 10755 SizeOfPredicates, 174 NumberOfNonLiveVariables, 40659 ConjunctsInSsa, 838 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 2488/2552 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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 ../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 1baae56bade188786b6c048f5a5545dd6165460ea50e58a0310e4360c89d1838 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:59:23,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:59:23,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:59:23,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:59:23,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:59:23,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:59:23,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:59:23,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:59:23,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:59:23,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:59:23,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:59:23,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:59:23,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:59:23,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:59:23,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:59:23,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:59:23,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:59:23,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:59:23,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:59:23,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:59:23,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:59:23,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:59:23,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:59:23,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:59:23,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:59:23,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:59:23,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:59:23,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:59:23,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:59:23,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:59:23,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:59:23,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:59:23,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:59:23,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:59:23,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:59:23,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:59:23,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:59:23,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:59:23,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:59:23,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:59:23,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:59:23,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-16 21:59:23,588 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:59:23,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:59:23,590 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:59:23,590 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:59:23,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:59:23,590 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:59:23,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:59:23,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:59:23,592 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:59:23,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:59:23,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:59:23,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:59:23,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:59:23,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:59:23,593 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-16 21:59:23,593 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-16 21:59:23,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:59:23,594 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:59:23,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:59:23,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:59:23,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:59:23,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:59:23,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:59:23,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:59:23,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:59:23,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:59:23,595 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-16 21:59:23,595 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-16 21:59:23,595 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:59:23,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:59:23,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:59:23,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:59:23,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-16 21:59:23,596 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> 1baae56bade188786b6c048f5a5545dd6165460ea50e58a0310e4360c89d1838 [2021-11-16 21:59:23,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:59:23,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:59:23,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:59:23,879 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:59:23,880 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:59:23,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-11-16 21:59:23,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf544113/9498e90db08d48e39403d0fb8a9ddad9/FLAGd926c888a [2021-11-16 21:59:24,472 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:59:24,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-11-16 21:59:24,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf544113/9498e90db08d48e39403d0fb8a9ddad9/FLAGd926c888a [2021-11-16 21:59:24,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf544113/9498e90db08d48e39403d0fb8a9ddad9 [2021-11-16 21:59:24,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:59:24,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:59:24,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:59:24,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:59:24,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:59:24,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:59:24" (1/1) ... [2021-11-16 21:59:24,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73117435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:24, skipping insertion in model container [2021-11-16 21:59:24,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:59:24" (1/1) ... [2021-11-16 21:59:24,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:59:25,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:59:25,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4497,4510] [2021-11-16 21:59:25,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4557,4570] [2021-11-16 21:59:25,289 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:59:25,294 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:59:25,735 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:59:25,786 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:25,788 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:25,789 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:25,789 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:25,790 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:25,801 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:25,812 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:25,813 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:25,814 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,047 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:59:26,048 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:59:26,048 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:59:26,049 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:59:26,050 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:59:26,050 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:59:26,050 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:59:26,051 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:59:26,051 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:59:26,051 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:59:26,168 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,168 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,211 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:59:26,267 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:59:26,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4497,4510] [2021-11-16 21:59:26,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4557,4570] [2021-11-16 21:59:26,287 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:59:26,288 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:59:26,315 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:59:26,335 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,344 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,344 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,345 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,345 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,351 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,352 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,352 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,352 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,400 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:59:26,401 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:59:26,402 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:59:26,402 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:59:26,403 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:59:26,403 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:59:26,404 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:59:26,404 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:59:26,406 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:59:26,406 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:59:26,436 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,436 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:59:26,463 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:59:26,621 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:59:26,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26 WrapperNode [2021-11-16 21:59:26,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:59:26,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:59:26,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:59:26,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:59:26,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,805 INFO L137 Inliner]: procedures = 711, calls = 1533, calls flagged for inlining = 55, calls inlined = 10, statements flattened = 663 [2021-11-16 21:59:26,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:59:26,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:59:26,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:59:26,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:59:26,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:59:26,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:59:26,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:59:26,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:59:26,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (1/1) ... [2021-11-16 21:59:26,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:59:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:59:26,930 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) [2021-11-16 21:59:26,955 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 [2021-11-16 21:59:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2021-11-16 21:59:26,979 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2021-11-16 21:59:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:59:26,980 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2021-11-16 21:59:26,980 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2021-11-16 21:59:26,980 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2021-11-16 21:59:26,981 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2021-11-16 21:59:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:59:26,981 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:59:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-16 21:59:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-16 21:59:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-16 21:59:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 21:59:26,982 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 21:59:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:59:26,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:59:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:59:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:59:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2021-11-16 21:59:26,982 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2021-11-16 21:59:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:59:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:59:26,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:59:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:59:26,984 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:59:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-16 21:59:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 21:59:26,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 21:59:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-16 21:59:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 21:59:26,984 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 21:59:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2021-11-16 21:59:26,985 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2021-11-16 21:59:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2021-11-16 21:59:26,985 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2021-11-16 21:59:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:59:26,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:59:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:59:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 21:59:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:59:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-16 21:59:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-16 21:59:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:59:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 21:59:26,986 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 21:59:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 21:59:26,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 21:59:26,987 INFO L130 BoogieDeclarations]: Found specification of procedure assert_array_list_equivalence [2021-11-16 21:59:26,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_array_list_equivalence [2021-11-16 21:59:26,988 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:59:26,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:59:27,232 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:59:27,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:59:30,147 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:59:30,157 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:59:30,158 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-16 21:59:30,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:59:30 BoogieIcfgContainer [2021-11-16 21:59:30,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:59:30,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:59:30,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:59:30,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:59:30,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:59:24" (1/3) ... [2021-11-16 21:59:30,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c708a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:59:30, skipping insertion in model container [2021-11-16 21:59:30,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:59:26" (2/3) ... [2021-11-16 21:59:30,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c708a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:59:30, skipping insertion in model container [2021-11-16 21:59:30,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:59:30" (3/3) ... [2021-11-16 21:59:30,166 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_size_harness.i [2021-11-16 21:59:30,171 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:59:30,171 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 21:59:30,210 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:59:30,216 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 21:59:30,217 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 21:59:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 114 states have internal predecessors, (139), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2021-11-16 21:59:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-16 21:59:30,244 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:59:30,245 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:59:30,249 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:59:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:59:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1923135121, now seen corresponding path program 1 times [2021-11-16 21:59:30,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:59:30,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335620478] [2021-11-16 21:59:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:59:30,266 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:59:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:59:30,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:59:30,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-16 21:59:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:59:30,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-16 21:59:30,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:59:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-16 21:59:31,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:59:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-16 21:59:31,245 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:59:31,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335620478] [2021-11-16 21:59:31,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335620478] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:59:31,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:59:31,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2021-11-16 21:59:31,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271659921] [2021-11-16 21:59:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:59:31,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 21:59:31,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:59:31,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 21:59:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:59:31,273 INFO L87 Difference]: Start difference. First operand has 171 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 114 states have internal predecessors, (139), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 21:59:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:59:31,317 INFO L93 Difference]: Finished difference Result 331 states and 448 transitions. [2021-11-16 21:59:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 21:59:31,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2021-11-16 21:59:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:59:31,327 INFO L225 Difference]: With dead ends: 331 [2021-11-16 21:59:31,327 INFO L226 Difference]: Without dead ends: 166 [2021-11-16 21:59:31,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:59:31,346 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:59:31,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:59:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-16 21:59:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-16 21:59:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 110 states have internal predecessors, (132), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-16 21:59:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2021-11-16 21:59:31,377 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 107 [2021-11-16 21:59:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:59:31,378 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2021-11-16 21:59:31,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 21:59:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2021-11-16 21:59:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-16 21:59:31,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:59:31,380 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:59:31,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-16 21:59:31,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:59:31,597 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:59:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:59:31,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1898390481, now seen corresponding path program 1 times [2021-11-16 21:59:31,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:59:31,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960875471] [2021-11-16 21:59:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:59:31,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:59:31,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:59:31,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:59:31,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-16 21:59:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:59:32,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 21:59:32,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:59:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-16 21:59:32,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:59:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-11-16 21:59:32,638 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:59:32,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960875471] [2021-11-16 21:59:32,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960875471] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:59:32,639 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:59:32,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-16 21:59:32,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743017580] [2021-11-16 21:59:32,639 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:59:32,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:59:32,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:59:32,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:59:32,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:59:32,644 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-16 21:59:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:59:32,785 INFO L93 Difference]: Finished difference Result 290 states and 367 transitions. [2021-11-16 21:59:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:59:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 107 [2021-11-16 21:59:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:59:32,791 INFO L225 Difference]: With dead ends: 290 [2021-11-16 21:59:32,792 INFO L226 Difference]: Without dead ends: 166 [2021-11-16 21:59:32,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:59:32,796 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 56 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:59:32,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 574 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:59:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-16 21:59:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-16 21:59:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.201834862385321) internal successors, (131), 110 states have internal predecessors, (131), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-16 21:59:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2021-11-16 21:59:32,818 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 107 [2021-11-16 21:59:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:59:32,819 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2021-11-16 21:59:32,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-16 21:59:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2021-11-16 21:59:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-16 21:59:32,827 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:59:32,827 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:59:32,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-16 21:59:33,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:59:33,046 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:59:33,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:59:33,046 INFO L85 PathProgramCache]: Analyzing trace with hash 413511437, now seen corresponding path program 1 times [2021-11-16 21:59:33,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:59:33,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033475809] [2021-11-16 21:59:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:59:33,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:59:33,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:59:33,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:59:33,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-16 21:59:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:59:33,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:59:33,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:59:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-16 21:59:33,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:59:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-16 21:59:34,156 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:59:34,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033475809] [2021-11-16 21:59:34,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033475809] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:59:34,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:59:34,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2021-11-16 21:59:34,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138582302] [2021-11-16 21:59:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:59:34,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:59:34,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:59:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:59:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:59:34,157 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-16 21:59:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:59:34,368 INFO L93 Difference]: Finished difference Result 309 states and 396 transitions. [2021-11-16 21:59:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:59:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 115 [2021-11-16 21:59:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:59:34,371 INFO L225 Difference]: With dead ends: 309 [2021-11-16 21:59:34,371 INFO L226 Difference]: Without dead ends: 168 [2021-11-16 21:59:34,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:59:34,372 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 81 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:59:34,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1075 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:59:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-16 21:59:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-11-16 21:59:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.2) internal successors, (132), 112 states have internal predecessors, (132), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-11-16 21:59:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2021-11-16 21:59:34,383 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 115 [2021-11-16 21:59:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:59:34,384 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2021-11-16 21:59:34,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-16 21:59:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2021-11-16 21:59:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 21:59:34,385 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:59:34,385 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:59:34,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-16 21:59:34,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:59:34,617 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:59:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:59:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -445935835, now seen corresponding path program 1 times [2021-11-16 21:59:34,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:59:34,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833525253] [2021-11-16 21:59:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:59:34,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:59:34,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:59:34,620 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:59:34,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-16 21:59:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:59:35,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 1305 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:59:35,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:59:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-16 21:59:35,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:59:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-11-16 21:59:35,679 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:59:35,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833525253] [2021-11-16 21:59:35,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833525253] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:59:35,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:59:35,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-11-16 21:59:35,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956884669] [2021-11-16 21:59:35,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:59:35,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:59:35,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:59:35,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:59:35,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:59:35,680 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-16 21:59:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:59:35,714 INFO L93 Difference]: Finished difference Result 297 states and 384 transitions. [2021-11-16 21:59:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:59:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2021-11-16 21:59:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:59:35,717 INFO L225 Difference]: With dead ends: 297 [2021-11-16 21:59:35,717 INFO L226 Difference]: Without dead ends: 173 [2021-11-16 21:59:35,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:59:35,718 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:59:35,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 611 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:59:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-16 21:59:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2021-11-16 21:59:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 114 states have internal predecessors, (134), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-11-16 21:59:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2021-11-16 21:59:35,725 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 130 [2021-11-16 21:59:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:59:35,726 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2021-11-16 21:59:35,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-16 21:59:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2021-11-16 21:59:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 21:59:35,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:59:35,727 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:59:35,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-16 21:59:35,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:59:35,945 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:59:35,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:59:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash -879664921, now seen corresponding path program 1 times [2021-11-16 21:59:35,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:59:35,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220084172] [2021-11-16 21:59:35,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:59:35,947 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:59:35,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:59:35,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:59:35,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-16 21:59:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:59:36,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:59:36,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:59:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-16 21:59:36,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:59:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-16 21:59:37,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:59:37,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220084172] [2021-11-16 21:59:37,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220084172] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:59:37,189 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:59:37,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-16 21:59:37,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19529589] [2021-11-16 21:59:37,189 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:59:37,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:59:37,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:59:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:59:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:59:37,190 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:59:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:59:37,323 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2021-11-16 21:59:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:59:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 130 [2021-11-16 21:59:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:59:37,325 INFO L225 Difference]: With dead ends: 299 [2021-11-16 21:59:37,325 INFO L226 Difference]: Without dead ends: 170 [2021-11-16 21:59:37,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:59:37,326 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 100 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:59:37,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 726 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:59:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-16 21:59:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-11-16 21:59:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.1875) internal successors, (133), 114 states have internal predecessors, (133), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-11-16 21:59:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2021-11-16 21:59:37,332 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 130 [2021-11-16 21:59:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:59:37,332 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2021-11-16 21:59:37,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:59:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2021-11-16 21:59:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-16 21:59:37,334 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:59:37,334 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:59:37,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-16 21:59:37,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:59:37,554 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:59:37,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:59:37,554 INFO L85 PathProgramCache]: Analyzing trace with hash 391202648, now seen corresponding path program 1 times [2021-11-16 21:59:37,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:59:37,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937706719] [2021-11-16 21:59:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:59:37,555 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:59:37,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:59:37,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:59:37,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-16 21:59:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:59:38,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:59:38,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:59:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-16 21:59:38,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:59:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-11-16 21:59:38,964 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:59:38,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937706719] [2021-11-16 21:59:38,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937706719] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:59:38,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:59:38,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2021-11-16 21:59:38,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733815683] [2021-11-16 21:59:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:59:38,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:59:38,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:59:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:59:38,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:59:38,965 INFO L87 Difference]: Start difference. First operand 170 states and 213 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2021-11-16 21:59:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:59:39,309 INFO L93 Difference]: Finished difference Result 312 states and 395 transitions. [2021-11-16 21:59:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:59:39,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 146 [2021-11-16 21:59:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:59:39,317 INFO L225 Difference]: With dead ends: 312 [2021-11-16 21:59:39,317 INFO L226 Difference]: Without dead ends: 170 [2021-11-16 21:59:39,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:59:39,318 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 104 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:59:39,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 1200 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 21:59:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-16 21:59:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-11-16 21:59:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.1875) internal successors, (133), 114 states have internal predecessors, (133), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2021-11-16 21:59:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 212 transitions. [2021-11-16 21:59:39,325 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 212 transitions. Word has length 146 [2021-11-16 21:59:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:59:39,326 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 212 transitions. [2021-11-16 21:59:39,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2021-11-16 21:59:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 212 transitions. [2021-11-16 21:59:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-16 21:59:39,327 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:59:39,327 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:59:39,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-16 21:59:39,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:59:39,554 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:59:39,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:59:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1071073244, now seen corresponding path program 2 times [2021-11-16 21:59:39,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:59:39,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601271517] [2021-11-16 21:59:39,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:59:39,556 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:59:39,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:59:39,557 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:59:39,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-16 22:00:27,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 22:00:27,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 22:00:27,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 22:00:27,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:00:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-16 22:00:27,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:00:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-11-16 22:00:28,309 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:00:28,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601271517] [2021-11-16 22:00:28,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601271517] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:00:28,309 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:00:28,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-16 22:00:28,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465564721] [2021-11-16 22:00:28,309 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:00:28,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 22:00:28,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:00:28,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 22:00:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:00:28,310 INFO L87 Difference]: Start difference. First operand 170 states and 212 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 22:00:30,375 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:00:32,386 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:00:34,394 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:00:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:00:35,434 INFO L93 Difference]: Finished difference Result 315 states and 398 transitions. [2021-11-16 22:00:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 22:00:35,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2021-11-16 22:00:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:00:35,437 INFO L225 Difference]: With dead ends: 315 [2021-11-16 22:00:35,437 INFO L226 Difference]: Without dead ends: 189 [2021-11-16 22:00:35,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-16 22:00:35,438 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 27 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:00:35,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1086 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2021-11-16 22:00:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-16 22:00:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2021-11-16 22:00:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 116 states have internal predecessors, (135), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2021-11-16 22:00:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2021-11-16 22:00:35,455 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 161 [2021-11-16 22:00:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:00:35,455 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2021-11-16 22:00:35,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 22:00:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2021-11-16 22:00:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-16 22:00:35,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:00:35,463 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:00:35,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-16 22:00:35,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 22:00:35,688 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:00:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:00:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1111747994, now seen corresponding path program 1 times [2021-11-16 22:00:35,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:00:35,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458140238] [2021-11-16 22:00:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:00:35,690 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:00:35,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:00:35,691 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 22:00:35,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-16 22:00:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:00:36,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 22:00:36,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:00:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-16 22:00:36,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:00:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-11-16 22:00:37,367 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:00:37,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458140238] [2021-11-16 22:00:37,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458140238] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:00:37,367 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:00:37,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-16 22:00:37,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747608988] [2021-11-16 22:00:37,367 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:00:37,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 22:00:37,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:00:37,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 22:00:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 22:00:37,368 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 22:00:39,439 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:00:41,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:00:43,452 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:00:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:00:44,570 INFO L93 Difference]: Finished difference Result 318 states and 400 transitions. [2021-11-16 22:00:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 22:00:44,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2021-11-16 22:00:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:00:44,572 INFO L225 Difference]: With dead ends: 318 [2021-11-16 22:00:44,572 INFO L226 Difference]: Without dead ends: 190 [2021-11-16 22:00:44,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-16 22:00:44,575 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 42 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:00:44,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1106 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2021-11-16 22:00:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-16 22:00:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2021-11-16 22:00:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 118 states have internal predecessors, (137), 39 states have call successors, (39), 17 states have call predecessors, (39), 18 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2021-11-16 22:00:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2021-11-16 22:00:44,593 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 161 [2021-11-16 22:00:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:00:44,593 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2021-11-16 22:00:44,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 22:00:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2021-11-16 22:00:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-16 22:00:44,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:00:44,596 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:00:44,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-16 22:00:44,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 22:00:44,814 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:00:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:00:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1987767000, now seen corresponding path program 1 times [2021-11-16 22:00:44,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:00:44,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447663808] [2021-11-16 22:00:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:00:44,815 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:00:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:00:44,816 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 22:00:44,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-16 22:00:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:00:45,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-16 22:00:45,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:00:47,769 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-16 22:00:47,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 113 [2021-11-16 22:00:47,780 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-16 22:00:47,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 87 [2021-11-16 22:00:47,873 INFO L354 Elim1Store]: treesize reduction 44, result has 36.2 percent of original size [2021-11-16 22:00:47,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 57 [2021-11-16 22:00:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-16 22:00:48,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... Killed by 15