./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 11:42:44,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:42:44,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:42:44,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:42:44,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:42:44,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:42:44,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:42:44,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:42:44,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:42:44,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:42:44,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:42:44,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:42:44,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:42:44,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:42:44,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:42:44,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:42:44,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:42:44,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:42:44,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:42:44,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:42:44,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:42:44,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:42:44,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:42:44,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:42:44,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:42:44,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:42:44,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:42:44,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:42:44,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:42:44,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:42:44,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:42:44,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:42:44,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:42:44,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:42:44,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:42:44,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:42:44,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:42:44,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:42:44,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:42:44,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:42:44,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:42:44,790 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 11:42:44,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:42:44,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:42:44,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:42:44,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:42:44,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:42:44,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:42:44,808 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:42:44,808 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:42:44,808 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:42:44,808 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:42:44,808 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:42:44,808 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:42:44,809 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:42:44,809 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:42:44,809 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:42:44,809 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:42:44,809 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:42:44,809 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:42:44,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 11:42:44,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 11:42:44,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:42:44,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:42:44,810 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 11:42:44,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:42:44,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:42:44,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:42:44,811 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 11:42:44,811 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 11:42:44,811 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 11:42:44,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:42:44,812 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 11:42:44,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:42:44,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:42:44,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:42:44,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:42:44,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:42:44,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:42:44,813 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:42:44,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:42:44,813 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:42:44,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:42:44,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:42:44,814 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2022-12-14 11:42:44,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:42:44,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:42:44,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:42:44,988 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:42:44,988 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:42:44,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-12-14 11:42:47,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:42:47,729 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:42:47,730 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-12-14 11:42:47,738 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/data/15741d9b2/dd06f508d3c346eaa435b1dea0fde98c/FLAGeeeac5211 [2022-12-14 11:42:47,748 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/data/15741d9b2/dd06f508d3c346eaa435b1dea0fde98c [2022-12-14 11:42:47,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:42:47,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:42:47,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:42:47,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:42:47,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:42:47,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:42:47" (1/1) ... [2022-12-14 11:42:47,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5b5f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:47, skipping insertion in model container [2022-12-14 11:42:47,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:42:47" (1/1) ... [2022-12-14 11:42:47,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:42:47,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:42:47,893 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-12-14 11:42:47,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:47,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:47,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:42:48,030 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:42:48,039 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-12-14 11:42:48,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:42:48,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:42:48,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:42:48,100 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:42:48,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48 WrapperNode [2022-12-14 11:42:48,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:42:48,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:42:48,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:42:48,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:42:48,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,135 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-12-14 11:42:48,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:42:48,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:42:48,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:42:48,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:42:48,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,153 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:42:48,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:42:48,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:42:48,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:42:48,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (1/1) ... [2022-12-14 11:42:48,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:42:48,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:42:48,182 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:42:48,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:42:48,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:42:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 11:42:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:42:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:42:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:42:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 11:42:48,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 11:42:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 11:42:48,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 11:42:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 11:42:48,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 11:42:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 11:42:48,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 11:42:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:42:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 11:42:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:42:48,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:42:48,214 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 11:42:48,321 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:42:48,322 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:42:48,605 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:42:48,703 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:42:48,703 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 11:42:48,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:42:48 BoogieIcfgContainer [2022-12-14 11:42:48,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:42:48,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:42:48,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:42:48,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:42:48,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:42:47" (1/3) ... [2022-12-14 11:42:48,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47149827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:42:48, skipping insertion in model container [2022-12-14 11:42:48,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:42:48" (2/3) ... [2022-12-14 11:42:48,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47149827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:42:48, skipping insertion in model container [2022-12-14 11:42:48,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:42:48" (3/3) ... [2022-12-14 11:42:48,713 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-12-14 11:42:48,728 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:42:48,728 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-14 11:42:48,728 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 11:42:48,775 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 11:42:48,804 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 11:42:48,817 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 151 transitions, 322 flow [2022-12-14 11:42:48,819 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 151 transitions, 322 flow [2022-12-14 11:42:48,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-12-14 11:42:48,874 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-14 11:42:48,875 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 11:42:48,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-14 11:42:48,883 INFO L119 LiptonReduction]: Number of co-enabled transitions 3866 [2022-12-14 11:42:53,950 INFO L134 LiptonReduction]: Checked pairs total: 10973 [2022-12-14 11:42:53,950 INFO L136 LiptonReduction]: Total number of compositions: 143 [2022-12-14 11:42:53,955 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-12-14 11:42:54,139 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 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) [2022-12-14 11:42:54,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:42:54,156 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25f1222, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:42:54,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-14 11:42:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 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) [2022-12-14 11:42:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 11:42:54,177 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:54,178 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 11:42:54,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:42:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 631, now seen corresponding path program 1 times [2022-12-14 11:42:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:54,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083754200] [2022-12-14 11:42:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:42:54,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:54,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083754200] [2022-12-14 11:42:54,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083754200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:54,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:54,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 11:42:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92426553] [2022-12-14 11:42:54,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:54,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 11:42:54,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 11:42:54,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:42:54,313 INFO L87 Difference]: Start difference. First operand has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 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, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-12-14 11:42:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:54,462 INFO L93 Difference]: Finished difference Result 6072 states and 24528 transitions. [2022-12-14 11:42:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 11:42:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-12-14 11:42:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:54,524 INFO L225 Difference]: With dead ends: 6072 [2022-12-14 11:42:54,524 INFO L226 Difference]: Without dead ends: 6072 [2022-12-14 11:42:54,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:42:54,528 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:54,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2022-12-14 11:42:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 6072. [2022-12-14 11:42:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6072 states, 6067 states have (on average 4.042854788198451) internal successors, (24528), 6071 states have internal predecessors, (24528), 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) [2022-12-14 11:42:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6072 states to 6072 states and 24528 transitions. [2022-12-14 11:42:54,800 INFO L78 Accepts]: Start accepts. Automaton has 6072 states and 24528 transitions. Word has length 1 [2022-12-14 11:42:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:54,800 INFO L495 AbstractCegarLoop]: Abstraction has 6072 states and 24528 transitions. [2022-12-14 11:42:54,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-12-14 11:42:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6072 states and 24528 transitions. [2022-12-14 11:42:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:42:54,801 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:54,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:42:54,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:42:54,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:42:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:54,802 INFO L85 PathProgramCache]: Analyzing trace with hash 597848809, now seen corresponding path program 1 times [2022-12-14 11:42:54,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:54,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890080305] [2022-12-14 11:42:54,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:42:55,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890080305] [2022-12-14 11:42:55,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890080305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:55,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:55,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:42:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023714516] [2022-12-14 11:42:55,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:55,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:42:55,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:55,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:42:55,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:42:55,063 INFO L87 Difference]: Start difference. First operand 6072 states and 24528 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-12-14 11:42:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:55,193 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-12-14 11:42:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:42:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-12-14 11:42:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:55,222 INFO L225 Difference]: With dead ends: 4962 [2022-12-14 11:42:55,222 INFO L226 Difference]: Without dead ends: 4812 [2022-12-14 11:42:55,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:42:55,223 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:55,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:42:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-12-14 11:42:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-12-14 11:42:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 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) [2022-12-14 11:42:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-12-14 11:42:55,434 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 5 [2022-12-14 11:42:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:55,434 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-12-14 11:42:55,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-12-14 11:42:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-12-14 11:42:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 11:42:55,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:55,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:55,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:42:55,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:42:55,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:55,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1990652729, now seen corresponding path program 1 times [2022-12-14 11:42:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:55,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833633961] [2022-12-14 11:42:55,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:42:56,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:56,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833633961] [2022-12-14 11:42:56,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833633961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:56,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:56,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:42:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951699911] [2022-12-14 11:42:56,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:56,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:42:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:42:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:42:56,056 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-12-14 11:42:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:56,274 INFO L93 Difference]: Finished difference Result 6792 states and 26859 transitions. [2022-12-14 11:42:56,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:42:56,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-12-14 11:42:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:56,302 INFO L225 Difference]: With dead ends: 6792 [2022-12-14 11:42:56,302 INFO L226 Difference]: Without dead ends: 6792 [2022-12-14 11:42:56,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:42:56,303 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:56,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 14 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:42:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6792 states. [2022-12-14 11:42:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6792 to 4914. [2022-12-14 11:42:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4912 states have (on average 4.018526058631922) internal successors, (19739), 4913 states have internal predecessors, (19739), 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) [2022-12-14 11:42:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 19739 transitions. [2022-12-14 11:42:56,440 INFO L78 Accepts]: Start accepts. Automaton has 4914 states and 19739 transitions. Word has length 11 [2022-12-14 11:42:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:56,441 INFO L495 AbstractCegarLoop]: Abstraction has 4914 states and 19739 transitions. [2022-12-14 11:42:56,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-12-14 11:42:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4914 states and 19739 transitions. [2022-12-14 11:42:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:42:56,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:56,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:56,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:42:56,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:42:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1580690776, now seen corresponding path program 1 times [2022-12-14 11:42:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:56,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353640926] [2022-12-14 11:42:56,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:42:56,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:56,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353640926] [2022-12-14 11:42:56,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353640926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:56,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:56,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:42:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324389107] [2022-12-14 11:42:56,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:56,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:42:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:42:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:42:56,591 INFO L87 Difference]: Start difference. First operand 4914 states and 19739 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-12-14 11:42:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:56,699 INFO L93 Difference]: Finished difference Result 4868 states and 19529 transitions. [2022-12-14 11:42:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:42:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-12-14 11:42:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:56,720 INFO L225 Difference]: With dead ends: 4868 [2022-12-14 11:42:56,720 INFO L226 Difference]: Without dead ends: 4868 [2022-12-14 11:42:56,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:42:56,721 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:56,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:42:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2022-12-14 11:42:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4866. [2022-12-14 11:42:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4866 states, 4864 states have (on average 4.012952302631579) internal successors, (19519), 4865 states have internal predecessors, (19519), 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) [2022-12-14 11:42:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4866 states to 4866 states and 19519 transitions. [2022-12-14 11:42:56,875 INFO L78 Accepts]: Start accepts. Automaton has 4866 states and 19519 transitions. Word has length 12 [2022-12-14 11:42:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:56,875 INFO L495 AbstractCegarLoop]: Abstraction has 4866 states and 19519 transitions. [2022-12-14 11:42:56,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-12-14 11:42:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4866 states and 19519 transitions. [2022-12-14 11:42:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:42:56,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:56,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:56,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:42:56,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:42:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1580693248, now seen corresponding path program 1 times [2022-12-14 11:42:56,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:56,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210342105] [2022-12-14 11:42:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:42:57,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:57,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210342105] [2022-12-14 11:42:57,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210342105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:57,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:57,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:42:57,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808397680] [2022-12-14 11:42:57,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:57,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:42:57,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:57,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:42:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:42:57,342 INFO L87 Difference]: Start difference. First operand 4866 states and 19519 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-12-14 11:42:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:57,677 INFO L93 Difference]: Finished difference Result 4932 states and 19200 transitions. [2022-12-14 11:42:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:42:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-12-14 11:42:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:57,690 INFO L225 Difference]: With dead ends: 4932 [2022-12-14 11:42:57,690 INFO L226 Difference]: Without dead ends: 4182 [2022-12-14 11:42:57,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:42:57,691 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:57,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 74 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:42:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4182 states. [2022-12-14 11:42:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4182 to 4130. [2022-12-14 11:42:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4130 states, 4128 states have (on average 3.9454941860465116) internal successors, (16287), 4129 states have internal predecessors, (16287), 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) [2022-12-14 11:42:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 16287 transitions. [2022-12-14 11:42:57,784 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 16287 transitions. Word has length 12 [2022-12-14 11:42:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:57,785 INFO L495 AbstractCegarLoop]: Abstraction has 4130 states and 16287 transitions. [2022-12-14 11:42:57,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-12-14 11:42:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 16287 transitions. [2022-12-14 11:42:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:42:57,787 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:57,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:57,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:42:57,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:42:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:57,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1926763996, now seen corresponding path program 1 times [2022-12-14 11:42:57,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:57,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53187018] [2022-12-14 11:42:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:42:58,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53187018] [2022-12-14 11:42:58,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53187018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:58,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:58,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:42:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896340355] [2022-12-14 11:42:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:58,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:42:58,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:58,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:42:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:42:58,363 INFO L87 Difference]: Start difference. First operand 4130 states and 16287 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-12-14 11:42:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:58,579 INFO L93 Difference]: Finished difference Result 5642 states and 22040 transitions. [2022-12-14 11:42:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:42:58,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-12-14 11:42:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:58,597 INFO L225 Difference]: With dead ends: 5642 [2022-12-14 11:42:58,597 INFO L226 Difference]: Without dead ends: 5642 [2022-12-14 11:42:58,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:42:58,598 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:58,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 13 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:42:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2022-12-14 11:42:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 4142. [2022-12-14 11:42:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4142 states, 4140 states have (on average 3.948550724637681) internal successors, (16347), 4141 states have internal predecessors, (16347), 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) [2022-12-14 11:42:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16347 transitions. [2022-12-14 11:42:58,722 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16347 transitions. Word has length 14 [2022-12-14 11:42:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:58,722 INFO L495 AbstractCegarLoop]: Abstraction has 4142 states and 16347 transitions. [2022-12-14 11:42:58,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-12-14 11:42:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16347 transitions. [2022-12-14 11:42:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:42:58,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:58,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:58,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:42:58,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:42:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1926766468, now seen corresponding path program 1 times [2022-12-14 11:42:58,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:58,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476763004] [2022-12-14 11:42:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:42:59,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:59,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476763004] [2022-12-14 11:42:59,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476763004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:59,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:59,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:42:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107594941] [2022-12-14 11:42:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:59,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:42:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:59,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:42:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:42:59,145 INFO L87 Difference]: Start difference. First operand 4142 states and 16347 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2022-12-14 11:42:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:59,417 INFO L93 Difference]: Finished difference Result 3642 states and 14272 transitions. [2022-12-14 11:42:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:42:59,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-12-14 11:42:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:59,424 INFO L225 Difference]: With dead ends: 3642 [2022-12-14 11:42:59,424 INFO L226 Difference]: Without dead ends: 3142 [2022-12-14 11:42:59,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:42:59,425 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:59,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 75 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:42:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2022-12-14 11:42:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3142. [2022-12-14 11:42:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3141 states have (on average 3.8449538363578477) internal successors, (12077), 3141 states have internal predecessors, (12077), 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) [2022-12-14 11:42:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 12077 transitions. [2022-12-14 11:42:59,477 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 12077 transitions. Word has length 14 [2022-12-14 11:42:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:59,477 INFO L495 AbstractCegarLoop]: Abstraction has 3142 states and 12077 transitions. [2022-12-14 11:42:59,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2022-12-14 11:42:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 12077 transitions. [2022-12-14 11:42:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:42:59,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:59,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:59,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:42:59,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:42:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1926824446, now seen corresponding path program 2 times [2022-12-14 11:42:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:59,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435679266] [2022-12-14 11:42:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:42:59,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:59,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435679266] [2022-12-14 11:42:59,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435679266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:59,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:59,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:42:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013798017] [2022-12-14 11:42:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:59,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:42:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:42:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:42:59,890 INFO L87 Difference]: Start difference. First operand 3142 states and 12077 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-12-14 11:43:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:00,024 INFO L93 Difference]: Finished difference Result 3118 states and 11957 transitions. [2022-12-14 11:43:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:43:00,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-12-14 11:43:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:00,034 INFO L225 Difference]: With dead ends: 3118 [2022-12-14 11:43:00,035 INFO L226 Difference]: Without dead ends: 3118 [2022-12-14 11:43:00,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:00,035 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:00,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 21 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3118 states. [2022-12-14 11:43:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3118 to 3118. [2022-12-14 11:43:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3118 states, 3117 states have (on average 3.8360603144048766) internal successors, (11957), 3117 states have internal predecessors, (11957), 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) [2022-12-14 11:43:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 11957 transitions. [2022-12-14 11:43:00,110 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 11957 transitions. Word has length 14 [2022-12-14 11:43:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:00,110 INFO L495 AbstractCegarLoop]: Abstraction has 3118 states and 11957 transitions. [2022-12-14 11:43:00,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-12-14 11:43:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 11957 transitions. [2022-12-14 11:43:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 11:43:00,112 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:00,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:00,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:43:00,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:00,113 INFO L85 PathProgramCache]: Analyzing trace with hash -22466138, now seen corresponding path program 1 times [2022-12-14 11:43:00,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:00,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294803381] [2022-12-14 11:43:00,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:00,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:00,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:00,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294803381] [2022-12-14 11:43:00,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294803381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:00,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:00,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:43:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107035039] [2022-12-14 11:43:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:00,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:43:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:00,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:43:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:00,322 INFO L87 Difference]: Start difference. First operand 3118 states and 11957 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-12-14 11:43:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:00,472 INFO L93 Difference]: Finished difference Result 3122 states and 11967 transitions. [2022-12-14 11:43:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:43:00,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-12-14 11:43:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:00,479 INFO L225 Difference]: With dead ends: 3122 [2022-12-14 11:43:00,479 INFO L226 Difference]: Without dead ends: 3122 [2022-12-14 11:43:00,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:00,480 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:00,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 20 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2022-12-14 11:43:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3030. [2022-12-14 11:43:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 3.8319577418289863) internal successors, (11607), 3029 states have internal predecessors, (11607), 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) [2022-12-14 11:43:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 11607 transitions. [2022-12-14 11:43:00,527 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 11607 transitions. Word has length 15 [2022-12-14 11:43:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:00,527 INFO L495 AbstractCegarLoop]: Abstraction has 3030 states and 11607 transitions. [2022-12-14 11:43:00,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-12-14 11:43:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 11607 transitions. [2022-12-14 11:43:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:43:00,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:00,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:00,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 11:43:00,530 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:00,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash -696451957, now seen corresponding path program 1 times [2022-12-14 11:43:00,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:00,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516911664] [2022-12-14 11:43:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:00,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:00,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516911664] [2022-12-14 11:43:00,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516911664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:00,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:00,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479279262] [2022-12-14 11:43:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:00,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:43:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:00,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:43:00,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:00,803 INFO L87 Difference]: Start difference. First operand 3030 states and 11607 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:00,968 INFO L93 Difference]: Finished difference Result 3300 states and 12732 transitions. [2022-12-14 11:43:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:00,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-12-14 11:43:00,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:00,979 INFO L225 Difference]: With dead ends: 3300 [2022-12-14 11:43:00,980 INFO L226 Difference]: Without dead ends: 3300 [2022-12-14 11:43:00,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:00,980 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:00,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 36 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2022-12-14 11:43:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 3145. [2022-12-14 11:43:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3145 states, 3144 states have (on average 3.8317430025445294) internal successors, (12047), 3144 states have internal predecessors, (12047), 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) [2022-12-14 11:43:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 12047 transitions. [2022-12-14 11:43:01,055 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 12047 transitions. Word has length 16 [2022-12-14 11:43:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:01,055 INFO L495 AbstractCegarLoop]: Abstraction has 3145 states and 12047 transitions. [2022-12-14 11:43:01,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 12047 transitions. [2022-12-14 11:43:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:43:01,057 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:01,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:01,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 11:43:01,058 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash -700379347, now seen corresponding path program 2 times [2022-12-14 11:43:01,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:01,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919282731] [2022-12-14 11:43:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:01,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:01,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919282731] [2022-12-14 11:43:01,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919282731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:01,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:01,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10006709] [2022-12-14 11:43:01,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:01,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:43:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:01,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:43:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:01,643 INFO L87 Difference]: Start difference. First operand 3145 states and 12047 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:01,901 INFO L93 Difference]: Finished difference Result 3940 states and 15234 transitions. [2022-12-14 11:43:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:43:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-12-14 11:43:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:01,910 INFO L225 Difference]: With dead ends: 3940 [2022-12-14 11:43:01,910 INFO L226 Difference]: Without dead ends: 3940 [2022-12-14 11:43:01,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:43:01,910 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:01,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 35 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2022-12-14 11:43:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3303. [2022-12-14 11:43:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3302 states have (on average 3.8576620230163536) internal successors, (12738), 3302 states have internal predecessors, (12738), 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) [2022-12-14 11:43:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 12738 transitions. [2022-12-14 11:43:01,967 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 12738 transitions. Word has length 16 [2022-12-14 11:43:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:01,967 INFO L495 AbstractCegarLoop]: Abstraction has 3303 states and 12738 transitions. [2022-12-14 11:43:01,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 12738 transitions. [2022-12-14 11:43:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:43:01,971 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:01,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:01,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 11:43:01,971 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1011368719, now seen corresponding path program 3 times [2022-12-14 11:43:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:01,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511952462] [2022-12-14 11:43:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:02,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:02,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511952462] [2022-12-14 11:43:02,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511952462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:02,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:02,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28934920] [2022-12-14 11:43:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:43:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:43:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:02,239 INFO L87 Difference]: Start difference. First operand 3303 states and 12738 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:02,363 INFO L93 Difference]: Finished difference Result 3818 states and 14648 transitions. [2022-12-14 11:43:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:43:02,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-12-14 11:43:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:02,371 INFO L225 Difference]: With dead ends: 3818 [2022-12-14 11:43:02,372 INFO L226 Difference]: Without dead ends: 3818 [2022-12-14 11:43:02,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:43:02,372 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 91 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:02,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 22 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2022-12-14 11:43:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3337. [2022-12-14 11:43:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3336 states have (on average 3.845023980815348) internal successors, (12827), 3336 states have internal predecessors, (12827), 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) [2022-12-14 11:43:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 12827 transitions. [2022-12-14 11:43:02,430 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 12827 transitions. Word has length 16 [2022-12-14 11:43:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:02,430 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 12827 transitions. [2022-12-14 11:43:02,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 12827 transitions. [2022-12-14 11:43:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:43:02,434 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:02,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:02,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 11:43:02,434 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash 887621059, now seen corresponding path program 4 times [2022-12-14 11:43:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:02,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501690963] [2022-12-14 11:43:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:02,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:02,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501690963] [2022-12-14 11:43:02,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501690963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:02,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:02,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:02,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558801150] [2022-12-14 11:43:02,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:02,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:43:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:02,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:43:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:02,879 INFO L87 Difference]: Start difference. First operand 3337 states and 12827 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:03,068 INFO L93 Difference]: Finished difference Result 4389 states and 16781 transitions. [2022-12-14 11:43:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:03,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-12-14 11:43:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:03,081 INFO L225 Difference]: With dead ends: 4389 [2022-12-14 11:43:03,082 INFO L226 Difference]: Without dead ends: 4389 [2022-12-14 11:43:03,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:43:03,082 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:03,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 29 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2022-12-14 11:43:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 3936. [2022-12-14 11:43:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3935 states have (on average 3.829733163913596) internal successors, (15070), 3935 states have internal predecessors, (15070), 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) [2022-12-14 11:43:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 15070 transitions. [2022-12-14 11:43:03,180 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 15070 transitions. Word has length 16 [2022-12-14 11:43:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:03,180 INFO L495 AbstractCegarLoop]: Abstraction has 3936 states and 15070 transitions. [2022-12-14 11:43:03,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 15070 transitions. [2022-12-14 11:43:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:43:03,184 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:03,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:03,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 11:43:03,185 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:03,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 487333275, now seen corresponding path program 1 times [2022-12-14 11:43:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:03,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609103153] [2022-12-14 11:43:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:03,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:03,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609103153] [2022-12-14 11:43:03,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609103153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:03,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:03,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026868146] [2022-12-14 11:43:03,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:03,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:43:03,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:03,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:43:03,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:03,559 INFO L87 Difference]: Start difference. First operand 3936 states and 15070 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:03,727 INFO L93 Difference]: Finished difference Result 3960 states and 15138 transitions. [2022-12-14 11:43:03,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:43:03,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-12-14 11:43:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:03,737 INFO L225 Difference]: With dead ends: 3960 [2022-12-14 11:43:03,737 INFO L226 Difference]: Without dead ends: 3960 [2022-12-14 11:43:03,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:43:03,738 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:03,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2022-12-14 11:43:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 3836. [2022-12-14 11:43:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3835 states have (on average 3.8195567144719687) internal successors, (14648), 3835 states have internal predecessors, (14648), 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) [2022-12-14 11:43:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 14648 transitions. [2022-12-14 11:43:03,806 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 14648 transitions. Word has length 16 [2022-12-14 11:43:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:03,806 INFO L495 AbstractCegarLoop]: Abstraction has 3836 states and 14648 transitions. [2022-12-14 11:43:03,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 11:43:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 14648 transitions. [2022-12-14 11:43:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:43:03,809 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:03,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:03,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 11:43:03,809 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:03,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash 489162523, now seen corresponding path program 1 times [2022-12-14 11:43:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:03,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624346926] [2022-12-14 11:43:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:03,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:03,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624346926] [2022-12-14 11:43:03,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624346926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:03,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:03,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:43:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027492336] [2022-12-14 11:43:03,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:03,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:43:03,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:43:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:43:03,915 INFO L87 Difference]: Start difference. First operand 3836 states and 14648 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-12-14 11:43:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:04,016 INFO L93 Difference]: Finished difference Result 3907 states and 13635 transitions. [2022-12-14 11:43:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:04,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-12-14 11:43:04,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:04,022 INFO L225 Difference]: With dead ends: 3907 [2022-12-14 11:43:04,022 INFO L226 Difference]: Without dead ends: 2893 [2022-12-14 11:43:04,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:04,023 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:04,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 25 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2022-12-14 11:43:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2893. [2022-12-14 11:43:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2892 states have (on average 3.4398340248962658) internal successors, (9948), 2892 states have internal predecessors, (9948), 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) [2022-12-14 11:43:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 9948 transitions. [2022-12-14 11:43:04,066 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 9948 transitions. Word has length 16 [2022-12-14 11:43:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:04,066 INFO L495 AbstractCegarLoop]: Abstraction has 2893 states and 9948 transitions. [2022-12-14 11:43:04,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-12-14 11:43:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 9948 transitions. [2022-12-14 11:43:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 11:43:04,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:04,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:04,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 11:43:04,069 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2058411808, now seen corresponding path program 1 times [2022-12-14 11:43:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:04,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617866134] [2022-12-14 11:43:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:04,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:04,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617866134] [2022-12-14 11:43:04,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617866134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:04,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:04,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:04,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029930543] [2022-12-14 11:43:04,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:04,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:43:04,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:43:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:04,165 INFO L87 Difference]: Start difference. First operand 2893 states and 9948 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-12-14 11:43:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:04,281 INFO L93 Difference]: Finished difference Result 2447 states and 7834 transitions. [2022-12-14 11:43:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:43:04,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-12-14 11:43:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:04,284 INFO L225 Difference]: With dead ends: 2447 [2022-12-14 11:43:04,284 INFO L226 Difference]: Without dead ends: 1849 [2022-12-14 11:43:04,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:04,285 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:04,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 35 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2022-12-14 11:43:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1693. [2022-12-14 11:43:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1692 states have (on average 3.1087470449172576) internal successors, (5260), 1692 states have internal predecessors, (5260), 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) [2022-12-14 11:43:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 5260 transitions. [2022-12-14 11:43:04,307 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 5260 transitions. Word has length 17 [2022-12-14 11:43:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:04,308 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 5260 transitions. [2022-12-14 11:43:04,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-12-14 11:43:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 5260 transitions. [2022-12-14 11:43:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 11:43:04,309 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:04,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:04,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 11:43:04,310 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2131935950, now seen corresponding path program 1 times [2022-12-14 11:43:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:04,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142067807] [2022-12-14 11:43:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:04,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:04,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:04,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142067807] [2022-12-14 11:43:04,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142067807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:04,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:04,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:43:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629561449] [2022-12-14 11:43:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:04,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:43:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:43:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:04,422 INFO L87 Difference]: Start difference. First operand 1693 states and 5260 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-14 11:43:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:04,570 INFO L93 Difference]: Finished difference Result 1489 states and 4613 transitions. [2022-12-14 11:43:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:43:04,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-12-14 11:43:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:04,573 INFO L225 Difference]: With dead ends: 1489 [2022-12-14 11:43:04,573 INFO L226 Difference]: Without dead ends: 1324 [2022-12-14 11:43:04,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:43:04,574 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 77 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:04,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-12-14 11:43:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1144. [2022-12-14 11:43:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 3.146981627296588) internal successors, (3597), 1143 states have internal predecessors, (3597), 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) [2022-12-14 11:43:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 3597 transitions. [2022-12-14 11:43:04,592 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 3597 transitions. Word has length 20 [2022-12-14 11:43:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:04,592 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 3597 transitions. [2022-12-14 11:43:04,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-12-14 11:43:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 3597 transitions. [2022-12-14 11:43:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:43:04,594 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:04,594 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:04,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 11:43:04,594 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2032698558, now seen corresponding path program 1 times [2022-12-14 11:43:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:04,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258316163] [2022-12-14 11:43:04,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:04,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:04,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258316163] [2022-12-14 11:43:04,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258316163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:04,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:04,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574087226] [2022-12-14 11:43:04,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:04,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:43:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:04,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:43:04,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:04,830 INFO L87 Difference]: Start difference. First operand 1144 states and 3597 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-14 11:43:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:05,085 INFO L93 Difference]: Finished difference Result 1699 states and 5294 transitions. [2022-12-14 11:43:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:43:05,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2022-12-14 11:43:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:05,088 INFO L225 Difference]: With dead ends: 1699 [2022-12-14 11:43:05,088 INFO L226 Difference]: Without dead ends: 1340 [2022-12-14 11:43:05,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:43:05,089 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:05,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 24 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-12-14 11:43:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1144. [2022-12-14 11:43:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 3.057742782152231) internal successors, (3495), 1143 states have internal predecessors, (3495), 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) [2022-12-14 11:43:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 3495 transitions. [2022-12-14 11:43:05,104 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 3495 transitions. Word has length 24 [2022-12-14 11:43:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:05,104 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 3495 transitions. [2022-12-14 11:43:05,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2022-12-14 11:43:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 3495 transitions. [2022-12-14 11:43:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:43:05,106 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:05,106 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:05,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 11:43:05,106 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2002600543, now seen corresponding path program 1 times [2022-12-14 11:43:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:05,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601951694] [2022-12-14 11:43:05,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:05,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:05,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:05,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601951694] [2022-12-14 11:43:05,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601951694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:05,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:05,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:43:05,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636394802] [2022-12-14 11:43:05,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:05,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:43:05,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:05,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:43:05,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:43:05,216 INFO L87 Difference]: Start difference. First operand 1144 states and 3495 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-12-14 11:43:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:05,290 INFO L93 Difference]: Finished difference Result 1668 states and 5014 transitions. [2022-12-14 11:43:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:43:05,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2022-12-14 11:43:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:05,292 INFO L225 Difference]: With dead ends: 1668 [2022-12-14 11:43:05,292 INFO L226 Difference]: Without dead ends: 957 [2022-12-14 11:43:05,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:05,293 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:05,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 22 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-12-14 11:43:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 954. [2022-12-14 11:43:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 2.8551941238195173) internal successors, (2721), 953 states have internal predecessors, (2721), 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) [2022-12-14 11:43:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 2721 transitions. [2022-12-14 11:43:05,303 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 2721 transitions. Word has length 24 [2022-12-14 11:43:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:05,303 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 2721 transitions. [2022-12-14 11:43:05,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-12-14 11:43:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 2721 transitions. [2022-12-14 11:43:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:43:05,304 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:05,304 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:05,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 11:43:05,305 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash -653918978, now seen corresponding path program 2 times [2022-12-14 11:43:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:05,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364186052] [2022-12-14 11:43:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:05,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:05,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364186052] [2022-12-14 11:43:05,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364186052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:05,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:05,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:43:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703521471] [2022-12-14 11:43:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:05,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:43:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:43:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:43:05,445 INFO L87 Difference]: Start difference. First operand 954 states and 2721 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-12-14 11:43:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:05,555 INFO L93 Difference]: Finished difference Result 923 states and 2660 transitions. [2022-12-14 11:43:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:43:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-12-14 11:43:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:05,556 INFO L225 Difference]: With dead ends: 923 [2022-12-14 11:43:05,556 INFO L226 Difference]: Without dead ends: 365 [2022-12-14 11:43:05,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:43:05,557 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:05,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 29 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-14 11:43:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2022-12-14 11:43:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.707865168539326) internal successors, (964), 356 states have internal predecessors, (964), 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) [2022-12-14 11:43:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 964 transitions. [2022-12-14 11:43:05,561 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 964 transitions. Word has length 24 [2022-12-14 11:43:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:05,561 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 964 transitions. [2022-12-14 11:43:05,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-12-14 11:43:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 964 transitions. [2022-12-14 11:43:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:05,562 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:05,562 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:05,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 11:43:05,562 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:05,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash -707230007, now seen corresponding path program 1 times [2022-12-14 11:43:05,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:05,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507964474] [2022-12-14 11:43:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:05,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:05,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:05,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507964474] [2022-12-14 11:43:05,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507964474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:05,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:05,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:43:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254812900] [2022-12-14 11:43:05,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:05,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:43:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:05,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:43:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:43:05,672 INFO L87 Difference]: Start difference. First operand 357 states and 964 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2022-12-14 11:43:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:05,716 INFO L93 Difference]: Finished difference Result 512 states and 1386 transitions. [2022-12-14 11:43:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:43:05,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-12-14 11:43:05,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:05,717 INFO L225 Difference]: With dead ends: 512 [2022-12-14 11:43:05,717 INFO L226 Difference]: Without dead ends: 221 [2022-12-14 11:43:05,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:43:05,718 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:05,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 12 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:43:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-12-14 11:43:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-12-14 11:43:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.5454545454545454) internal successors, (560), 220 states have internal predecessors, (560), 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) [2022-12-14 11:43:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 560 transitions. [2022-12-14 11:43:05,721 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 560 transitions. Word has length 28 [2022-12-14 11:43:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:05,721 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 560 transitions. [2022-12-14 11:43:05,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2022-12-14 11:43:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 560 transitions. [2022-12-14 11:43:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:05,722 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:05,722 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:05,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 11:43:05,722 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:05,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash -39228965, now seen corresponding path program 2 times [2022-12-14 11:43:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:05,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314469680] [2022-12-14 11:43:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:06,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:06,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314469680] [2022-12-14 11:43:06,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314469680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:06,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:06,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:43:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255363719] [2022-12-14 11:43:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:06,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:43:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:43:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:43:06,580 INFO L87 Difference]: Start difference. First operand 221 states and 560 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:06,882 INFO L93 Difference]: Finished difference Result 301 states and 767 transitions. [2022-12-14 11:43:06,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:43:06,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 28 [2022-12-14 11:43:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:06,883 INFO L225 Difference]: With dead ends: 301 [2022-12-14 11:43:06,884 INFO L226 Difference]: Without dead ends: 259 [2022-12-14 11:43:06,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-12-14 11:43:06,884 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:06,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 42 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-12-14 11:43:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 205. [2022-12-14 11:43:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.4313725490196076) internal successors, (496), 204 states have internal predecessors, (496), 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) [2022-12-14 11:43:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 496 transitions. [2022-12-14 11:43:06,887 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 496 transitions. Word has length 28 [2022-12-14 11:43:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:06,887 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 496 transitions. [2022-12-14 11:43:06,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 496 transitions. [2022-12-14 11:43:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:06,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:06,888 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:06,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 11:43:06,888 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:06,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1193391907, now seen corresponding path program 3 times [2022-12-14 11:43:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:06,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509898799] [2022-12-14 11:43:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:07,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:43:07,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509898799] [2022-12-14 11:43:07,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509898799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:07,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:07,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:43:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977351201] [2022-12-14 11:43:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:43:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:43:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:43:07,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:43:07,836 INFO L87 Difference]: Start difference. First operand 205 states and 496 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:08,099 INFO L93 Difference]: Finished difference Result 285 states and 697 transitions. [2022-12-14 11:43:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:43:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 28 [2022-12-14 11:43:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:08,099 INFO L225 Difference]: With dead ends: 285 [2022-12-14 11:43:08,100 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 11:43:08,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:43:08,100 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:08,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 60 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 11:43:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-12-14 11:43:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.318840579710145) internal successors, (320), 138 states have internal predecessors, (320), 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) [2022-12-14 11:43:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 320 transitions. [2022-12-14 11:43:08,102 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 320 transitions. Word has length 28 [2022-12-14 11:43:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 320 transitions. [2022-12-14 11:43:08,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 320 transitions. [2022-12-14 11:43:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:08,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:08,102 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:08,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 11:43:08,103 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:08,103 INFO L85 PathProgramCache]: Analyzing trace with hash -560450373, now seen corresponding path program 4 times [2022-12-14 11:43:08,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:43:08,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646025931] [2022-12-14 11:43:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:43:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:43:08,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 11:43:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:43:08,172 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 11:43:08,172 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 11:43:08,173 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-14 11:43:08,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-14 11:43:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-14 11:43:08,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-14 11:43:08,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 11:43:08,177 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:08,181 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 11:43:08,181 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:43:08,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:43:08 BasicIcfg [2022-12-14 11:43:08,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:43:08,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:43:08,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:43:08,228 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:43:08,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:42:48" (3/4) ... [2022-12-14 11:43:08,231 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 11:43:08,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:43:08,231 INFO L158 Benchmark]: Toolchain (without parser) took 20479.83ms. Allocated memory was 140.5MB in the beginning and 945.8MB in the end (delta: 805.3MB). Free memory was 112.6MB in the beginning and 473.2MB in the end (delta: -360.6MB). Peak memory consumption was 447.3MB. Max. memory is 16.1GB. [2022-12-14 11:43:08,231 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:43:08,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.50ms. Allocated memory is still 140.5MB. Free memory was 112.6MB in the beginning and 83.9MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-14 11:43:08,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.60ms. Allocated memory is still 140.5MB. Free memory was 83.9MB in the beginning and 81.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:43:08,232 INFO L158 Benchmark]: Boogie Preprocessor took 21.29ms. Allocated memory is still 140.5MB. Free memory was 81.3MB in the beginning and 79.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:43:08,232 INFO L158 Benchmark]: RCFGBuilder took 548.75ms. Allocated memory is still 140.5MB. Free memory was 79.3MB in the beginning and 107.8MB in the end (delta: -28.6MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2022-12-14 11:43:08,232 INFO L158 Benchmark]: TraceAbstraction took 19519.88ms. Allocated memory was 140.5MB in the beginning and 945.8MB in the end (delta: 805.3MB). Free memory was 107.2MB in the beginning and 473.2MB in the end (delta: -366.0MB). Peak memory consumption was 440.4MB. Max. memory is 16.1GB. [2022-12-14 11:43:08,232 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 945.8MB. Free memory is still 473.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:43:08,233 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.50ms. Allocated memory is still 140.5MB. Free memory was 112.6MB in the beginning and 83.9MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.60ms. Allocated memory is still 140.5MB. Free memory was 83.9MB in the beginning and 81.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.29ms. Allocated memory is still 140.5MB. Free memory was 81.3MB in the beginning and 79.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.75ms. Allocated memory is still 140.5MB. Free memory was 79.3MB in the beginning and 107.8MB in the end (delta: -28.6MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19519.88ms. Allocated memory was 140.5MB in the beginning and 945.8MB in the end (delta: 805.3MB). Free memory was 107.2MB in the beginning and 473.2MB in the end (delta: -366.0MB). Peak memory consumption was 440.4MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 945.8MB. Free memory is still 473.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 162 PlacesBefore, 57 PlacesAfterwards, 151 TransitionsBefore, 45 TransitionsAfterwards, 3866 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 143 TotalNumberOfCompositions, 10973 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5149, independent: 4911, independent conditional: 0, independent unconditional: 4911, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2656, independent: 2545, independent conditional: 0, independent unconditional: 2545, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2656, independent: 2512, independent conditional: 0, independent unconditional: 2512, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 144, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 727, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 696, dependent conditional: 0, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5149, independent: 2366, independent conditional: 0, independent unconditional: 2366, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 2656, unknown conditional: 0, unknown unconditional: 2656] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 334, Positive conditional cache size: 0, Positive unconditional cache size: 334, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-3, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=-2, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=-1, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 189 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1052 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1052 mSDsluCounter, 678 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 465 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3208 IncrementalHoareTripleChecker+Invalid, 3356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 213 mSDtfsCounter, 3208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6444occurred in iteration=0, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 5971 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 5088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 [2022-12-14 11:43:08,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 11:43:09,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:43:09,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:43:09,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:43:09,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:43:09,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:43:09,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:43:09,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:43:09,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:43:09,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:43:09,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:43:09,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:43:09,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:43:09,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:43:09,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:43:09,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:43:09,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:43:09,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:43:09,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:43:09,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:43:09,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:43:10,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:43:10,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:43:10,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:43:10,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:43:10,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:43:10,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:43:10,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:43:10,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:43:10,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:43:10,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:43:10,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:43:10,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:43:10,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:43:10,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:43:10,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:43:10,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:43:10,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:43:10,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:43:10,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:43:10,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:43:10,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 11:43:10,040 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:43:10,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:43:10,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:43:10,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:43:10,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:43:10,042 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:43:10,042 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:43:10,042 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:43:10,042 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:43:10,043 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:43:10,043 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:43:10,043 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:43:10,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 11:43:10,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 11:43:10,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:43:10,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:43:10,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 11:43:10,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:43:10,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:43:10,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:43:10,045 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 11:43:10,045 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 11:43:10,045 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 11:43:10,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:43:10,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 11:43:10,046 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 11:43:10,046 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 11:43:10,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:43:10,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:43:10,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:43:10,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 11:43:10,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:43:10,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:43:10,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:43:10,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:43:10,048 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 11:43:10,048 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 11:43:10,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:43:10,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 11:43:10,048 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2022-12-14 11:43:10,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:43:10,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:43:10,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:43:10,280 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:43:10,280 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:43:10,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-12-14 11:43:12,826 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:43:13,036 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:43:13,037 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-12-14 11:43:13,051 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/data/477aeda3e/63a3e3a1aadb4ec48f8489d31d295dc4/FLAG6246c98b9 [2022-12-14 11:43:13,064 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/data/477aeda3e/63a3e3a1aadb4ec48f8489d31d295dc4 [2022-12-14 11:43:13,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:43:13,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:43:13,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:43:13,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:43:13,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:43:13,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a284bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13, skipping insertion in model container [2022-12-14 11:43:13,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:43:13,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:43:13,263 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-12-14 11:43:13,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:43:13,414 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:43:13,423 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-12-14 11:43:13,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 11:43:13,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 11:43:13,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:43:13,489 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:43:13,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13 WrapperNode [2022-12-14 11:43:13,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:43:13,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:43:13,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:43:13,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:43:13,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,528 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-14 11:43:13,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:43:13,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:43:13,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:43:13,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:43:13,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,552 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:43:13,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:43:13,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:43:13,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:43:13,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (1/1) ... [2022-12-14 11:43:13,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:43:13,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:43:13,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:43:13,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:43:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 11:43:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:43:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:43:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:43:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 11:43:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 11:43:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 11:43:13,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 11:43:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 11:43:13,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 11:43:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 11:43:13,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 11:43:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 11:43:13,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 11:43:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 11:43:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:43:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:43:13,611 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 11:43:13,731 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:43:13,733 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:43:14,072 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:43:14,191 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:43:14,191 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 11:43:14,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:14 BoogieIcfgContainer [2022-12-14 11:43:14,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:43:14,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:43:14,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:43:14,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:43:14,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:43:13" (1/3) ... [2022-12-14 11:43:14,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9f863d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:43:14, skipping insertion in model container [2022-12-14 11:43:14,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:13" (2/3) ... [2022-12-14 11:43:14,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9f863d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:43:14, skipping insertion in model container [2022-12-14 11:43:14,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:14" (3/3) ... [2022-12-14 11:43:14,200 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-12-14 11:43:14,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:43:14,215 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-14 11:43:14,215 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 11:43:14,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 11:43:14,294 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 11:43:14,305 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 152 transitions, 324 flow [2022-12-14 11:43:14,307 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 152 transitions, 324 flow [2022-12-14 11:43:14,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-12-14 11:43:14,356 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-14 11:43:14,357 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 11:43:14,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-14 11:43:14,364 INFO L119 LiptonReduction]: Number of co-enabled transitions 3866 [2022-12-14 11:43:22,251 INFO L134 LiptonReduction]: Checked pairs total: 10967 [2022-12-14 11:43:22,251 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-12-14 11:43:22,258 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-12-14 11:43:22,523 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 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) [2022-12-14 11:43:22,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:43:22,560 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a9e41da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:43:22,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-14 11:43:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 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) [2022-12-14 11:43:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 11:43:22,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:22,586 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 11:43:22,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 631, now seen corresponding path program 1 times [2022-12-14 11:43:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018779587] [2022-12-14 11:43:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:22,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:22,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:22,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:22,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 11:43:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:22,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 11:43:22,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:22,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:22,667 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:22,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018779587] [2022-12-14 11:43:22,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018779587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:22,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:22,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 11:43:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013667339] [2022-12-14 11:43:22,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:22,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 11:43:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 11:43:22,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:43:22,714 INFO L87 Difference]: Start difference. First operand has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 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, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-12-14 11:43:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:23,004 INFO L93 Difference]: Finished difference Result 6072 states and 24528 transitions. [2022-12-14 11:43:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 11:43:23,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-12-14 11:43:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:23,075 INFO L225 Difference]: With dead ends: 6072 [2022-12-14 11:43:23,075 INFO L226 Difference]: Without dead ends: 6072 [2022-12-14 11:43:23,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:43:23,079 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:23,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2022-12-14 11:43:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 6072. [2022-12-14 11:43:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6072 states, 6067 states have (on average 4.042854788198451) internal successors, (24528), 6071 states have internal predecessors, (24528), 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) [2022-12-14 11:43:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6072 states to 6072 states and 24528 transitions. [2022-12-14 11:43:23,460 INFO L78 Accepts]: Start accepts. Automaton has 6072 states and 24528 transitions. Word has length 1 [2022-12-14 11:43:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:23,461 INFO L495 AbstractCegarLoop]: Abstraction has 6072 states and 24528 transitions. [2022-12-14 11:43:23,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-12-14 11:43:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6072 states and 24528 transitions. [2022-12-14 11:43:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:43:23,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:23,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:43:23,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-12-14 11:43:23,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:23,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:23,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash 598822366, now seen corresponding path program 1 times [2022-12-14 11:43:23,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:23,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645864491] [2022-12-14 11:43:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:23,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:23,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:23,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 11:43:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:23,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 11:43:23,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:23,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:23,766 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:23,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645864491] [2022-12-14 11:43:23,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645864491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:23,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:23,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:43:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110158498] [2022-12-14 11:43:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:23,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:43:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:43:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:43:23,770 INFO L87 Difference]: Start difference. First operand 6072 states and 24528 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-12-14 11:43:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:23,935 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-12-14 11:43:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:43:23,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-12-14 11:43:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:23,996 INFO L225 Difference]: With dead ends: 4962 [2022-12-14 11:43:23,996 INFO L226 Difference]: Without dead ends: 4812 [2022-12-14 11:43:23,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:43:23,998 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:23,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-12-14 11:43:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-12-14 11:43:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 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) [2022-12-14 11:43:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-12-14 11:43:24,196 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 5 [2022-12-14 11:43:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:24,197 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-12-14 11:43:24,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-12-14 11:43:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-12-14 11:43:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 11:43:24,200 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:24,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:24,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 11:43:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:24,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1727562644, now seen corresponding path program 1 times [2022-12-14 11:43:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:24,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208045380] [2022-12-14 11:43:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:24,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:24,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:24,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 11:43:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:24,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 11:43:24,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:24,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:24,619 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:24,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208045380] [2022-12-14 11:43:24,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208045380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:24,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:24,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:43:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577070425] [2022-12-14 11:43:24,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:43:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:24,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:43:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:43:24,621 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-12-14 11:43:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:24,829 INFO L93 Difference]: Finished difference Result 3962 states and 14045 transitions. [2022-12-14 11:43:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-12-14 11:43:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:24,851 INFO L225 Difference]: With dead ends: 3962 [2022-12-14 11:43:24,852 INFO L226 Difference]: Without dead ends: 3212 [2022-12-14 11:43:24,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:24,853 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:24,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 25 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-12-14 11:43:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2022-12-14 11:43:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3210 states have (on average 3.520249221183801) internal successors, (11300), 3211 states have internal predecessors, (11300), 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) [2022-12-14 11:43:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 11300 transitions. [2022-12-14 11:43:24,963 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 11300 transitions. Word has length 11 [2022-12-14 11:43:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:24,964 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 11300 transitions. [2022-12-14 11:43:24,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-12-14 11:43:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 11300 transitions. [2022-12-14 11:43:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 11:43:24,967 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:24,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:24,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 11:43:25,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:25,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 865681692, now seen corresponding path program 1 times [2022-12-14 11:43:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:25,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637155948] [2022-12-14 11:43:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:25,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:25,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:25,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:25,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 11:43:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:25,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:43:25,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:25,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:25,303 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:25,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637155948] [2022-12-14 11:43:25,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637155948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:25,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:25,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:43:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385895574] [2022-12-14 11:43:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:25,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:43:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:25,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:43:25,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:25,305 INFO L87 Difference]: Start difference. First operand 3212 states and 11300 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-12-14 11:43:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:25,492 INFO L93 Difference]: Finished difference Result 2122 states and 6669 transitions. [2022-12-14 11:43:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:43:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-12-14 11:43:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:25,501 INFO L225 Difference]: With dead ends: 2122 [2022-12-14 11:43:25,501 INFO L226 Difference]: Without dead ends: 1692 [2022-12-14 11:43:25,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:25,502 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 64 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:25,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 45 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-12-14 11:43:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2022-12-14 11:43:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 3.088757396449704) internal successors, (5220), 1691 states have internal predecessors, (5220), 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) [2022-12-14 11:43:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 5220 transitions. [2022-12-14 11:43:25,551 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 5220 transitions. Word has length 15 [2022-12-14 11:43:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:25,551 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 5220 transitions. [2022-12-14 11:43:25,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-12-14 11:43:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 5220 transitions. [2022-12-14 11:43:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:43:25,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:25,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:25,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 11:43:25,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:25,756 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:25,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1058594769, now seen corresponding path program 1 times [2022-12-14 11:43:25,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:25,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14301673] [2022-12-14 11:43:25,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:25,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:25,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:25,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:25,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 11:43:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:25,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 11:43:25,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:25,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:25,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:25,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14301673] [2022-12-14 11:43:25,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14301673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:25,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:25,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:43:25,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360071647] [2022-12-14 11:43:25,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:25,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:43:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:25,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:43:25,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:43:25,966 INFO L87 Difference]: Start difference. First operand 1692 states and 5220 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-12-14 11:43:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:26,196 INFO L93 Difference]: Finished difference Result 1278 states and 3941 transitions. [2022-12-14 11:43:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:43:26,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-12-14 11:43:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:26,201 INFO L225 Difference]: With dead ends: 1278 [2022-12-14 11:43:26,201 INFO L226 Difference]: Without dead ends: 1152 [2022-12-14 11:43:26,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:43:26,202 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 78 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:26,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 80 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-12-14 11:43:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-12-14 11:43:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.130434782608696) internal successors, (3600), 1151 states have internal predecessors, (3600), 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) [2022-12-14 11:43:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3600 transitions. [2022-12-14 11:43:26,219 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3600 transitions. Word has length 19 [2022-12-14 11:43:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:26,219 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3600 transitions. [2022-12-14 11:43:26,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-12-14 11:43:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3600 transitions. [2022-12-14 11:43:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:43:26,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:26,221 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:26,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 11:43:26,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:26,423 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:26,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:26,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1548074554, now seen corresponding path program 1 times [2022-12-14 11:43:26,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:26,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453389595] [2022-12-14 11:43:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:26,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:26,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:26,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:26,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 11:43:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:26,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 11:43:26,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:26,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:26,631 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:26,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453389595] [2022-12-14 11:43:26,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453389595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:26,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:26,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:43:26,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845904794] [2022-12-14 11:43:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:26,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:43:26,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:43:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:43:26,633 INFO L87 Difference]: Start difference. First operand 1152 states and 3600 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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) [2022-12-14 11:43:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:26,934 INFO L93 Difference]: Finished difference Result 1085 states and 3464 transitions. [2022-12-14 11:43:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:43:26,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2022-12-14 11:43:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:26,937 INFO L225 Difference]: With dead ends: 1085 [2022-12-14 11:43:26,937 INFO L226 Difference]: Without dead ends: 1067 [2022-12-14 11:43:26,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:43:26,938 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 73 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:26,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 120 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:43:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-12-14 11:43:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2022-12-14 11:43:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1065 states have (on average 3.220657276995305) internal successors, (3430), 1066 states have internal predecessors, (3430), 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) [2022-12-14 11:43:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3430 transitions. [2022-12-14 11:43:26,968 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3430 transitions. Word has length 23 [2022-12-14 11:43:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:26,968 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 3430 transitions. [2022-12-14 11:43:26,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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) [2022-12-14 11:43:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3430 transitions. [2022-12-14 11:43:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:26,970 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:26,971 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:26,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-12-14 11:43:27,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:27,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:27,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash 46974534, now seen corresponding path program 1 times [2022-12-14 11:43:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:27,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781836832] [2022-12-14 11:43:27,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:43:27,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:27,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:27,181 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:27,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 11:43:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:43:27,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:43:27,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:27,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:27,356 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:27,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781836832] [2022-12-14 11:43:27,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781836832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:27,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:27,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:43:27,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149042185] [2022-12-14 11:43:27,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:27,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:43:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:43:27,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:43:27,358 INFO L87 Difference]: Start difference. First operand 1067 states and 3430 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-12-14 11:43:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:27,509 INFO L93 Difference]: Finished difference Result 1371 states and 4339 transitions. [2022-12-14 11:43:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:43:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-12-14 11:43:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:27,514 INFO L225 Difference]: With dead ends: 1371 [2022-12-14 11:43:27,514 INFO L226 Difference]: Without dead ends: 1371 [2022-12-14 11:43:27,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:43:27,515 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:27,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 21 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:43:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-12-14 11:43:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2022-12-14 11:43:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1367 states have (on average 3.1733723482077543) internal successors, (4338), 1368 states have internal predecessors, (4338), 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) [2022-12-14 11:43:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 4338 transitions. [2022-12-14 11:43:27,538 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 4338 transitions. Word has length 28 [2022-12-14 11:43:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:27,539 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 4338 transitions. [2022-12-14 11:43:27,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-12-14 11:43:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 4338 transitions. [2022-12-14 11:43:27,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:27,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:27,541 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:27,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 11:43:27,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:27,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash -692601274, now seen corresponding path program 2 times [2022-12-14 11:43:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:27,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598716264] [2022-12-14 11:43:27,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:43:27,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:27,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:27,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 11:43:27,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 11:43:27,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:43:27,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 11:43:27,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:28,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:28,204 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:28,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598716264] [2022-12-14 11:43:28,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598716264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:28,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:28,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:43:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914027865] [2022-12-14 11:43:28,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:28,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:43:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:28,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:43:28,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:43:28,206 INFO L87 Difference]: Start difference. First operand 1369 states and 4338 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:28,456 INFO L93 Difference]: Finished difference Result 1819 states and 5601 transitions. [2022-12-14 11:43:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:28,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 28 [2022-12-14 11:43:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:28,462 INFO L225 Difference]: With dead ends: 1819 [2022-12-14 11:43:28,462 INFO L226 Difference]: Without dead ends: 1819 [2022-12-14 11:43:28,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:43:28,463 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:28,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 43 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-12-14 11:43:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1361. [2022-12-14 11:43:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1359 states have (on average 3.177336276674025) internal successors, (4318), 1360 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) [2022-12-14 11:43:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 4318 transitions. [2022-12-14 11:43:28,500 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 4318 transitions. Word has length 28 [2022-12-14 11:43:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:28,500 INFO L495 AbstractCegarLoop]: Abstraction has 1361 states and 4318 transitions. [2022-12-14 11:43:28,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 4318 transitions. [2022-12-14 11:43:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:28,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:28,504 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:28,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-14 11:43:28,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:28,706 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1846764216, now seen corresponding path program 3 times [2022-12-14 11:43:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:28,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733474624] [2022-12-14 11:43:28,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:43:28,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:28,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:28,732 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:28,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 11:43:28,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 11:43:28,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:43:28,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 11:43:28,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:29,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:29,285 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:29,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733474624] [2022-12-14 11:43:29,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733474624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:29,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:29,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:43:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396543931] [2022-12-14 11:43:29,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:29,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:43:29,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:29,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:43:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:43:29,287 INFO L87 Difference]: Start difference. First operand 1361 states and 4318 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:29,517 INFO L93 Difference]: Finished difference Result 1775 states and 5467 transitions. [2022-12-14 11:43:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 28 [2022-12-14 11:43:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:29,522 INFO L225 Difference]: With dead ends: 1775 [2022-12-14 11:43:29,523 INFO L226 Difference]: Without dead ends: 1775 [2022-12-14 11:43:29,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:43:29,523 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:29,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 43 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-12-14 11:43:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1357. [2022-12-14 11:43:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1355 states have (on average 3.177859778597786) internal successors, (4306), 1356 states have internal predecessors, (4306), 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) [2022-12-14 11:43:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 4306 transitions. [2022-12-14 11:43:29,557 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 4306 transitions. Word has length 28 [2022-12-14 11:43:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:29,558 INFO L495 AbstractCegarLoop]: Abstraction has 1357 states and 4306 transitions. [2022-12-14 11:43:29,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 4306 transitions. [2022-12-14 11:43:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:29,561 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:29,561 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:29,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 11:43:29,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:29,762 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1093606458, now seen corresponding path program 4 times [2022-12-14 11:43:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:29,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540360965] [2022-12-14 11:43:29,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:43:29,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:29,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:29,764 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:29,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 11:43:29,850 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:43:29,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:43:29,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 11:43:29,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:30,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:30,229 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:30,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540360965] [2022-12-14 11:43:30,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540360965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:30,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:30,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:43:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886318831] [2022-12-14 11:43:30,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:30,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:43:30,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:30,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:43:30,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:43:30,231 INFO L87 Difference]: Start difference. First operand 1357 states and 4306 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:30,450 INFO L93 Difference]: Finished difference Result 1765 states and 5436 transitions. [2022-12-14 11:43:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:30,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 28 [2022-12-14 11:43:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:30,455 INFO L225 Difference]: With dead ends: 1765 [2022-12-14 11:43:30,455 INFO L226 Difference]: Without dead ends: 1765 [2022-12-14 11:43:30,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:43:30,456 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:30,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 57 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-12-14 11:43:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1345. [2022-12-14 11:43:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1343 states have (on average 3.1794489947877884) internal successors, (4270), 1344 states have internal predecessors, (4270), 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) [2022-12-14 11:43:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 4270 transitions. [2022-12-14 11:43:30,486 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 4270 transitions. Word has length 28 [2022-12-14 11:43:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:30,486 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 4270 transitions. [2022-12-14 11:43:30,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 4270 transitions. [2022-12-14 11:43:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:30,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:30,489 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:30,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 11:43:30,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:30,691 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2142631352, now seen corresponding path program 5 times [2022-12-14 11:43:30,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:30,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59301856] [2022-12-14 11:43:30,695 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 11:43:30,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:30,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:30,699 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:30,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 11:43:30,794 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 11:43:30,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:43:30,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 11:43:30,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:43:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:43:31,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:43:31,243 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:43:31,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59301856] [2022-12-14 11:43:31,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59301856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:43:31,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:43:31,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:43:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578919048] [2022-12-14 11:43:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:43:31,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:43:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:43:31,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:43:31,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:43:31,244 INFO L87 Difference]: Start difference. First operand 1345 states and 4270 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:43:31,465 INFO L93 Difference]: Finished difference Result 1693 states and 5222 transitions. [2022-12-14 11:43:31,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:43:31,466 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 28 [2022-12-14 11:43:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:43:31,468 INFO L225 Difference]: With dead ends: 1693 [2022-12-14 11:43:31,469 INFO L226 Difference]: Without dead ends: 1693 [2022-12-14 11:43:31,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:43:31,469 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:43:31,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 48 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:43:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2022-12-14 11:43:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1339. [2022-12-14 11:43:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1337 states have (on average 3.1780104712041886) internal successors, (4249), 1338 states have internal predecessors, (4249), 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) [2022-12-14 11:43:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 4249 transitions. [2022-12-14 11:43:31,490 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 4249 transitions. Word has length 28 [2022-12-14 11:43:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:43:31,491 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 4249 transitions. [2022-12-14 11:43:31,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-12-14 11:43:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 4249 transitions. [2022-12-14 11:43:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:43:31,492 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:43:31,492 INFO L195 NwaCegarLoop]: 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] [2022-12-14 11:43:31,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 11:43:31,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:31,694 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-14 11:43:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:43:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash 612941950, now seen corresponding path program 6 times [2022-12-14 11:43:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:43:31,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665906855] [2022-12-14 11:43:31,696 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-14 11:43:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:43:31,699 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:43:31,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 11:43:31,834 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-14 11:43:31,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-14 11:43:31,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 11:43:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:43:31,974 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 11:43:31,975 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 11:43:31,975 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-14 11:43:31,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-14 11:43:31,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-14 11:43:31,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-14 11:43:31,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-14 11:43:31,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-14 11:43:31,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-14 11:43:31,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-14 11:43:31,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-14 11:43:31,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-14 11:43:31,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-14 11:43:31,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-14 11:43:31,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-14 11:43:31,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-14 11:43:31,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-14 11:43:31,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-14 11:43:31,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-14 11:43:32,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:43:32,185 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2022-12-14 11:43:32,199 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 11:43:32,199 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:43:32,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:43:32 BasicIcfg [2022-12-14 11:43:32,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:43:32,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:43:32,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:43:32,281 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:43:32,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:14" (3/4) ... [2022-12-14 11:43:32,284 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 11:43:32,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:43:32,285 INFO L158 Benchmark]: Toolchain (without parser) took 19218.08ms. Allocated memory was 69.2MB in the beginning and 710.9MB in the end (delta: 641.7MB). Free memory was 42.5MB in the beginning and 557.8MB in the end (delta: -515.3MB). Peak memory consumption was 125.5MB. Max. memory is 16.1GB. [2022-12-14 11:43:32,285 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:43:32,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.90ms. Allocated memory is still 69.2MB. Free memory was 42.2MB in the beginning and 44.8MB in the end (delta: -2.6MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-12-14 11:43:32,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.26ms. Allocated memory is still 69.2MB. Free memory was 44.8MB in the beginning and 41.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:43:32,286 INFO L158 Benchmark]: Boogie Preprocessor took 26.13ms. Allocated memory is still 69.2MB. Free memory was 41.9MB in the beginning and 39.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:43:32,286 INFO L158 Benchmark]: RCFGBuilder took 637.61ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 39.7MB in the beginning and 59.1MB in the end (delta: -19.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-12-14 11:43:32,287 INFO L158 Benchmark]: TraceAbstraction took 18085.25ms. Allocated memory was 83.9MB in the beginning and 710.9MB in the end (delta: 627.0MB). Free memory was 58.6MB in the beginning and 557.8MB in the end (delta: -499.2MB). Peak memory consumption was 544.9MB. Max. memory is 16.1GB. [2022-12-14 11:43:32,287 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 710.9MB. Free memory is still 557.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:43:32,288 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.14ms. Allocated memory is still 54.5MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.90ms. Allocated memory is still 69.2MB. Free memory was 42.2MB in the beginning and 44.8MB in the end (delta: -2.6MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.26ms. Allocated memory is still 69.2MB. Free memory was 44.8MB in the beginning and 41.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.13ms. Allocated memory is still 69.2MB. Free memory was 41.9MB in the beginning and 39.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 637.61ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 39.7MB in the beginning and 59.1MB in the end (delta: -19.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18085.25ms. Allocated memory was 83.9MB in the beginning and 710.9MB in the end (delta: 627.0MB). Free memory was 58.6MB in the beginning and 557.8MB in the end (delta: -499.2MB). Peak memory consumption was 544.9MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 710.9MB. Free memory is still 557.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 163 PlacesBefore, 57 PlacesAfterwards, 152 TransitionsBefore, 45 TransitionsAfterwards, 3866 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 10967 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5125, independent: 4887, independent conditional: 0, independent unconditional: 4887, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2619, independent: 2526, independent conditional: 0, independent unconditional: 2526, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2619, independent: 2488, independent conditional: 0, independent unconditional: 2488, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 131, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 436, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 394, dependent conditional: 0, dependent unconditional: 394, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5125, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 2619, unknown conditional: 0, unknown unconditional: 2619] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 314, Positive conditional cache size: 0, Positive unconditional cache size: 314, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-1, t1185={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=0, t1185={11:0}, t1186={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=1, t1185={11:0}, t1186={15:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=2, t1185={11:0}, t1186={15:0}, t1187={7:0}, t1188={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={11:0}, t1186={15:0}, t1187={7:0}, t1188={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 497 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 139 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6444occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 1652 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 2379 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1779 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 [2022-12-14 11:43:32,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c371c076-7372-46c4-9fbe-fb934eaf81cb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample