./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_remove_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 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_remove_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 1ebada516f0ccae5e55b91f6e0fe5802f70171054dc79c047f46877ad506c65e --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 13:37:37,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 13:37:37,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 13:37:37,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 13:37:37,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 13:37:37,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 13:37:37,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 13:37:37,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 13:37:37,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 13:37:37,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 13:37:37,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 13:37:37,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 13:37:37,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 13:37:37,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 13:37:37,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 13:37:37,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 13:37:37,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 13:37:37,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 13:37:37,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 13:37:37,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 13:37:37,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 13:37:37,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 13:37:37,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 13:37:37,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 13:37:37,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 13:37:37,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 13:37:37,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 13:37:37,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 13:37:37,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 13:37:37,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 13:37:37,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 13:37:37,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 13:37:37,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 13:37:37,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 13:37:37,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 13:37:37,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 13:37:37,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 13:37:37,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 13:37:37,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 13:37:37,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 13:37:37,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 13:37:37,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 13:37:37,401 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 13:37:37,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 13:37:37,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 13:37:37,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 13:37:37,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 13:37:37,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 13:37:37,406 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 13:37:37,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 13:37:37,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 13:37:37,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 13:37:37,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 13:37:37,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 13:37:37,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 13:37:37,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 13:37:37,409 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 13:37:37,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 13:37:37,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 13:37:37,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 13:37:37,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 13:37:37,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 13:37:37,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 13:37:37,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 13:37:37,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 13:37:37,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 13:37:37,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 13:37:37,423 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 13:37:37,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 13:37:37,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 13:37:37,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 13:37:37,424 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 -> 1ebada516f0ccae5e55b91f6e0fe5802f70171054dc79c047f46877ad506c65e [2021-11-05 13:37:37,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 13:37:37,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 13:37:37,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 13:37:37,832 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 13:37:37,834 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 13:37:37,836 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_remove_harness.i [2021-11-05 13:37:37,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e628fa6c2/8de60edb48544e159f91055b449cccd1/FLAGad91af79c [2021-11-05 13:37:38,709 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 13:37:38,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_remove_harness.i [2021-11-05 13:37:38,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e628fa6c2/8de60edb48544e159f91055b449cccd1/FLAGad91af79c [2021-11-05 13:37:38,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e628fa6c2/8de60edb48544e159f91055b449cccd1 [2021-11-05 13:37:38,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 13:37:38,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 13:37:38,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 13:37:38,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 13:37:38,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 13:37:38,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:37:38" (1/1) ... [2021-11-05 13:37:38,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd189ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:38, skipping insertion in model container [2021-11-05 13:37:38,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:37:38" (1/1) ... [2021-11-05 13:37:38,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 13:37:39,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 13:37:39,267 WARN L228 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_remove_harness.i[4499,4512] [2021-11-05 13:37:39,273 WARN L228 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_remove_harness.i[4559,4572] [2021-11-05 13:37:39,291 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 13:37:39,296 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 13:37:39,977 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:39,985 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:39,987 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:39,990 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:39,991 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,001 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,004 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,008 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,010 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,014 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,016 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,018 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,018 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,315 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 13:37:40,318 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 13:37:40,319 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 13:37:40,320 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 13:37:40,322 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 13:37:40,323 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 13:37:40,323 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 13:37:40,324 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 13:37:40,325 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 13:37:40,327 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 13:37:40,481 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 13:37:40,519 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,524 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,587 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,590 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,590 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,591 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,591 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,591 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,591 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,592 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,595 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,595 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,596 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,596 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,599 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,599 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,604 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,605 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,606 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,617 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,617 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,618 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 13:37:40,644 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 13:37:40,656 WARN L228 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_remove_harness.i[4499,4512] [2021-11-05 13:37:40,657 WARN L228 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_remove_harness.i[4559,4572] [2021-11-05 13:37:40,659 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 13:37:40,659 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 13:37:40,694 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,695 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,695 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,695 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,696 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,700 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,701 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,702 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,702 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,703 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,704 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,704 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,704 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,731 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 13:37:40,732 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 13:37:40,732 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 13:37:40,733 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 13:37:40,734 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 13:37:40,734 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 13:37:40,734 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 13:37:40,735 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 13:37:40,735 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 13:37:40,736 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 13:37:40,774 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 13:37:40,792 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,800 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,832 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,836 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,836 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,837 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,837 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,837 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,838 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,839 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,839 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,839 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,840 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,840 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,841 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,841 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,842 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,843 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,843 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,845 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,846 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,855 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,855 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,856 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,865 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,866 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,867 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:37:40,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 13:37:41,181 INFO L208 MainTranslator]: Completed translation [2021-11-05 13:37:41,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41 WrapperNode [2021-11-05 13:37:41,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 13:37:41,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 13:37:41,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 13:37:41,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 13:37:41,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:41,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:41,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 13:37:41,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 13:37:41,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 13:37:41,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 13:37:41,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:41,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:42,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:42,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:42,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:42,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:42,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:42,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 13:37:42,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 13:37:42,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 13:37:42,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 13:37:42,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (1/1) ... [2021-11-05 13:37:42,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 13:37:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:37:42,599 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-05 13:37:42,664 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-05 13:37:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 13:37:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-05 13:37:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 13:37:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 13:37:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 13:37:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 13:37:42,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 13:37:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 13:37:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 13:37:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-05 13:37:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 13:37:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 13:37:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 13:37:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 13:38:06,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 13:38:06,331 INFO L299 CfgBuilder]: Removed 2664 assume(true) statements. [2021-11-05 13:38:06,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:38:06 BoogieIcfgContainer [2021-11-05 13:38:06,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 13:38:06,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 13:38:06,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 13:38:06,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 13:38:06,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 01:37:38" (1/3) ... [2021-11-05 13:38:06,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35522d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:38:06, skipping insertion in model container [2021-11-05 13:38:06,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:37:41" (2/3) ... [2021-11-05 13:38:06,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35522d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:38:06, skipping insertion in model container [2021-11-05 13:38:06,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:38:06" (3/3) ... [2021-11-05 13:38:06,356 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_remove_harness.i [2021-11-05 13:38:06,361 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 13:38:06,362 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2021-11-05 13:38:06,437 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 13:38:06,450 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-05 13:38:06,452 INFO L340 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2021-11-05 13:38:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 3356 states, 3268 states have (on average 1.4225826193390454) internal successors, (4649), 3355 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-05 13:38:06,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:38:06,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:38:06,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:38:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:38:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash -429929114, now seen corresponding path program 1 times [2021-11-05 13:38:06,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:38:06,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237373482] [2021-11-05 13:38:06,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:06,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:38:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:38:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:07,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:38:07,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237373482] [2021-11-05 13:38:07,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237373482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:38:07,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:38:07,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 13:38:07,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336574583] [2021-11-05 13:38:07,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:38:07,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-05 13:38:07,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:38:07,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-05 13:38:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 13:38:07,374 INFO L87 Difference]: Start difference. First operand has 3356 states, 3268 states have (on average 1.4225826193390454) internal successors, (4649), 3355 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:38:07,538 INFO L93 Difference]: Finished difference Result 6706 states and 9291 transitions. [2021-11-05 13:38:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 13:38:07,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-05 13:38:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:38:07,574 INFO L225 Difference]: With dead ends: 6706 [2021-11-05 13:38:07,574 INFO L226 Difference]: Without dead ends: 3351 [2021-11-05 13:38:07,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 13:38:07,594 INFO L933 BasicCegarLoop]: 4335 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.09ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 13:38:07,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4335 Invalid, 0 Unknown, 0 Unchecked, 11.09ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 13:38:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2021-11-05 13:38:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3351. [2021-11-05 13:38:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.326593137254902) internal successors, (4330), 3350 states have internal predecessors, (4330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4330 transitions. [2021-11-05 13:38:07,768 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4330 transitions. Word has length 58 [2021-11-05 13:38:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:38:07,769 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4330 transitions. [2021-11-05 13:38:07,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4330 transitions. [2021-11-05 13:38:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-05 13:38:07,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:38:07,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:38:07,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 13:38:07,781 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:38:07,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:38:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1291635818, now seen corresponding path program 1 times [2021-11-05 13:38:07,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:38:07,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430395643] [2021-11-05 13:38:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:07,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:38:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:38:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:08,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:38:08,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430395643] [2021-11-05 13:38:08,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430395643] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:38:08,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:38:08,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 13:38:08,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492348824] [2021-11-05 13:38:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:38:08,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:38:08,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:38:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:38:08,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:38:08,193 INFO L87 Difference]: Start difference. First operand 3351 states and 4330 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:38:09,281 INFO L93 Difference]: Finished difference Result 6634 states and 8569 transitions. [2021-11-05 13:38:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 13:38:09,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-05 13:38:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:38:09,295 INFO L225 Difference]: With dead ends: 6634 [2021-11-05 13:38:09,296 INFO L226 Difference]: Without dead ends: 3363 [2021-11-05 13:38:09,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.27ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:38:09,305 INFO L933 BasicCegarLoop]: 4307 mSDtfsCounter, 4647 mSDsluCounter, 3943 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 856.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 8250 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.42ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 904.32ms IncrementalHoareTripleChecker+Time [2021-11-05 13:38:09,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4647 Valid, 8250 Invalid, 95 Unknown, 0 Unchecked, 22.42ms Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 904.32ms Time] [2021-11-05 13:38:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2021-11-05 13:38:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3351. [2021-11-05 13:38:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3256740196078431) internal successors, (4327), 3350 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4327 transitions. [2021-11-05 13:38:09,401 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4327 transitions. Word has length 62 [2021-11-05 13:38:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:38:09,402 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4327 transitions. [2021-11-05 13:38:09,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4327 transitions. [2021-11-05 13:38:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-05 13:38:09,404 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:38:09,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:38:09,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 13:38:09,405 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:38:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:38:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash 856591496, now seen corresponding path program 1 times [2021-11-05 13:38:09,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:38:09,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051992532] [2021-11-05 13:38:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:09,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:38:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:38:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:09,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:38:09,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051992532] [2021-11-05 13:38:09,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051992532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:38:09,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:38:09,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 13:38:09,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842405922] [2021-11-05 13:38:09,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:38:09,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:38:09,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:38:09,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:38:09,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:38:09,768 INFO L87 Difference]: Start difference. First operand 3351 states and 4327 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:11,830 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:38:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:38:16,609 INFO L93 Difference]: Finished difference Result 6728 states and 8680 transitions. [2021-11-05 13:38:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:38:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-05 13:38:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:38:16,624 INFO L225 Difference]: With dead ends: 6728 [2021-11-05 13:38:16,625 INFO L226 Difference]: Without dead ends: 3425 [2021-11-05 13:38:16,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 105.63ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:38:16,633 INFO L933 BasicCegarLoop]: 4286 mSDtfsCounter, 4904 mSDsluCounter, 7161 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5956.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 11447 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.79ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6490.18ms IncrementalHoareTripleChecker+Time [2021-11-05 13:38:16,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4904 Valid, 11447 Invalid, 1167 Unknown, 0 Unchecked, 44.79ms Time], IncrementalHoareTripleChecker [15 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 6490.18ms Time] [2021-11-05 13:38:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2021-11-05 13:38:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3351. [2021-11-05 13:38:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3247549019607843) internal successors, (4324), 3350 states have internal predecessors, (4324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4324 transitions. [2021-11-05 13:38:16,723 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4324 transitions. Word has length 70 [2021-11-05 13:38:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:38:16,723 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4324 transitions. [2021-11-05 13:38:16,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4324 transitions. [2021-11-05 13:38:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-05 13:38:16,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:38:16,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:38:16,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 13:38:16,727 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:38:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:38:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1192226880, now seen corresponding path program 1 times [2021-11-05 13:38:16,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:38:16,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589487767] [2021-11-05 13:38:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:16,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:38:16,859 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:38:16,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105740159] [2021-11-05 13:38:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:16,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:38:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:38:16,867 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-05 13:38:16,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-05 13:38:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:38:17,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 2742 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 13:38:17,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:38:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:18,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:38:18,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:38:18,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589487767] [2021-11-05 13:38:18,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:38:18,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105740159] [2021-11-05 13:38:18,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105740159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:38:18,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:38:18,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 13:38:18,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278049901] [2021-11-05 13:38:18,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:38:18,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:38:18,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:38:18,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:38:18,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:38:18,212 INFO L87 Difference]: Start difference. First operand 3351 states and 4324 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:38:21,853 INFO L93 Difference]: Finished difference Result 9215 states and 11825 transitions. [2021-11-05 13:38:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 13:38:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-05 13:38:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:38:21,879 INFO L225 Difference]: With dead ends: 9215 [2021-11-05 13:38:21,879 INFO L226 Difference]: Without dead ends: 5943 [2021-11-05 13:38:21,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 164.70ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-05 13:38:21,890 INFO L933 BasicCegarLoop]: 4132 mSDtfsCounter, 19052 mSDsluCounter, 7545 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2896.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19052 SdHoareTripleChecker+Valid, 11677 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 45.14ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3212.78ms IncrementalHoareTripleChecker+Time [2021-11-05 13:38:21,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19052 Valid, 11677 Invalid, 703 Unknown, 0 Unchecked, 45.14ms Time], IncrementalHoareTripleChecker [21 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 3212.78ms Time] [2021-11-05 13:38:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2021-11-05 13:38:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3351. [2021-11-05 13:38:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3238357843137254) internal successors, (4321), 3350 states have internal predecessors, (4321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4321 transitions. [2021-11-05 13:38:22,025 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4321 transitions. Word has length 86 [2021-11-05 13:38:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:38:22,025 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4321 transitions. [2021-11-05 13:38:22,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4321 transitions. [2021-11-05 13:38:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-05 13:38:22,027 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:38:22,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:38:22,064 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-05 13:38:22,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:38:22,244 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:38:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:38:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash -988948188, now seen corresponding path program 1 times [2021-11-05 13:38:22,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:38:22,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795660799] [2021-11-05 13:38:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:22,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:38:22,342 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:38:22,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053107866] [2021-11-05 13:38:22,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:22,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:38:22,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:38:22,344 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-05 13:38:22,346 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-05 13:38:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:38:23,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 2847 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 13:38:23,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:38:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:23,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:38:23,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:38:23,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795660799] [2021-11-05 13:38:23,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:38:23,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053107866] [2021-11-05 13:38:23,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053107866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:38:23,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:38:23,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:38:23,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173826912] [2021-11-05 13:38:23,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:38:23,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 13:38:23,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:38:23,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 13:38:23,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:38:23,794 INFO L87 Difference]: Start difference. First operand 3351 states and 4321 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:25,820 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:38:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:38:31,781 INFO L93 Difference]: Finished difference Result 9231 states and 11843 transitions. [2021-11-05 13:38:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 13:38:31,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-11-05 13:38:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:38:31,810 INFO L225 Difference]: With dead ends: 9231 [2021-11-05 13:38:31,811 INFO L226 Difference]: Without dead ends: 5943 [2021-11-05 13:38:31,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 305.74ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-05 13:38:31,821 INFO L933 BasicCegarLoop]: 4099 mSDtfsCounter, 19282 mSDsluCounter, 10582 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6756.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19282 SdHoareTripleChecker+Valid, 14681 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 52.33ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7402.43ms IncrementalHoareTripleChecker+Time [2021-11-05 13:38:31,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19282 Valid, 14681 Invalid, 1790 Unknown, 0 Unchecked, 52.33ms Time], IncrementalHoareTripleChecker [46 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 7402.43ms Time] [2021-11-05 13:38:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2021-11-05 13:38:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3351. [2021-11-05 13:38:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3229166666666667) internal successors, (4318), 3350 states have internal predecessors, (4318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4318 transitions. [2021-11-05 13:38:31,971 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4318 transitions. Word has length 110 [2021-11-05 13:38:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:38:31,971 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4318 transitions. [2021-11-05 13:38:31,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4318 transitions. [2021-11-05 13:38:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-05 13:38:31,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:38:31,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:38:32,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-05 13:38:32,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:38:32,192 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:38:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:38:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1108165524, now seen corresponding path program 1 times [2021-11-05 13:38:32,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:38:32,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704711577] [2021-11-05 13:38:32,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:32,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:38:32,293 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:38:32,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610961899] [2021-11-05 13:38:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:32,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:38:32,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:38:32,295 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-05 13:38:32,296 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-05 13:38:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:38:33,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 13:38:33,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:38:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:34,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:38:34,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:38:34,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704711577] [2021-11-05 13:38:34,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:38:34,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610961899] [2021-11-05 13:38:34,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610961899] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:38:34,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:38:34,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:38:34,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920782303] [2021-11-05 13:38:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:38:34,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 13:38:34,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:38:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 13:38:34,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:38:34,040 INFO L87 Difference]: Start difference. First operand 3351 states and 4318 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:38:41,268 INFO L93 Difference]: Finished difference Result 6578 states and 8478 transitions. [2021-11-05 13:38:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 13:38:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2021-11-05 13:38:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:38:41,282 INFO L225 Difference]: With dead ends: 6578 [2021-11-05 13:38:41,282 INFO L226 Difference]: Without dead ends: 3420 [2021-11-05 13:38:41,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 212.25ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-05 13:38:41,288 INFO L933 BasicCegarLoop]: 4136 mSDtfsCounter, 13256 mSDsluCounter, 7249 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6118.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13256 SdHoareTripleChecker+Valid, 11385 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.92ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6735.34ms IncrementalHoareTripleChecker+Time [2021-11-05 13:38:41,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13256 Valid, 11385 Invalid, 1503 Unknown, 0 Unchecked, 41.92ms Time], IncrementalHoareTripleChecker [6 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 6735.34ms Time] [2021-11-05 13:38:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2021-11-05 13:38:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3351. [2021-11-05 13:38:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3223039215686274) internal successors, (4316), 3350 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4316 transitions. [2021-11-05 13:38:41,392 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4316 transitions. Word has length 126 [2021-11-05 13:38:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:38:41,393 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4316 transitions. [2021-11-05 13:38:41,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4316 transitions. [2021-11-05 13:38:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-05 13:38:41,394 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:38:41,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:38:41,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-05 13:38:41,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:38:41,624 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:38:41,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:38:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash -766127820, now seen corresponding path program 1 times [2021-11-05 13:38:41,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:38:41,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224882464] [2021-11-05 13:38:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:41,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:38:41,740 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:38:41,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370579915] [2021-11-05 13:38:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:38:41,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:38:41,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:38:41,744 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-05 13:38:41,745 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-05 13:38:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:38:42,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 3227 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 13:38:42,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:38:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:43,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:38:43,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:38:43,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224882464] [2021-11-05 13:38:43,218 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:38:43,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370579915] [2021-11-05 13:38:43,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370579915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:38:43,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:38:43,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:38:43,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258971850] [2021-11-05 13:38:43,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:38:43,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:38:43,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:38:43,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:38:43,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:38:43,220 INFO L87 Difference]: Start difference. First operand 3351 states and 4316 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:45,276 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:38:47,391 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:38:49,589 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:39:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:39:13,606 INFO L93 Difference]: Finished difference Result 9435 states and 12117 transitions. [2021-11-05 13:39:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 13:39:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-11-05 13:39:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:39:13,628 INFO L225 Difference]: With dead ends: 9435 [2021-11-05 13:39:13,629 INFO L226 Difference]: Without dead ends: 6153 [2021-11-05 13:39:13,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 358.75ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:39:13,638 INFO L933 BasicCegarLoop]: 6691 mSDtfsCounter, 3413 mSDsluCounter, 21386 mSDsCounter, 0 mSdLazyCounter, 6358 mSolverCounterSat, 148 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26399.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3413 SdHoareTripleChecker+Valid, 28077 SdHoareTripleChecker+Invalid, 6509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 83.95ms SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 6358 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29629.19ms IncrementalHoareTripleChecker+Time [2021-11-05 13:39:13,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3413 Valid, 28077 Invalid, 6509 Unknown, 0 Unchecked, 83.95ms Time], IncrementalHoareTripleChecker [148 Valid, 6358 Invalid, 3 Unknown, 0 Unchecked, 29629.19ms Time] [2021-11-05 13:39:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2021-11-05 13:39:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 3427. [2021-11-05 13:39:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 3340 states have (on average 1.3206586826347306) internal successors, (4411), 3426 states have internal predecessors, (4411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4411 transitions. [2021-11-05 13:39:13,781 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4411 transitions. Word has length 142 [2021-11-05 13:39:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:39:13,782 INFO L470 AbstractCegarLoop]: Abstraction has 3427 states and 4411 transitions. [2021-11-05 13:39:13,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4411 transitions. [2021-11-05 13:39:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-05 13:39:13,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:39:13,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:39:13,818 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-05 13:39:13,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:13,996 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:39:13,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:39:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1479451634, now seen corresponding path program 1 times [2021-11-05 13:39:13,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:39:13,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439621107] [2021-11-05 13:39:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:13,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:39:14,113 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:39:14,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418210364] [2021-11-05 13:39:14,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:14,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:14,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:39:14,115 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-05 13:39:14,117 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-05 13:39:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:39:14,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 3224 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 13:39:14,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:39:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:15,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:39:15,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:39:15,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439621107] [2021-11-05 13:39:15,311 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:39:15,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418210364] [2021-11-05 13:39:15,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418210364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:39:15,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:39:15,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 13:39:15,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632177900] [2021-11-05 13:39:15,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:39:15,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:39:15,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:39:15,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:39:15,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:39:15,312 INFO L87 Difference]: Start difference. First operand 3427 states and 4411 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:39:16,324 INFO L93 Difference]: Finished difference Result 6855 states and 8823 transitions. [2021-11-05 13:39:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:39:16,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-11-05 13:39:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:39:16,333 INFO L225 Difference]: With dead ends: 6855 [2021-11-05 13:39:16,334 INFO L226 Difference]: Without dead ends: 3503 [2021-11-05 13:39:16,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:39:16,340 INFO L933 BasicCegarLoop]: 4274 mSDtfsCounter, 52 mSDsluCounter, 8423 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 710.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 12697 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.07ms SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 796.70ms IncrementalHoareTripleChecker+Time [2021-11-05 13:39:16,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 12697 Invalid, 326 Unknown, 0 Unchecked, 8.07ms Time], IncrementalHoareTripleChecker [73 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 796.70ms Time] [2021-11-05 13:39:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2021-11-05 13:39:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3465. [2021-11-05 13:39:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3378 states have (on average 1.3170515097690942) internal successors, (4449), 3464 states have internal predecessors, (4449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4449 transitions. [2021-11-05 13:39:16,468 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4449 transitions. Word has length 142 [2021-11-05 13:39:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:39:16,469 INFO L470 AbstractCegarLoop]: Abstraction has 3465 states and 4449 transitions. [2021-11-05 13:39:16,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4449 transitions. [2021-11-05 13:39:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-05 13:39:16,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:39:16,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:39:16,507 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-05 13:39:16,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:16,698 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:39:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:39:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1727598128, now seen corresponding path program 1 times [2021-11-05 13:39:16,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:39:16,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575449307] [2021-11-05 13:39:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:16,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:39:16,793 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:39:16,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374508457] [2021-11-05 13:39:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:16,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:16,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:39:16,795 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-05 13:39:16,818 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-05 13:39:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:39:17,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-05 13:39:17,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:39:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:18,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:39:18,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:39:18,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575449307] [2021-11-05 13:39:18,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:39:18,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374508457] [2021-11-05 13:39:18,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374508457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:39:18,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:39:18,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:39:18,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156693014] [2021-11-05 13:39:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:39:18,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:39:18,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:39:18,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:39:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:39:18,593 INFO L87 Difference]: Start difference. First operand 3465 states and 4449 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:39:19,887 INFO L93 Difference]: Finished difference Result 10093 states and 12968 transitions. [2021-11-05 13:39:19,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 13:39:19,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-11-05 13:39:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:39:19,902 INFO L225 Difference]: With dead ends: 10093 [2021-11-05 13:39:19,903 INFO L226 Difference]: Without dead ends: 6811 [2021-11-05 13:39:19,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 297.39ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:39:19,909 INFO L933 BasicCegarLoop]: 4308 mSDtfsCounter, 8306 mSDsluCounter, 17231 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 988.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8306 SdHoareTripleChecker+Valid, 21539 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.29ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1007.93ms IncrementalHoareTripleChecker+Time [2021-11-05 13:39:19,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8306 Valid, 21539 Invalid, 42 Unknown, 0 Unchecked, 16.29ms Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 1007.93ms Time] [2021-11-05 13:39:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2021-11-05 13:39:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 3526. [2021-11-05 13:39:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3439 states have (on average 1.3160802558883395) internal successors, (4526), 3525 states have internal predecessors, (4526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4526 transitions. [2021-11-05 13:39:20,062 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4526 transitions. Word has length 142 [2021-11-05 13:39:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:39:20,063 INFO L470 AbstractCegarLoop]: Abstraction has 3526 states and 4526 transitions. [2021-11-05 13:39:20,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4526 transitions. [2021-11-05 13:39:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-05 13:39:20,065 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:39:20,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:39:20,106 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-05 13:39:20,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:20,292 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:39:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:39:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash -516385170, now seen corresponding path program 1 times [2021-11-05 13:39:20,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:39:20,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726220640] [2021-11-05 13:39:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:20,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:39:20,389 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:39:20,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485160818] [2021-11-05 13:39:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:20,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:20,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:39:20,391 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-05 13:39:20,392 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-05 13:39:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:39:21,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 3216 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-05 13:39:21,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:39:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:21,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:39:21,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:39:21,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726220640] [2021-11-05 13:39:21,652 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:39:21,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485160818] [2021-11-05 13:39:21,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485160818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:39:21,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:39:21,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 13:39:21,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043402947] [2021-11-05 13:39:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:39:21,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:39:21,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:39:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:39:21,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:39:21,656 INFO L87 Difference]: Start difference. First operand 3526 states and 4526 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:39:23,884 INFO L93 Difference]: Finished difference Result 6808 states and 8745 transitions. [2021-11-05 13:39:23,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 13:39:23,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-11-05 13:39:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:39:23,893 INFO L225 Difference]: With dead ends: 6808 [2021-11-05 13:39:23,893 INFO L226 Difference]: Without dead ends: 3465 [2021-11-05 13:39:23,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:39:23,899 INFO L933 BasicCegarLoop]: 4315 mSDtfsCounter, 1 mSDsluCounter, 8260 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1885.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12575 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.64ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2058.34ms IncrementalHoareTripleChecker+Time [2021-11-05 13:39:23,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 12575 Invalid, 372 Unknown, 0 Unchecked, 10.64ms Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 2058.34ms Time] [2021-11-05 13:39:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2021-11-05 13:39:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3465. [2021-11-05 13:39:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3378 states have (on average 1.3167554766133807) internal successors, (4448), 3464 states have internal predecessors, (4448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4448 transitions. [2021-11-05 13:39:24,021 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4448 transitions. Word has length 142 [2021-11-05 13:39:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:39:24,022 INFO L470 AbstractCegarLoop]: Abstraction has 3465 states and 4448 transitions. [2021-11-05 13:39:24,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4448 transitions. [2021-11-05 13:39:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-05 13:39:24,023 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:39:24,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:39:24,072 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-05 13:39:24,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:24,240 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:39:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:39:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash -490032270, now seen corresponding path program 1 times [2021-11-05 13:39:24,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:39:24,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465614111] [2021-11-05 13:39:24,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:24,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:39:24,341 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:39:24,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431800517] [2021-11-05 13:39:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:24,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:24,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:39:24,343 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-05 13:39:24,359 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-05 13:39:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:39:25,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 3222 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-05 13:39:25,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:39:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:25,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:39:25,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:39:25,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465614111] [2021-11-05 13:39:25,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:39:25,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431800517] [2021-11-05 13:39:25,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431800517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:39:25,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:39:25,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:39:25,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559899273] [2021-11-05 13:39:25,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:39:25,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:39:25,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:39:25,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:39:25,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:39:25,863 INFO L87 Difference]: Start difference. First operand 3465 states and 4448 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:39:27,776 INFO L93 Difference]: Finished difference Result 10201 states and 13104 transitions. [2021-11-05 13:39:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 13:39:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-11-05 13:39:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:39:27,794 INFO L225 Difference]: With dead ends: 10201 [2021-11-05 13:39:27,794 INFO L226 Difference]: Without dead ends: 6819 [2021-11-05 13:39:27,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 243.92ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-05 13:39:27,803 INFO L933 BasicCegarLoop]: 4306 mSDtfsCounter, 4222 mSDsluCounter, 17203 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1474.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4222 SdHoareTripleChecker+Valid, 21509 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.21ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1508.59ms IncrementalHoareTripleChecker+Time [2021-11-05 13:39:27,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4222 Valid, 21509 Invalid, 76 Unknown, 0 Unchecked, 42.21ms Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 1508.59ms Time] [2021-11-05 13:39:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6819 states. [2021-11-05 13:39:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6819 to 3465. [2021-11-05 13:39:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3378 states have (on average 1.3164594434576673) internal successors, (4447), 3464 states have internal predecessors, (4447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4447 transitions. [2021-11-05 13:39:27,954 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4447 transitions. Word has length 142 [2021-11-05 13:39:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:39:27,955 INFO L470 AbstractCegarLoop]: Abstraction has 3465 states and 4447 transitions. [2021-11-05 13:39:27,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4447 transitions. [2021-11-05 13:39:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-05 13:39:27,956 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:39:27,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:39:27,999 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-05 13:39:28,179 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,SelfDestructingSolverStorable10 [2021-11-05 13:39:28,179 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:39:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:39:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 954910922, now seen corresponding path program 1 times [2021-11-05 13:39:28,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:39:28,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931697096] [2021-11-05 13:39:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:28,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:39:28,286 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:39:28,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370382106] [2021-11-05 13:39:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:28,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:28,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:39:28,288 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-05 13:39:28,307 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-05 13:39:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:39:29,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 3244 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-05 13:39:29,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:39:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:29,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:39:29,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:39:29,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931697096] [2021-11-05 13:39:29,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:39:29,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370382106] [2021-11-05 13:39:29,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370382106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:39:29,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:39:29,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 13:39:29,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889851905] [2021-11-05 13:39:29,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:39:29,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:39:29,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:39:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:39:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:39:29,587 INFO L87 Difference]: Start difference. First operand 3465 states and 4447 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:39:31,087 INFO L93 Difference]: Finished difference Result 9844 states and 12593 transitions. [2021-11-05 13:39:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:39:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2021-11-05 13:39:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:39:31,102 INFO L225 Difference]: With dead ends: 9844 [2021-11-05 13:39:31,102 INFO L226 Difference]: Without dead ends: 6463 [2021-11-05 13:39:31,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.42ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:39:31,110 INFO L933 BasicCegarLoop]: 7917 mSDtfsCounter, 3850 mSDsluCounter, 19620 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1126.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3850 SdHoareTripleChecker+Valid, 27537 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.87ms SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1254.64ms IncrementalHoareTripleChecker+Time [2021-11-05 13:39:31,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3850 Valid, 27537 Invalid, 536 Unknown, 0 Unchecked, 18.87ms Time], IncrementalHoareTripleChecker [91 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 1254.64ms Time] [2021-11-05 13:39:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6463 states. [2021-11-05 13:39:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6463 to 3617. [2021-11-05 13:39:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3530 states have (on average 1.3135977337110483) internal successors, (4637), 3616 states have internal predecessors, (4637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 4637 transitions. [2021-11-05 13:39:31,256 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 4637 transitions. Word has length 145 [2021-11-05 13:39:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:39:31,256 INFO L470 AbstractCegarLoop]: Abstraction has 3617 states and 4637 transitions. [2021-11-05 13:39:31,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 4637 transitions. [2021-11-05 13:39:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-05 13:39:31,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:39:31,258 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:39:31,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-05 13:39:31,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:31,478 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:39:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:39:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash 599198028, now seen corresponding path program 1 times [2021-11-05 13:39:31,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:39:31,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450153581] [2021-11-05 13:39:31,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:31,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:39:31,567 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:39:31,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077766867] [2021-11-05 13:39:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:31,568 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:31,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:39:31,569 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-05 13:39:31,590 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-05 13:39:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:39:32,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 3241 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-05 13:39:32,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:39:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:33,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:39:33,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:39:33,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450153581] [2021-11-05 13:39:33,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:39:33,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077766867] [2021-11-05 13:39:33,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077766867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:39:33,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:39:33,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-05 13:39:33,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947809494] [2021-11-05 13:39:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:39:33,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-05 13:39:33,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:39:33,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-05 13:39:33,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-05 13:39:33,448 INFO L87 Difference]: Start difference. First operand 3617 states and 4637 transitions. Second operand has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:39:45,058 INFO L93 Difference]: Finished difference Result 10774 states and 13800 transitions. [2021-11-05 13:39:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-05 13:39:45,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2021-11-05 13:39:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:39:45,074 INFO L225 Difference]: With dead ends: 10774 [2021-11-05 13:39:45,074 INFO L226 Difference]: Without dead ends: 7260 [2021-11-05 13:39:45,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1150.60ms TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2021-11-05 13:39:45,084 INFO L933 BasicCegarLoop]: 8514 mSDtfsCounter, 25210 mSDsluCounter, 50293 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9842.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25210 SdHoareTripleChecker+Valid, 58807 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 72.25ms SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10443.32ms IncrementalHoareTripleChecker+Time [2021-11-05 13:39:45,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25210 Valid, 58807 Invalid, 1513 Unknown, 0 Unchecked, 72.25ms Time], IncrementalHoareTripleChecker [162 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 10443.32ms Time] [2021-11-05 13:39:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2021-11-05 13:39:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 3617. [2021-11-05 13:39:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3530 states have (on average 1.313314447592068) internal successors, (4636), 3616 states have internal predecessors, (4636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 4636 transitions. [2021-11-05 13:39:45,251 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 4636 transitions. Word has length 145 [2021-11-05 13:39:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:39:45,251 INFO L470 AbstractCegarLoop]: Abstraction has 3617 states and 4636 transitions. [2021-11-05 13:39:45,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 4636 transitions. [2021-11-05 13:39:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-05 13:39:45,253 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:39:45,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:39:45,290 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-05 13:39:45,479 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,SelfDestructingSolverStorable12 [2021-11-05 13:39:45,480 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:39:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:39:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1654389018, now seen corresponding path program 1 times [2021-11-05 13:39:45,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:39:45,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348187986] [2021-11-05 13:39:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:45,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:39:45,566 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:39:45,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45180423] [2021-11-05 13:39:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:45,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:39:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:39:45,568 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-05 13:39:45,594 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-05 13:39:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:39:46,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 3263 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-05 13:39:46,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:39:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:48,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:39:48,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:39:48,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348187986] [2021-11-05 13:39:48,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:39:48,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45180423] [2021-11-05 13:39:48,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45180423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:39:48,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:39:48,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 13:39:48,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324191076] [2021-11-05 13:39:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:39:48,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 13:39:48,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:39:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 13:39:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-05 13:39:48,356 INFO L87 Difference]: Start difference. First operand 3617 states and 4636 transitions. Second operand has 13 states, 13 states have (on average 11.384615384615385) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:51,557 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:40:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:40:39,216 INFO L93 Difference]: Finished difference Result 24549 states and 31041 transitions. [2021-11-05 13:40:39,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-05 13:40:39,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.384615384615385) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-05 13:40:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:40:39,251 INFO L225 Difference]: With dead ends: 24549 [2021-11-05 13:40:39,251 INFO L226 Difference]: Without dead ends: 21024 [2021-11-05 13:40:39,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2521.00ms TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2021-11-05 13:40:39,265 INFO L933 BasicCegarLoop]: 10348 mSDtfsCounter, 33771 mSDsluCounter, 81777 mSDsCounter, 0 mSdLazyCounter, 13350 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42366.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33771 SdHoareTripleChecker+Valid, 92125 SdHoareTripleChecker+Invalid, 13800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 293.56ms SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 13350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46757.75ms IncrementalHoareTripleChecker+Time [2021-11-05 13:40:39,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33771 Valid, 92125 Invalid, 13800 Unknown, 0 Unchecked, 293.56ms Time], IncrementalHoareTripleChecker [450 Valid, 13350 Invalid, 0 Unknown, 0 Unchecked, 46757.75ms Time] [2021-11-05 13:40:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21024 states. [2021-11-05 13:40:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21024 to 3650. [2021-11-05 13:40:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3563 states have (on average 1.3137805220319956) internal successors, (4681), 3649 states have internal predecessors, (4681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:40:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 4681 transitions. [2021-11-05 13:40:39,537 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 4681 transitions. Word has length 148 [2021-11-05 13:40:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:40:39,538 INFO L470 AbstractCegarLoop]: Abstraction has 3650 states and 4681 transitions. [2021-11-05 13:40:39,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.384615384615385) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:40:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 4681 transitions. [2021-11-05 13:40:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-05 13:40:39,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:40:39,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:40:39,579 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-05 13:40:39,763 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,SelfDestructingSolverStorable13 [2021-11-05 13:40:39,764 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:40:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:40:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 450926750, now seen corresponding path program 1 times [2021-11-05 13:40:39,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:40:39,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907774244] [2021-11-05 13:40:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:40:39,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:40:39,851 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:40:39,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596067471] [2021-11-05 13:40:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:40:39,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:40:39,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:40:39,853 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-05 13:40:39,854 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-05 13:40:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:40:40,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 3253 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 13:40:40,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:40:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:40:40,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:40:40,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:40:40,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907774244] [2021-11-05 13:40:40,977 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:40:40,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596067471] [2021-11-05 13:40:40,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596067471] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:40:40,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:40:40,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 13:40:40,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414801001] [2021-11-05 13:40:40,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:40:40,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:40:40,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:40:40,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:40:40,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:40:40,979 INFO L87 Difference]: Start difference. First operand 3650 states and 4681 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:40:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:40:47,314 INFO L93 Difference]: Finished difference Result 7907 states and 10220 transitions. [2021-11-05 13:40:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:40:47,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-05 13:40:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:40:47,321 INFO L225 Difference]: With dead ends: 7907 [2021-11-05 13:40:47,321 INFO L226 Difference]: Without dead ends: 4304 [2021-11-05 13:40:47,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.13ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:40:47,327 INFO L933 BasicCegarLoop]: 4761 mSDtfsCounter, 972 mSDsluCounter, 6778 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5192.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 11539 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 29.26ms SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6002.48ms IncrementalHoareTripleChecker+Time [2021-11-05 13:40:47,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 11539 Invalid, 2489 Unknown, 0 Unchecked, 29.26ms Time], IncrementalHoareTripleChecker [525 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 6002.48ms Time] [2021-11-05 13:40:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states. [2021-11-05 13:40:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 3908. [2021-11-05 13:40:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3821 states have (on average 1.2918084271133212) internal successors, (4936), 3907 states have internal predecessors, (4936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:40:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 4936 transitions. [2021-11-05 13:40:47,646 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 4936 transitions. Word has length 148 [2021-11-05 13:40:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:40:47,647 INFO L470 AbstractCegarLoop]: Abstraction has 3908 states and 4936 transitions. [2021-11-05 13:40:47,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:40:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 4936 transitions. [2021-11-05 13:40:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-05 13:40:47,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:40:47,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:40:47,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-05 13:40:47,865 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,SelfDestructingSolverStorable14 [2021-11-05 13:40:47,866 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:40:47,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:40:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1733349894, now seen corresponding path program 1 times [2021-11-05 13:40:47,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:40:47,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790272236] [2021-11-05 13:40:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:40:47,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:40:47,967 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:40:47,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090976575] [2021-11-05 13:40:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:40:47,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:40:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:40:47,969 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-05 13:40:47,971 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-05 13:40:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:40:49,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 3273 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-05 13:40:49,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:40:50,853 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 32 treesize of output 24 [2021-11-05 13:40:50,860 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 21 treesize of output 13 [2021-11-05 13:40:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:40:51,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:40:51,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:40:51,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790272236] [2021-11-05 13:40:51,163 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:40:51,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090976575] [2021-11-05 13:40:51,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090976575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:40:51,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:40:51,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 13:40:51,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515334143] [2021-11-05 13:40:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:40:51,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 13:40:51,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:40:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 13:40:51,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-05 13:40:51,165 INFO L87 Difference]: Start difference. First operand 3908 states and 4936 transitions. Second operand has 13 states, 13 states have (on average 11.692307692307692) internal successors, (152), 13 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:40:53,206 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:40:55,346 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:40:57,492 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:40:59,627 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:41:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:41:55,083 INFO L93 Difference]: Finished difference Result 17165 states and 21629 transitions. [2021-11-05 13:41:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-05 13:41:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.692307692307692) internal successors, (152), 13 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-11-05 13:41:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:41:55,106 INFO L225 Difference]: With dead ends: 17165 [2021-11-05 13:41:55,106 INFO L226 Difference]: Without dead ends: 13398 [2021-11-05 13:41:55,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 3795.78ms TimeCoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2021-11-05 13:41:55,116 INFO L933 BasicCegarLoop]: 7838 mSDtfsCounter, 16537 mSDsluCounter, 57988 mSDsCounter, 0 mSdLazyCounter, 14637 mSolverCounterSat, 719 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53060.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16537 SdHoareTripleChecker+Valid, 65826 SdHoareTripleChecker+Invalid, 15360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 252.49ms SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 14637 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58874.92ms IncrementalHoareTripleChecker+Time [2021-11-05 13:41:55,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16537 Valid, 65826 Invalid, 15360 Unknown, 0 Unchecked, 252.49ms Time], IncrementalHoareTripleChecker [719 Valid, 14637 Invalid, 4 Unknown, 0 Unchecked, 58874.92ms Time] [2021-11-05 13:41:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13398 states. [2021-11-05 13:41:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13398 to 7113. [2021-11-05 13:41:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7026 states have (on average 1.2943353259322516) internal successors, (9094), 7112 states have internal predecessors, (9094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:41:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 9094 transitions. [2021-11-05 13:41:55,638 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 9094 transitions. Word has length 152 [2021-11-05 13:41:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:41:55,638 INFO L470 AbstractCegarLoop]: Abstraction has 7113 states and 9094 transitions. [2021-11-05 13:41:55,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.692307692307692) internal successors, (152), 13 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:41:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 9094 transitions. [2021-11-05 13:41:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-05 13:41:55,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:41:55,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:41:55,670 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-05 13:41:55,841 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,SelfDestructingSolverStorable15 [2021-11-05 13:41:55,841 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:41:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:41:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash -632685176, now seen corresponding path program 1 times [2021-11-05 13:41:55,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:41:55,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240317150] [2021-11-05 13:41:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:41:55,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:41:55,937 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:41:55,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737171163] [2021-11-05 13:41:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:41:55,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:41:55,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:41:55,939 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-05 13:41:55,942 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-05 13:41:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:41:56,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:41:56,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:41:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:41:57,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:41:57,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:41:57,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240317150] [2021-11-05 13:41:57,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:41:57,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737171163] [2021-11-05 13:41:57,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737171163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:41:57,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:41:57,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 13:41:57,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717510177] [2021-11-05 13:41:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:41:57,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:41:57,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:41:57,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:41:57,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:41:57,351 INFO L87 Difference]: Start difference. First operand 7113 states and 9094 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:41:59,394 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:01,539 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:03,512 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:04,918 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:42:27,570 INFO L93 Difference]: Finished difference Result 18158 states and 23071 transitions. [2021-11-05 13:42:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:42:27,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-11-05 13:42:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:42:27,584 INFO L225 Difference]: With dead ends: 18158 [2021-11-05 13:42:27,584 INFO L226 Difference]: Without dead ends: 11093 [2021-11-05 13:42:27,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 283.83ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:42:27,591 INFO L933 BasicCegarLoop]: 5783 mSDtfsCounter, 2655 mSDsluCounter, 11860 mSDsCounter, 0 mSdLazyCounter, 6167 mSolverCounterSat, 921 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24935.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2655 SdHoareTripleChecker+Valid, 17643 SdHoareTripleChecker+Invalid, 7090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 74.55ms SdHoareTripleChecker+Time, 921 IncrementalHoareTripleChecker+Valid, 6167 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29123.19ms IncrementalHoareTripleChecker+Time [2021-11-05 13:42:27,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2655 Valid, 17643 Invalid, 7090 Unknown, 0 Unchecked, 74.55ms Time], IncrementalHoareTripleChecker [921 Valid, 6167 Invalid, 2 Unknown, 0 Unchecked, 29123.19ms Time] [2021-11-05 13:42:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11093 states. [2021-11-05 13:42:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11093 to 7355. [2021-11-05 13:42:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7355 states, 7268 states have (on average 1.2842597688497523) internal successors, (9334), 7354 states have internal predecessors, (9334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:42:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 9334 transitions. [2021-11-05 13:42:27,917 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 9334 transitions. Word has length 152 [2021-11-05 13:42:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:42:27,918 INFO L470 AbstractCegarLoop]: Abstraction has 7355 states and 9334 transitions. [2021-11-05 13:42:27,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:42:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 9334 transitions. [2021-11-05 13:42:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-05 13:42:27,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:42:27,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:42:27,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-11-05 13:42:28,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:42:28,132 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:42:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:42:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash -161328826, now seen corresponding path program 1 times [2021-11-05 13:42:28,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:42:28,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923489547] [2021-11-05 13:42:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:42:28,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:42:28,212 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:42:28,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698568064] [2021-11-05 13:42:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:42:28,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:42:28,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:42:28,214 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-05 13:42:28,219 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-05 13:42:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:42:29,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 3273 conjuncts, 82 conjunts are in the unsatisfiable core [2021-11-05 13:42:29,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:42:31,855 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 32 treesize of output 24 [2021-11-05 13:42:31,863 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 21 treesize of output 13 [2021-11-05 13:42:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:42:32,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:42:32,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:42:32,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923489547] [2021-11-05 13:42:32,212 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:42:32,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698568064] [2021-11-05 13:42:32,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698568064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:42:32,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:42:32,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-05 13:42:32,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375159749] [2021-11-05 13:42:32,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:42:32,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-05 13:42:32,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:42:32,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-05 13:42:32,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-11-05 13:42:32,214 INFO L87 Difference]: Start difference. First operand 7355 states and 9334 transitions. Second operand has 19 states, 19 states have (on average 8.0) internal successors, (152), 19 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:42:34,255 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:46,613 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:48,857 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:43:35,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2021-11-05 13:43:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:43:37,727 INFO L93 Difference]: Finished difference Result 36966 states and 46673 transitions. [2021-11-05 13:43:37,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-05 13:43:37,728 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.0) internal successors, (152), 19 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-11-05 13:43:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:43:37,781 INFO L225 Difference]: With dead ends: 36966 [2021-11-05 13:43:37,781 INFO L226 Difference]: Without dead ends: 29805 [2021-11-05 13:43:37,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 4394.01ms TimeCoverageRelationStatistics Valid=483, Invalid=1409, Unknown=0, NotChecked=0, Total=1892 [2021-11-05 13:43:37,797 INFO L933 BasicCegarLoop]: 7542 mSDtfsCounter, 30759 mSDsluCounter, 78073 mSDsCounter, 0 mSdLazyCounter, 12929 mSolverCounterSat, 154 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53892.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30759 SdHoareTripleChecker+Valid, 85615 SdHoareTripleChecker+Invalid, 13085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 259.00ms SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 12929 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59576.90ms IncrementalHoareTripleChecker+Time [2021-11-05 13:43:37,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30759 Valid, 85615 Invalid, 13085 Unknown, 0 Unchecked, 259.00ms Time], IncrementalHoareTripleChecker [154 Valid, 12929 Invalid, 2 Unknown, 0 Unchecked, 59576.90ms Time] [2021-11-05 13:43:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29805 states. [2021-11-05 13:43:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29805 to 7355. [2021-11-05 13:43:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7355 states, 7268 states have (on average 1.2842597688497523) internal successors, (9334), 7354 states have internal predecessors, (9334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:43:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 9334 transitions. [2021-11-05 13:43:38,347 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 9334 transitions. Word has length 152 [2021-11-05 13:43:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:43:38,348 INFO L470 AbstractCegarLoop]: Abstraction has 7355 states and 9334 transitions. [2021-11-05 13:43:38,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.0) internal successors, (152), 19 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:43:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 9334 transitions. [2021-11-05 13:43:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-05 13:43:38,350 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:43:38,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:43:38,384 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-05 13:43:38,563 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,SelfDestructingSolverStorable17 [2021-11-05 13:43:38,564 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:43:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:43:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash 691806306, now seen corresponding path program 1 times [2021-11-05 13:43:38,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:43:38,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691142056] [2021-11-05 13:43:38,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:43:38,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:43:38,647 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:43:38,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548858267] [2021-11-05 13:43:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:43:38,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:43:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:43:38,649 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 13:43:38,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-05 13:43:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:43:39,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 3295 conjuncts, 135 conjunts are in the unsatisfiable core [2021-11-05 13:43:39,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:43:46,351 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-11-05 13:43:46,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 430 treesize of output 440 [2021-11-05 13:43:51,662 WARN L230 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 37 DAG size of output: 13 [2021-11-05 13:43:51,663 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-11-05 13:43:51,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 525 treesize of output 535 [2021-11-05 13:43:51,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:43:51,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691142056] [2021-11-05 13:43:51,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:43:51,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548858267] [2021-11-05 13:43:51,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-05 13:43:51,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:43:51,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-05 13:43:51,694 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-05 13:43:51,694 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-05 13:43:51,706 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (86 of 87 remaining) [2021-11-05 13:43:51,708 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (85 of 87 remaining) [2021-11-05 13:43:51,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (84 of 87 remaining) [2021-11-05 13:43:51,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (83 of 87 remaining) [2021-11-05 13:43:51,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (82 of 87 remaining) [2021-11-05 13:43:51,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (81 of 87 remaining) [2021-11-05 13:43:51,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (80 of 87 remaining) [2021-11-05 13:43:51,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (79 of 87 remaining) [2021-11-05 13:43:51,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (78 of 87 remaining) [2021-11-05 13:43:51,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (77 of 87 remaining) [2021-11-05 13:43:51,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (76 of 87 remaining) [2021-11-05 13:43:51,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (75 of 87 remaining) [2021-11-05 13:43:51,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (74 of 87 remaining) [2021-11-05 13:43:51,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (73 of 87 remaining) [2021-11-05 13:43:51,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (72 of 87 remaining) [2021-11-05 13:43:51,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (71 of 87 remaining) [2021-11-05 13:43:51,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (70 of 87 remaining) [2021-11-05 13:43:51,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (69 of 87 remaining) [2021-11-05 13:43:51,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (68 of 87 remaining) [2021-11-05 13:43:51,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (67 of 87 remaining) [2021-11-05 13:43:51,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (66 of 87 remaining) [2021-11-05 13:43:51,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (65 of 87 remaining) [2021-11-05 13:43:51,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (64 of 87 remaining) [2021-11-05 13:43:51,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (63 of 87 remaining) [2021-11-05 13:43:51,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (62 of 87 remaining) [2021-11-05 13:43:51,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (61 of 87 remaining) [2021-11-05 13:43:51,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (60 of 87 remaining) [2021-11-05 13:43:51,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (59 of 87 remaining) [2021-11-05 13:43:51,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (58 of 87 remaining) [2021-11-05 13:43:51,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (57 of 87 remaining) [2021-11-05 13:43:51,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (56 of 87 remaining) [2021-11-05 13:43:51,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (55 of 87 remaining) [2021-11-05 13:43:51,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (54 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (53 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (52 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (51 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (50 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (49 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (48 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (47 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (46 of 87 remaining) [2021-11-05 13:43:51,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (45 of 87 remaining) [2021-11-05 13:43:51,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (44 of 87 remaining) [2021-11-05 13:43:51,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (43 of 87 remaining) [2021-11-05 13:43:51,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (42 of 87 remaining) [2021-11-05 13:43:51,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (41 of 87 remaining) [2021-11-05 13:43:51,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (40 of 87 remaining) [2021-11-05 13:43:51,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (39 of 87 remaining) [2021-11-05 13:43:51,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (38 of 87 remaining) [2021-11-05 13:43:51,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (37 of 87 remaining) [2021-11-05 13:43:51,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (36 of 87 remaining) [2021-11-05 13:43:51,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (35 of 87 remaining) [2021-11-05 13:43:51,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (34 of 87 remaining) [2021-11-05 13:43:51,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (33 of 87 remaining) [2021-11-05 13:43:51,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION (32 of 87 remaining) [2021-11-05 13:43:51,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION (31 of 87 remaining) [2021-11-05 13:43:51,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION (30 of 87 remaining) [2021-11-05 13:43:51,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (29 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION (28 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION (27 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION (26 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION (25 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION (24 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION (23 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION (22 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION (21 of 87 remaining) [2021-11-05 13:43:51,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION (20 of 87 remaining) [2021-11-05 13:43:51,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (19 of 87 remaining) [2021-11-05 13:43:51,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION (18 of 87 remaining) [2021-11-05 13:43:51,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (17 of 87 remaining) [2021-11-05 13:43:51,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION (16 of 87 remaining) [2021-11-05 13:43:51,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION (15 of 87 remaining) [2021-11-05 13:43:51,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION (14 of 87 remaining) [2021-11-05 13:43:51,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION (13 of 87 remaining) [2021-11-05 13:43:51,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION (12 of 87 remaining) [2021-11-05 13:43:51,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION (11 of 87 remaining) [2021-11-05 13:43:51,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION (10 of 87 remaining) [2021-11-05 13:43:51,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION (9 of 87 remaining) [2021-11-05 13:43:51,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION (8 of 87 remaining) [2021-11-05 13:43:51,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION (7 of 87 remaining) [2021-11-05 13:43:51,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION (6 of 87 remaining) [2021-11-05 13:43:51,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION (5 of 87 remaining) [2021-11-05 13:43:51,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION (4 of 87 remaining) [2021-11-05 13:43:51,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION (3 of 87 remaining) [2021-11-05 13:43:51,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION (2 of 87 remaining) [2021-11-05 13:43:51,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION (1 of 87 remaining) [2021-11-05 13:43:51,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION (0 of 87 remaining) [2021-11-05 13:43:51,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-05 13:43:51,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:43:51,923 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:43:51,926 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-05 13:43:51,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 01:43:51 BoogieIcfgContainer [2021-11-05 13:43:51,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-05 13:43:51,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-05 13:43:51,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-05 13:43:51,982 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-05 13:43:51,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:38:06" (3/4) ... [2021-11-05 13:43:51,985 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-05 13:43:51,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-05 13:43:51,986 INFO L158 Benchmark]: Toolchain (without parser) took 373096.99ms. Allocated memory was 50.3MB in the beginning and 1.9GB in the end (delta: 1.9GB). Free memory was 29.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 658.4MB. Max. memory is 16.1GB. [2021-11-05 13:43:51,986 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 50.3MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 13:43:51,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2290.24ms. Allocated memory was 50.3MB in the beginning and 98.6MB in the end (delta: 48.2MB). Free memory was 29.0MB in the beginning and 39.9MB in the end (delta: -10.9MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2021-11-05 13:43:51,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 729.69ms. Allocated memory was 98.6MB in the beginning and 197.1MB in the end (delta: 98.6MB). Free memory was 39.9MB in the beginning and 116.8MB in the end (delta: -76.9MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2021-11-05 13:43:51,987 INFO L158 Benchmark]: Boogie Preprocessor took 651.20ms. Allocated memory was 197.1MB in the beginning and 528.5MB in the end (delta: 331.4MB). Free memory was 116.8MB in the beginning and 415.7MB in the end (delta: -298.9MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2021-11-05 13:43:51,987 INFO L158 Benchmark]: RCFGBuilder took 23774.17ms. Allocated memory was 528.5MB in the beginning and 1.9GB in the end (delta: 1.4GB). Free memory was 415.7MB in the beginning and 1.4GB in the end (delta: -999.6MB). Peak memory consumption was 725.3MB. Max. memory is 16.1GB. [2021-11-05 13:43:51,987 INFO L158 Benchmark]: TraceAbstraction took 345637.83ms. Allocated memory is still 1.9GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 157.9MB). Peak memory consumption was 158.9MB. Max. memory is 16.1GB. [2021-11-05 13:43:51,988 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 1.9GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 13:43:51,989 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.40ms. Allocated memory is still 50.3MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2290.24ms. Allocated memory was 50.3MB in the beginning and 98.6MB in the end (delta: 48.2MB). Free memory was 29.0MB in the beginning and 39.9MB in the end (delta: -10.9MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 729.69ms. Allocated memory was 98.6MB in the beginning and 197.1MB in the end (delta: 98.6MB). Free memory was 39.9MB in the beginning and 116.8MB in the end (delta: -76.9MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 651.20ms. Allocated memory was 197.1MB in the beginning and 528.5MB in the end (delta: 331.4MB). Free memory was 116.8MB in the beginning and 415.7MB in the end (delta: -298.9MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * RCFGBuilder took 23774.17ms. Allocated memory was 528.5MB in the beginning and 1.9GB in the end (delta: 1.4GB). Free memory was 415.7MB in the beginning and 1.4GB in the end (delta: -999.6MB). Peak memory consumption was 725.3MB. Max. memory is 16.1GB. * TraceAbstraction took 345637.83ms. Allocated memory is still 1.9GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 157.9MB). Peak memory consumption was 158.9MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 1.9GB. Free memory is still 1.3GB. 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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 7788. Possible FailurePath: [L6915-L6920] 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, }; [L7360] static __thread int tl_last_error = 0; [L7787-L7935] 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", } , }; [L7938-L7941] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7943-L7952] 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.") } , }; [L7954-L7957] 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])), }; [L7959-L7963] static _Bool s_common_library_initialized = 0 ; [L8450] struct aws_priority_queue queue; [L6735] EXPR list->item_size [L6734-L6735] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6738] EXPR list->length [L6737-L6738] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6739] return item_size_is_bounded && length_is_bounded; [L6789-L6791] _Bool container_is_bounded = aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size); [L6735] EXPR list->item_size [L6734-L6735] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6738] EXPR list->length [L6737-L6738] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6739] return item_size_is_bounded && length_is_bounded; [L6797-L6799] _Bool backpointers_list_is_bounded = aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)); [L6800] return container_is_bounded && backpointers_list_is_bounded; [L211] COND FALSE !(!cond) [L6743] EXPR list->current_size [L6743] list->current_size == 0 && list->length == 0 [L6743] EXPR list->length [L6743] list->current_size == 0 && list->length == 0 [L6743] COND TRUE list->current_size == 0 && list->length == 0 [L6744] list->data [L211] COND FALSE !(!cond) [L6939] return &s_can_fail_allocator_static; [L6747] list->alloc = can_fail_allocator() [L6743] EXPR list->current_size [L6743] list->current_size == 0 && list->length == 0 [L6743] EXPR list->length [L6743] list->current_size == 0 && list->length == 0 [L6743] COND TRUE list->current_size == 0 && list->length == 0 [L6744] list->data [L211] COND FALSE !(!cond) [L6939] return &s_can_fail_allocator_static; [L6747] list->alloc = can_fail_allocator() [L6806] queue->pred = nondet_compare [L8279] COND FALSE !(!queue) [L8286] EXPR queue->pred [L8285-L8288] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8290-L8291] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L8220] COND FALSE !(!queue) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230] EXPR queue->backpointers.current_size [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8228-L8233] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L8241] EXPR queue->backpointers.item_size [L8240-L8241] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L8244] EXPR queue->backpointers.length [L8244] EXPR queue->container.length [L8243-L8244] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L8247] EXPR queue->backpointers.current_size [L8246-L8247] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L8255-L8258] _Bool backpointers_valid_deep = 1 ; [L8263] EXPR queue->backpointers.current_size [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263] EXPR queue->backpointers.length [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8263] EXPR queue->backpointers.data [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8261-L8265] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L8267-L8270] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L8272] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L2335] size_t i; [L2336] const uint8_t *buf_u8 = (const uint8_t *)buf; [L2337] i = 0 [L2337] COND FALSE !(i < bufsize) [L2345-L2347] return 1 ; [L8272] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L8272] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L8294-L8295] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L8296] return pred_is_valid && container_is_valid && backpointers_valid; [L211] COND FALSE !(!cond) [L8458] EXPR queue.container.item_size [L261] return __VERIFIER_nondet_bool(); [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L211] COND FALSE !(!cond) [L6935] return malloc(size); [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L6949-L6951] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8458] void *item = can_fail_malloc(queue.container.item_size); [L261] return __VERIFIER_nondet_bool(); [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L211] COND FALSE !(!cond) [L6935] return malloc(size); [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L6949-L6951] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8459] struct aws_priority_queue_node *backpointer = can_fail_malloc(sizeof(struct aws_priority_queue_node)); [L8461] EXPR queue.backpointers.data [L8461] COND FALSE !(queue.backpointers.data && backpointer) [L8478] struct aws_priority_queue old_queue = queue; [L8481] item && ((((queue.container.item_size)) == 0) || ((item))) [L8481] EXPR queue.container.item_size [L8481] item && ((((queue.container.item_size)) == 0) || ((item))) [L211] COND FALSE !(!cond) [L211] COND FALSE !(!cond) [L8279] COND FALSE !(!queue) [L8286] EXPR queue->pred [L8285-L8288] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8290-L8291] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L8220] COND FALSE !(!queue) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2957] EXPR list->current_size [L2957] EXPR (((list->current_size)) == 0) || ((list->data)) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230] EXPR queue->backpointers.current_size [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8231] EXPR queue->backpointers.data [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8228-L8233] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L8241] EXPR queue->backpointers.item_size [L8240-L8241] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L8244] EXPR queue->backpointers.length [L8244] EXPR queue->container.length [L8243-L8244] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L8247] EXPR queue->backpointers.current_size [L8246-L8247] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L8255-L8258] _Bool backpointers_valid_deep = 1 ; [L8263] EXPR queue->backpointers.current_size [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8261-L8265] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L8267-L8270] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L8272] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L8272] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L8294-L8295] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L8296] return pred_is_valid && container_is_valid && backpointers_valid; [L211] COND FALSE !(!cond) [L8415] item && ((((queue->container.item_size)) == 0) || ((item))) [L8415] EXPR queue->container.item_size [L8415] item && ((((queue->container.item_size)) == 0) || ((item))) [L211] COND FALSE !(!cond) [L211] COND FALSE !(!cond) [L8417] node->current_index [L3169] EXPR list->length [L3169] !list->length || list->data [L3169] EXPR list->data [L3169] !list->length || list->data [L211] COND FALSE !(!cond) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L3171] EXPR list->length [L3171] size_t len = list->length; [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L223] COND TRUE !cond [L223] reach_error() - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 233]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3356 locations, 87 error locations. Started 1 CEGAR loops. OverallTime: 345489.42ms, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 61.11ms, AutomataDifference: 294392.71ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 66.57ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 190889 SdHoareTripleChecker+Valid, 271778.98ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190889 mSDsluCounter, 517264 SdHoareTripleChecker+Invalid, 244458.90ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 415372 mSDsCounter, 3354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63091 IncrementalHoareTripleChecker+Invalid, 66456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3354 mSolverCounterUnsat, 101892 mSDtfsCounter, 63091 mSolverCounterSat, 1378.82ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2202 GetRequests, 1981 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 14075.38ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7355occurred in iteration=17, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 3708.72ms AutomataMinimizationTime, 18 MinimizatonAttempts, 71474 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2484.81ms SsaConstructionTime, 10985.24ms SatisfiabilityAnalysisTime, 26906.74ms InterpolantComputationTime, 2417 NumberOfCodeBlocks, 2417 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2246 ConstructedInterpolants, 0 QuantifiedInterpolants, 5862 SizeOfPredicates, 148 NumberOfNonLiveVariables, 50844 ConjunctsInSsa, 514 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 [2021-11-05 13:43:52,222 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-05 13:43:52,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 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_remove_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 1ebada516f0ccae5e55b91f6e0fe5802f70171054dc79c047f46877ad506c65e --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 13:43:54,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 13:43:54,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 13:43:54,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 13:43:54,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 13:43:54,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 13:43:54,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 13:43:54,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 13:43:54,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 13:43:54,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 13:43:54,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 13:43:54,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 13:43:54,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 13:43:54,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 13:43:54,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 13:43:54,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 13:43:54,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 13:43:54,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 13:43:54,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 13:43:54,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 13:43:54,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 13:43:54,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 13:43:54,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 13:43:54,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 13:43:54,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 13:43:54,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 13:43:54,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 13:43:54,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 13:43:54,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 13:43:54,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 13:43:54,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 13:43:54,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 13:43:54,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 13:43:54,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 13:43:54,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 13:43:54,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 13:43:54,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 13:43:54,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 13:43:54,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 13:43:54,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 13:43:54,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 13:43:54,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-05 13:43:54,384 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 13:43:54,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 13:43:54,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 13:43:54,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 13:43:54,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 13:43:54,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 13:43:54,387 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 13:43:54,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 13:43:54,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 13:43:54,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 13:43:54,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 13:43:54,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 13:43:54,388 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-05 13:43:54,388 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-05 13:43:54,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 13:43:54,389 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 13:43:54,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 13:43:54,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 13:43:54,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 13:43:54,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 13:43:54,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 13:43:54,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 13:43:54,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 13:43:54,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 13:43:54,391 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-05 13:43:54,391 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-05 13:43:54,391 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 13:43:54,391 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 13:43:54,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 13:43:54,392 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 13:43:54,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-05 13:43:54,392 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 -> 1ebada516f0ccae5e55b91f6e0fe5802f70171054dc79c047f46877ad506c65e [2021-11-05 13:43:54,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 13:43:54,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 13:43:54,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 13:43:54,739 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 13:43:54,740 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 13:43:54,742 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_remove_harness.i [2021-11-05 13:43:54,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af725f49b/1382f8851d2643eba6345b8e690f394a/FLAG7096cc37a [2021-11-05 13:43:55,695 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 13:43:55,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_remove_harness.i [2021-11-05 13:43:55,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af725f49b/1382f8851d2643eba6345b8e690f394a/FLAG7096cc37a [2021-11-05 13:43:55,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af725f49b/1382f8851d2643eba6345b8e690f394a [2021-11-05 13:43:55,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 13:43:55,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 13:43:55,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 13:43:55,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 13:43:55,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 13:43:55,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:43:55" (1/1) ... [2021-11-05 13:43:55,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b84f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:55, skipping insertion in model container [2021-11-05 13:43:55,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:43:55" (1/1) ... [2021-11-05 13:43:55,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 13:43:55,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 13:43:56,224 WARN L228 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_remove_harness.i[4499,4512] [2021-11-05 13:43:56,232 WARN L228 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_remove_harness.i[4559,4572] [2021-11-05 13:43:56,260 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 13:43:56,267 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 13:43:57,255 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,256 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,256 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,257 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,258 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,274 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,275 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,277 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,278 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,280 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,281 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,282 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,282 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,686 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 13:43:57,690 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 13:43:57,693 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 13:43:57,695 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 13:43:57,697 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 13:43:57,698 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 13:43:57,700 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 13:43:57,710 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 13:43:57,712 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 13:43:57,716 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 13:43:57,862 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 13:43:57,891 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,897 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,967 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,971 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,972 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,973 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,975 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,976 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,976 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,976 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,977 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,977 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,977 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,981 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,982 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,982 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,983 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,986 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:57,987 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,013 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,028 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,028 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,029 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 13:43:58,079 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 13:43:58,104 WARN L228 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_remove_harness.i[4499,4512] [2021-11-05 13:43:58,107 WARN L228 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_remove_harness.i[4559,4572] [2021-11-05 13:43:58,110 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 13:43:58,112 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 13:43:58,164 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,174 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,175 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,175 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,176 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,190 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,191 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,192 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,193 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,193 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,194 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,194 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,194 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,266 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 13:43:58,267 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 13:43:58,269 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 13:43:58,270 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 13:43:58,271 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 13:43:58,271 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 13:43:58,273 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 13:43:58,273 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 13:43:58,274 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 13:43:58,274 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 13:43:58,307 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 13:43:58,327 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,333 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,371 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,372 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,372 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,372 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,373 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,374 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,374 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,376 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,376 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,377 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,377 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,377 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,378 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,379 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,379 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,379 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,380 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,383 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,384 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,396 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,397 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,397 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,405 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,406 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,408 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:43:58,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 13:43:58,667 INFO L208 MainTranslator]: Completed translation [2021-11-05 13:43:58,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58 WrapperNode [2021-11-05 13:43:58,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 13:43:58,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 13:43:58,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 13:43:58,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 13:43:58,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:43:58,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:43:59,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 13:43:59,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 13:43:59,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 13:43:59,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 13:43:59,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:43:59,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:43:59,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:43:59,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:43:59,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:43:59,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:44:00,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:44:00,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 13:44:00,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 13:44:00,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 13:44:00,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 13:44:00,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (1/1) ... [2021-11-05 13:44:00,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 13:44:00,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:44:00,209 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-05 13:44:00,279 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-05 13:44:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 13:44:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-05 13:44:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-05 13:44:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-05 13:44:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 13:44:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 13:44:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 13:44:00,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 13:44:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-05 13:44:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-05 13:44:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 13:44:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 13:44:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-05 13:44:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 13:44:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-05 13:44:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 13:44:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-05 13:44:49,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 13:44:49,521 INFO L299 CfgBuilder]: Removed 2664 assume(true) statements. [2021-11-05 13:44:49,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:44:49 BoogieIcfgContainer [2021-11-05 13:44:49,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 13:44:49,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 13:44:49,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 13:44:49,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 13:44:49,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 01:43:55" (1/3) ... [2021-11-05 13:44:49,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e64572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:44:49, skipping insertion in model container [2021-11-05 13:44:49,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:43:58" (2/3) ... [2021-11-05 13:44:49,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e64572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:44:49, skipping insertion in model container [2021-11-05 13:44:49,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:44:49" (3/3) ... [2021-11-05 13:44:49,536 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_remove_harness.i [2021-11-05 13:44:49,542 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 13:44:49,542 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2021-11-05 13:44:49,601 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 13:44:49,608 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-05 13:44:49,608 INFO L340 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2021-11-05 13:44:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 3356 states, 3268 states have (on average 1.4225826193390454) internal successors, (4649), 3355 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-05 13:44:49,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:44:49,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:44:49,686 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:44:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:44:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -429929114, now seen corresponding path program 1 times [2021-11-05 13:44:49,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:44:49,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988659649] [2021-11-05 13:44:49,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:44:49,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:44:49,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:44:49,715 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-05 13:44:49,729 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-05 13:44:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:44:52,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-05 13:44:52,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:44:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:44:52,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:44:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:44:52,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:44:52,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988659649] [2021-11-05 13:44:52,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988659649] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:44:52,490 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:44:52,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-05 13:44:52,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276385931] [2021-11-05 13:44:52,493 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:44:52,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-05 13:44:52,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:44:52,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-05 13:44:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 13:44:52,531 INFO L87 Difference]: Start difference. First operand has 3356 states, 3268 states have (on average 1.4225826193390454) internal successors, (4649), 3355 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:44:52,676 INFO L93 Difference]: Finished difference Result 6706 states and 9291 transitions. [2021-11-05 13:44:52,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 13:44:52,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-05 13:44:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:44:52,703 INFO L225 Difference]: With dead ends: 6706 [2021-11-05 13:44:52,704 INFO L226 Difference]: Without dead ends: 3351 [2021-11-05 13:44:52,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.41ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 13:44:52,717 INFO L933 BasicCegarLoop]: 4335 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.27ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 13:44:52,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4335 Invalid, 0 Unknown, 0 Unchecked, 13.27ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 13:44:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2021-11-05 13:44:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3351. [2021-11-05 13:44:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.326593137254902) internal successors, (4330), 3350 states have internal predecessors, (4330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4330 transitions. [2021-11-05 13:44:52,844 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4330 transitions. Word has length 58 [2021-11-05 13:44:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:44:52,844 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4330 transitions. [2021-11-05 13:44:52,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4330 transitions. [2021-11-05 13:44:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-05 13:44:52,847 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:44:52,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:44:52,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-05 13:44:53,048 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-05 13:44:53,048 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:44:53,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:44:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1291635818, now seen corresponding path program 1 times [2021-11-05 13:44:53,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:44:53,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94813545] [2021-11-05 13:44:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:44:53,053 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:44:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:44:53,055 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-05 13:44:53,057 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-05 13:44:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:44:55,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 13:44:55,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:44:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:44:55,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:44:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:44:56,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:44:56,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94813545] [2021-11-05 13:44:56,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94813545] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:44:56,148 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:44:56,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-05 13:44:56,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235038500] [2021-11-05 13:44:56,149 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:44:56,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:44:56,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:44:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:44:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:44:56,150 INFO L87 Difference]: Start difference. First operand 3351 states and 4330 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:58,279 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:44:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:44:58,944 INFO L93 Difference]: Finished difference Result 6622 states and 8555 transitions. [2021-11-05 13:44:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 13:44:58,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-05 13:44:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:44:58,958 INFO L225 Difference]: With dead ends: 6622 [2021-11-05 13:44:58,959 INFO L226 Difference]: Without dead ends: 3351 [2021-11-05 13:44:58,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:44:58,970 INFO L933 BasicCegarLoop]: 4319 mSDtfsCounter, 231 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2536.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 12646 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.35ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2635.64ms IncrementalHoareTripleChecker+Time [2021-11-05 13:44:58,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 12646 Invalid, 89 Unknown, 0 Unchecked, 19.35ms Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 2635.64ms Time] [2021-11-05 13:44:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2021-11-05 13:44:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3351. [2021-11-05 13:44:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3262867647058822) internal successors, (4329), 3350 states have internal predecessors, (4329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4329 transitions. [2021-11-05 13:44:59,055 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4329 transitions. Word has length 62 [2021-11-05 13:44:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:44:59,056 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4329 transitions. [2021-11-05 13:44:59,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4329 transitions. [2021-11-05 13:44:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-05 13:44:59,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:44:59,068 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:44:59,132 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-05 13:44:59,283 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-05 13:44:59,284 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:44:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:44:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1901522265, now seen corresponding path program 1 times [2021-11-05 13:44:59,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:44:59,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771907472] [2021-11-05 13:44:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:44:59,287 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:44:59,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:44:59,288 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-05 13:44:59,290 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-05 13:45:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:01,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-05 13:45:01,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:02,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:02,758 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:02,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771907472] [2021-11-05 13:45:02,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771907472] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:02,758 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:02,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 13:45:02,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003898779] [2021-11-05 13:45:02,758 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:02,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:45:02,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:45:02,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:45:02,760 INFO L87 Difference]: Start difference. First operand 3351 states and 4329 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:05,106 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:45:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:45:14,442 INFO L93 Difference]: Finished difference Result 6690 states and 8642 transitions. [2021-11-05 13:45:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:45:14,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-05 13:45:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:45:14,458 INFO L225 Difference]: With dead ends: 6690 [2021-11-05 13:45:14,458 INFO L226 Difference]: Without dead ends: 3387 [2021-11-05 13:45:14,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 154.92ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:45:14,466 INFO L933 BasicCegarLoop]: 4312 mSDtfsCounter, 374 mSDsluCounter, 11579 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10039.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 15891 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.16ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11385.61ms IncrementalHoareTripleChecker+Time [2021-11-05 13:45:14,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 15891 Invalid, 1150 Unknown, 0 Unchecked, 31.16ms Time], IncrementalHoareTripleChecker [0 Valid, 1149 Invalid, 1 Unknown, 0 Unchecked, 11385.61ms Time] [2021-11-05 13:45:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2021-11-05 13:45:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3351. [2021-11-05 13:45:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3259803921568627) internal successors, (4328), 3350 states have internal predecessors, (4328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4328 transitions. [2021-11-05 13:45:14,577 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4328 transitions. Word has length 66 [2021-11-05 13:45:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:45:14,578 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4328 transitions. [2021-11-05 13:45:14,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4328 transitions. [2021-11-05 13:45:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-05 13:45:14,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:45:14,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:45:14,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-05 13:45:14,807 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-05 13:45:14,807 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:45:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:45:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash 68046965, now seen corresponding path program 1 times [2021-11-05 13:45:14,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:45:14,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859630532] [2021-11-05 13:45:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:45:14,812 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:45:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:45:14,813 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-05 13:45:14,814 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-05 13:45:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:17,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-05 13:45:17,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:18,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:18,541 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:18,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859630532] [2021-11-05 13:45:18,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859630532] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:18,542 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:18,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 13:45:18,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910038040] [2021-11-05 13:45:18,542 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:18,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:45:18,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:18,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:45:18,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:45:18,543 INFO L87 Difference]: Start difference. First operand 3351 states and 4328 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:20,770 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:45:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:45:22,328 INFO L93 Difference]: Finished difference Result 6623 states and 8554 transitions. [2021-11-05 13:45:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:45:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-05 13:45:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:45:22,349 INFO L225 Difference]: With dead ends: 6623 [2021-11-05 13:45:22,349 INFO L226 Difference]: Without dead ends: 3351 [2021-11-05 13:45:22,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 156.40ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:45:22,358 INFO L933 BasicCegarLoop]: 4310 mSDtfsCounter, 301 mSDsluCounter, 12403 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3400.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 16713 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.24ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3613.43ms IncrementalHoareTripleChecker+Time [2021-11-05 13:45:22,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 16713 Invalid, 261 Unknown, 0 Unchecked, 15.24ms Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 1 Unknown, 0 Unchecked, 3613.43ms Time] [2021-11-05 13:45:22,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2021-11-05 13:45:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3351. [2021-11-05 13:45:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3256740196078431) internal successors, (4327), 3350 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4327 transitions. [2021-11-05 13:45:22,445 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4327 transitions. Word has length 74 [2021-11-05 13:45:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:45:22,445 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4327 transitions. [2021-11-05 13:45:22,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4327 transitions. [2021-11-05 13:45:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-05 13:45:22,446 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:45:22,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:45:22,498 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-05 13:45:22,647 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-05 13:45:22,647 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:45:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:45:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash -726192986, now seen corresponding path program 1 times [2021-11-05 13:45:22,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:45:22,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572095953] [2021-11-05 13:45:22,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:45:22,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:45:22,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:45:22,652 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-05 13:45:22,652 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-05 13:45:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:25,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 1573 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:45:25,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:25,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:26,658 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:26,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572095953] [2021-11-05 13:45:26,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572095953] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:26,659 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:26,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-05 13:45:26,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220245067] [2021-11-05 13:45:26,659 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:26,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 13:45:26,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:26,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 13:45:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-05 13:45:26,661 INFO L87 Difference]: Start difference. First operand 3351 states and 4327 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:29,217 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:46:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:46:07,925 INFO L93 Difference]: Finished difference Result 14060 states and 17897 transitions. [2021-11-05 13:46:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-05 13:46:07,927 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-05 13:46:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:46:07,967 INFO L225 Difference]: With dead ends: 14060 [2021-11-05 13:46:07,967 INFO L226 Difference]: Without dead ends: 10772 [2021-11-05 13:46:07,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 566.36ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-11-05 13:46:07,980 INFO L933 BasicCegarLoop]: 10594 mSDtfsCounter, 13396 mSDsluCounter, 34711 mSDsCounter, 0 mSdLazyCounter, 5674 mSolverCounterSat, 79 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35820.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13396 SdHoareTripleChecker+Valid, 45305 SdHoareTripleChecker+Invalid, 5754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 134.88ms SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 5674 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40170.26ms IncrementalHoareTripleChecker+Time [2021-11-05 13:46:07,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13396 Valid, 45305 Invalid, 5754 Unknown, 0 Unchecked, 134.88ms Time], IncrementalHoareTripleChecker [79 Valid, 5674 Invalid, 1 Unknown, 0 Unchecked, 40170.26ms Time] [2021-11-05 13:46:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10772 states. [2021-11-05 13:46:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10772 to 3351. [2021-11-05 13:46:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3264 states have (on average 1.3253676470588236) internal successors, (4326), 3350 states have internal predecessors, (4326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4326 transitions. [2021-11-05 13:46:08,132 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4326 transitions. Word has length 86 [2021-11-05 13:46:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:46:08,133 INFO L470 AbstractCegarLoop]: Abstraction has 3351 states and 4326 transitions. [2021-11-05 13:46:08,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4326 transitions. [2021-11-05 13:46:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-05 13:46:08,137 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:46:08,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:46:08,204 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-05 13:46:08,351 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-05 13:46:08,352 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:46:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:46:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2145888010, now seen corresponding path program 1 times [2021-11-05 13:46:08,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:46:08,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487730007] [2021-11-05 13:46:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:46:08,356 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:46:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:46:08,359 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-05 13:46:08,361 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-05 13:46:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:46:11,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 13:46:11,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:46:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:46:11,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:46:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:46:11,842 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:46:11,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487730007] [2021-11-05 13:46:11,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487730007] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:46:11,842 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:46:11,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 13:46:11,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400415752] [2021-11-05 13:46:11,842 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:46:11,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:46:11,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:46:11,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:46:11,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:46:11,843 INFO L87 Difference]: Start difference. First operand 3351 states and 4326 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:46:14,380 INFO L93 Difference]: Finished difference Result 9584 states and 12328 transitions. [2021-11-05 13:46:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:46:14,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-05 13:46:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:46:14,403 INFO L225 Difference]: With dead ends: 9584 [2021-11-05 13:46:14,404 INFO L226 Difference]: Without dead ends: 6311 [2021-11-05 13:46:14,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 97.30ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:46:14,413 INFO L933 BasicCegarLoop]: 7965 mSDtfsCounter, 3858 mSDsluCounter, 19728 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2143.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3858 SdHoareTripleChecker+Valid, 27693 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.24ms SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2336.04ms IncrementalHoareTripleChecker+Time [2021-11-05 13:46:14,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3858 Valid, 27693 Invalid, 536 Unknown, 0 Unchecked, 25.24ms Time], IncrementalHoareTripleChecker [91 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 2336.04ms Time] [2021-11-05 13:46:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6311 states. [2021-11-05 13:46:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6311 to 3465. [2021-11-05 13:46:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3378 states have (on average 1.325636471284784) internal successors, (4478), 3464 states have internal predecessors, (4478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4478 transitions. [2021-11-05 13:46:14,528 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4478 transitions. Word has length 94 [2021-11-05 13:46:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:46:14,529 INFO L470 AbstractCegarLoop]: Abstraction has 3465 states and 4478 transitions. [2021-11-05 13:46:14,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4478 transitions. [2021-11-05 13:46:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-05 13:46:14,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:46:14,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:46:14,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-05 13:46:14,743 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-05 13:46:14,744 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:46:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:46:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1667999028, now seen corresponding path program 1 times [2021-11-05 13:46:14,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:46:14,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36357084] [2021-11-05 13:46:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:46:14,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:46:14,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:46:14,748 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-05 13:46:14,749 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-05 13:46:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:46:17,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 13:46:17,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:46:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:46:18,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:46:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:46:18,907 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:46:18,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36357084] [2021-11-05 13:46:18,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36357084] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:46:18,907 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:46:18,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-05 13:46:18,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072938591] [2021-11-05 13:46:18,908 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:46:18,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 13:46:18,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:46:18,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 13:46:18,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-05 13:46:18,909 INFO L87 Difference]: Start difference. First operand 3465 states and 4478 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:21,154 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:46:23,162 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-05 13:46:27,323 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:48:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:48:03,514 INFO L93 Difference]: Finished difference Result 9562 states and 12285 transitions. [2021-11-05 13:48:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-05 13:48:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-05 13:48:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:48:03,529 INFO L225 Difference]: With dead ends: 9562 [2021-11-05 13:48:03,529 INFO L226 Difference]: Without dead ends: 6172 [2021-11-05 13:48:03,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1027.78ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-05 13:48:03,537 INFO L933 BasicCegarLoop]: 6668 mSDtfsCounter, 6799 mSDsluCounter, 21544 mSDsCounter, 0 mSdLazyCounter, 6448 mSolverCounterSat, 294 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 93130.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6799 SdHoareTripleChecker+Valid, 28212 SdHoareTripleChecker+Invalid, 6745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 106.66ms SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 6448 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103537.76ms IncrementalHoareTripleChecker+Time [2021-11-05 13:48:03,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6799 Valid, 28212 Invalid, 6745 Unknown, 0 Unchecked, 106.66ms Time], IncrementalHoareTripleChecker [294 Valid, 6448 Invalid, 3 Unknown, 0 Unchecked, 103537.76ms Time] [2021-11-05 13:48:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6172 states. [2021-11-05 13:48:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6172 to 3465. [2021-11-05 13:48:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3378 states have (on average 1.3200118413262285) internal successors, (4459), 3464 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:48:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4459 transitions. [2021-11-05 13:48:03,625 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4459 transitions. Word has length 94 [2021-11-05 13:48:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:48:03,626 INFO L470 AbstractCegarLoop]: Abstraction has 3465 states and 4459 transitions. [2021-11-05 13:48:03,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:48:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4459 transitions. [2021-11-05 13:48:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-05 13:48:03,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:48:03,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:48:03,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-05 13:48:03,847 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-05 13:48:03,848 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:48:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:48:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash 271163018, now seen corresponding path program 1 times [2021-11-05 13:48:03,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:48:03,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930497678] [2021-11-05 13:48:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:48:03,851 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:48:03,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:48:03,852 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-05 13:48:03,853 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-05 13:48:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:48:06,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:48:06,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:48:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:48:07,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:48:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:48:07,772 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:48:07,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930497678] [2021-11-05 13:48:07,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930497678] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:48:07,773 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:48:07,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-05 13:48:07,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038685971] [2021-11-05 13:48:07,773 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:48:07,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 13:48:07,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:48:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 13:48:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:48:07,774 INFO L87 Difference]: Start difference. First operand 3465 states and 4459 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:48:09,965 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:48:11,981 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-05 13:48:15,754 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:49:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:49:42,411 INFO L93 Difference]: Finished difference Result 9581 states and 12266 transitions. [2021-11-05 13:49:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-05 13:49:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-05 13:49:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:49:42,422 INFO L225 Difference]: With dead ends: 9581 [2021-11-05 13:49:42,423 INFO L226 Difference]: Without dead ends: 6191 [2021-11-05 13:49:42,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1102.27ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-05 13:49:42,430 INFO L933 BasicCegarLoop]: 6633 mSDtfsCounter, 9953 mSDsluCounter, 24851 mSDsCounter, 0 mSdLazyCounter, 6380 mSolverCounterSat, 489 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 84178.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9953 SdHoareTripleChecker+Valid, 31484 SdHoareTripleChecker+Invalid, 6872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 101.14ms SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 6380 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93550.61ms IncrementalHoareTripleChecker+Time [2021-11-05 13:49:42,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9953 Valid, 31484 Invalid, 6872 Unknown, 0 Unchecked, 101.14ms Time], IncrementalHoareTripleChecker [489 Valid, 6380 Invalid, 3 Unknown, 0 Unchecked, 93550.61ms Time] [2021-11-05 13:49:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2021-11-05 13:49:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 3503. [2021-11-05 13:49:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 3416 states have (on average 1.3108899297423888) internal successors, (4478), 3502 states have internal predecessors, (4478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:49:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4478 transitions. [2021-11-05 13:49:42,512 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4478 transitions. Word has length 94 [2021-11-05 13:49:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:49:42,512 INFO L470 AbstractCegarLoop]: Abstraction has 3503 states and 4478 transitions. [2021-11-05 13:49:42,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:49:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4478 transitions. [2021-11-05 13:49:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-05 13:49:42,513 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:49:42,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:49:42,587 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-05 13:49:42,739 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-05 13:49:42,740 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:49:42,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:49:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2095531576, now seen corresponding path program 1 times [2021-11-05 13:49:42,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:49:42,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392602801] [2021-11-05 13:49:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:49:42,743 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:49:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:49:42,744 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-05 13:49:42,744 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-05 13:49:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:49:45,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-05 13:49:45,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:49:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:49:45,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:49:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:49:46,210 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:49:46,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392602801] [2021-11-05 13:49:46,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392602801] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:49:46,211 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:49:46,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-05 13:49:46,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592586738] [2021-11-05 13:49:46,211 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:49:46,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 13:49:46,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:49:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 13:49:46,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:49:46,212 INFO L87 Difference]: Start difference. First operand 3503 states and 4478 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:49:48,540 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:49:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:49:50,614 INFO L93 Difference]: Finished difference Result 6932 states and 8866 transitions. [2021-11-05 13:49:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 13:49:50,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-05 13:49:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:49:50,622 INFO L225 Difference]: With dead ends: 6932 [2021-11-05 13:49:50,622 INFO L226 Difference]: Without dead ends: 3513 [2021-11-05 13:49:50,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 341.11ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-05 13:49:50,628 INFO L933 BasicCegarLoop]: 4315 mSDtfsCounter, 47 mSDsluCounter, 21190 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3915.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25505 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.87ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4133.73ms IncrementalHoareTripleChecker+Time [2021-11-05 13:49:50,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 25505 Invalid, 457 Unknown, 0 Unchecked, 17.87ms Time], IncrementalHoareTripleChecker [16 Valid, 440 Invalid, 1 Unknown, 0 Unchecked, 4133.73ms Time] [2021-11-05 13:49:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2021-11-05 13:49:50,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3503. [2021-11-05 13:49:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 3416 states have (on average 1.310304449648712) internal successors, (4476), 3502 states have internal predecessors, (4476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:49:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4476 transitions. [2021-11-05 13:49:50,687 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4476 transitions. Word has length 94 [2021-11-05 13:49:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:49:50,687 INFO L470 AbstractCegarLoop]: Abstraction has 3503 states and 4476 transitions. [2021-11-05 13:49:50,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:49:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4476 transitions. [2021-11-05 13:49:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-05 13:49:50,689 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:49:50,689 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:49:50,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-05 13:49:50,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:49:50,907 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:49:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:49:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1804257830, now seen corresponding path program 1 times [2021-11-05 13:49:50,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:49:50,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41036266] [2021-11-05 13:49:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:49:50,911 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:49:50,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:49:50,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:49:50,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-05 13:49:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:49:53,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 13:49:53,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:49:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:49:53,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:49:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:49:54,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:49:54,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41036266] [2021-11-05 13:49:54,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41036266] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:49:54,313 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:49:54,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-05 13:49:54,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906643863] [2021-11-05 13:49:54,313 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:49:54,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:49:54,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:49:54,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:49:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:49:54,314 INFO L87 Difference]: Start difference. First operand 3503 states and 4476 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:49:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:49:58,459 INFO L93 Difference]: Finished difference Result 10295 states and 13166 transitions. [2021-11-05 13:49:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:49:58,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-11-05 13:49:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:49:58,476 INFO L225 Difference]: With dead ends: 10295 [2021-11-05 13:49:58,476 INFO L226 Difference]: Without dead ends: 6889 [2021-11-05 13:49:58,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 264.29ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-05 13:49:58,484 INFO L933 BasicCegarLoop]: 8494 mSDtfsCounter, 4194 mSDsluCounter, 29075 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3421.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4194 SdHoareTripleChecker+Valid, 37569 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 35.88ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3803.98ms IncrementalHoareTripleChecker+Time [2021-11-05 13:49:58,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4194 Valid, 37569 Invalid, 771 Unknown, 0 Unchecked, 35.88ms Time], IncrementalHoareTripleChecker [5 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 3803.98ms Time] [2021-11-05 13:49:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6889 states. [2021-11-05 13:49:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6889 to 3503. [2021-11-05 13:49:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 3416 states have (on average 1.3100117096018735) internal successors, (4475), 3502 states have internal predecessors, (4475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:49:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4475 transitions. [2021-11-05 13:49:58,568 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4475 transitions. Word has length 97 [2021-11-05 13:49:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:49:58,568 INFO L470 AbstractCegarLoop]: Abstraction has 3503 states and 4475 transitions. [2021-11-05 13:49:58,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:49:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4475 transitions. [2021-11-05 13:49:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-05 13:49:58,569 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:49:58,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 13:49:58,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-05 13:49:58,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:49:58,783 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:49:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:49:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2062011892, now seen corresponding path program 1 times [2021-11-05 13:49:58,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:49:58,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492600468] [2021-11-05 13:49:58,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:49:58,787 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:49:58,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:49:58,790 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:49:58,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-05 13:50:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:50:01,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-05 13:50:01,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:50:03,859 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 40 treesize of output 28 [2021-11-05 13:50:03,869 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 25 treesize of output 13 [2021-11-05 13:50:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:50:04,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:50:07,269 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 13:50:07,269 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 40 treesize of output 43 [2021-11-05 13:50:07,332 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-05 13:50:07,332 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 39 treesize of output 34 [2021-11-05 13:50:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:50:07,813 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:50:07,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492600468] [2021-11-05 13:50:07,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492600468] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:50:07,814 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:50:07,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2021-11-05 13:50:07,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830396350] [2021-11-05 13:50:07,814 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:50:07,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-05 13:50:07,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:50:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-05 13:50:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-11-05 13:50:07,815 INFO L87 Difference]: Start difference. First operand 3503 states and 4475 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:50:10,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:50:12,035 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-05 13:50:14,042 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-05 13:50:16,058 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-05 13:50:22,345 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:50:25,491 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:50:30,827 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15