./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_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_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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_7f60a969-b0bc-44a7-862f-7fad51016a14/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 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --- 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 14:52:10,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:52:10,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:52:10,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:52:10,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:52:10,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:52:10,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:52:10,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:52:10,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:52:10,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:52:10,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:52:10,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:52:10,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:52:10,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:52:10,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:52:10,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:52:10,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:52:10,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:52:10,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:52:10,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:52:10,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:52:10,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:52:10,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:52:10,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:52:10,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:52:10,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:52:10,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:52:10,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:52:10,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:52:10,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:52:10,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:52:10,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:52:10,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:52:10,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:52:10,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:52:10,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:52:10,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:52:10,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:52:10,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:52:10,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:52:10,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:52:10,073 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 14:52:10,094 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:52:10,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:52:10,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:52:10,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:52:10,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:52:10,114 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:52:10,114 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:52:10,114 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:52:10,114 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:52:10,114 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:52:10,114 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:52:10,114 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:52:10,115 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:52:10,115 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:52:10,115 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:52:10,115 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:52:10,115 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:52:10,115 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:52:10,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 14:52:10,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 14:52:10,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:52:10,116 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:52:10,116 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:52:10,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:52:10,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:52:10,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:52:10,117 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 14:52:10,117 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 14:52:10,117 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 14:52:10,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:52:10,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 14:52:10,117 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:52:10,117 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:52:10,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:52:10,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:52:10,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:52:10,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:52:10,118 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:52:10,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:52:10,118 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:52:10,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:52:10,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:52:10,119 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_7f60a969-b0bc-44a7-862f-7fad51016a14/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_7f60a969-b0bc-44a7-862f-7fad51016a14/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 -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 [2022-12-14 14:52:10,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:52:10,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:52:10,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:52:10,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:52:10,317 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:52:10,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2022-12-14 14:52:12,878 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:52:13,077 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:52:13,078 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2022-12-14 14:52:13,086 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/data/c6f294414/aecc8584b56648d8b2c3d34691ca63de/FLAG917503629 [2022-12-14 14:52:13,458 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/data/c6f294414/aecc8584b56648d8b2c3d34691ca63de [2022-12-14 14:52:13,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:52:13,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:52:13,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:52:13,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:52:13,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:52:13,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68700fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13, skipping insertion in model container [2022-12-14 14:52:13,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:52:13,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:52:13,640 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_7f60a969-b0bc-44a7-862f-7fad51016a14/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2022-12-14 14:52:13,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:52:13,793 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:52:13,803 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_7f60a969-b0bc-44a7-862f-7fad51016a14/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2022-12-14 14:52:13,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:13,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:13,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:52:13,882 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:52:13,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13 WrapperNode [2022-12-14 14:52:13,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:52:13,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:52:13,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:52:13,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:52:13,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,926 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-14 14:52:13,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:52:13,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:52:13,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:52:13,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:52:13,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,952 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:52:13,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:52:13,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:52:13,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:52:13,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (1/1) ... [2022-12-14 14:52:13,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:52:13,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:52:13,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:52:13,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:52:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:52:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 14:52:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:52:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:52:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:52:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 14:52:14,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 14:52:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 14:52:14,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 14:52:14,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 14:52:14,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 14:52:14,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:52:14,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 14:52:14,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:52:14,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:52:14,026 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 14:52:14,119 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:52:14,121 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:52:14,359 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:52:14,486 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:52:14,486 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 14:52:14,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:14 BoogieIcfgContainer [2022-12-14 14:52:14,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:52:14,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:52:14,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:52:14,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:52:14,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:52:13" (1/3) ... [2022-12-14 14:52:14,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e83389b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:52:14, skipping insertion in model container [2022-12-14 14:52:14,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:13" (2/3) ... [2022-12-14 14:52:14,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e83389b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:52:14, skipping insertion in model container [2022-12-14 14:52:14,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:14" (3/3) ... [2022-12-14 14:52:14,495 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2022-12-14 14:52:14,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:52:14,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-14 14:52:14,509 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 14:52:14,549 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 14:52:14,573 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:52:14,584 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 265 flow [2022-12-14 14:52:14,586 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 265 flow [2022-12-14 14:52:14,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-14 14:52:14,626 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-14 14:52:14,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 14:52:14,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-14 14:52:14,632 INFO L119 LiptonReduction]: Number of co-enabled transitions 2302 [2022-12-14 14:52:19,059 INFO L134 LiptonReduction]: Checked pairs total: 6466 [2022-12-14 14:52:19,059 INFO L136 LiptonReduction]: Total number of compositions: 127 [2022-12-14 14:52:19,066 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-12-14 14:52:19,132 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1094 states, 1081 states have (on average 3.3311748381128585) internal successors, (3601), 1093 states have internal predecessors, (3601), 0 states have call successors, (0), 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 14:52:19,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:52:19,153 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;@70d402bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:52:19,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-14 14:52:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 1094 states, 1081 states have (on average 3.3311748381128585) internal successors, (3601), 1093 states have internal predecessors, (3601), 0 states have call successors, (0), 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 14:52:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 14:52:19,160 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:19,160 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 14:52:19,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash 543, now seen corresponding path program 1 times [2022-12-14 14:52:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:19,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508098992] [2022-12-14 14:52:19,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:19,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:19,248 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 14:52:19,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:19,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508098992] [2022-12-14 14:52:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508098992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:19,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:19,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 14:52:19,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951321497] [2022-12-14 14:52:19,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:19,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 14:52:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:19,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 14:52:19,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:52:19,274 INFO L87 Difference]: Start difference. First operand has 1094 states, 1081 states have (on average 3.3311748381128585) internal successors, (3601), 1093 states have internal predecessors, (3601), 0 states have call successors, (0), 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 14:52:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:19,346 INFO L93 Difference]: Finished difference Result 1022 states and 3273 transitions. [2022-12-14 14:52:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 14:52:19,348 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 14:52:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:19,362 INFO L225 Difference]: With dead ends: 1022 [2022-12-14 14:52:19,362 INFO L226 Difference]: Without dead ends: 1022 [2022-12-14 14:52:19,363 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 14:52:19,365 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:19,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:52:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-12-14 14:52:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2022-12-14 14:52:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1017 states have (on average 3.218289085545723) internal successors, (3273), 1021 states have internal predecessors, (3273), 0 states have call successors, (0), 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 14:52:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3273 transitions. [2022-12-14 14:52:19,438 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 3273 transitions. Word has length 1 [2022-12-14 14:52:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:19,439 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 3273 transitions. [2022-12-14 14:52:19,439 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 14:52:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 3273 transitions. [2022-12-14 14:52:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:52:19,439 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:19,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:52:19,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:52:19,440 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 514373166, now seen corresponding path program 1 times [2022-12-14 14:52:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:19,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373969194] [2022-12-14 14:52:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:19,623 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 14:52:19,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:19,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373969194] [2022-12-14 14:52:19,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373969194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:19,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:19,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:52:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931167782] [2022-12-14 14:52:19,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:19,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:52:19,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:19,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:52:19,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:52:19,627 INFO L87 Difference]: Start difference. First operand 1022 states and 3273 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 14:52:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:19,698 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-12-14 14:52:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:52:19,698 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 14:52:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:19,702 INFO L225 Difference]: With dead ends: 837 [2022-12-14 14:52:19,702 INFO L226 Difference]: Without dead ends: 812 [2022-12-14 14:52:19,702 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 14:52:19,703 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:19,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-12-14 14:52:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-12-14 14:52:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 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 14:52:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-12-14 14:52:19,723 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2022-12-14 14:52:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:19,723 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-12-14 14:52:19,723 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 14:52:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-12-14 14:52:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 14:52:19,724 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:19,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:19,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:52:19,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1788054870, now seen corresponding path program 1 times [2022-12-14 14:52:19,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:19,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475724010] [2022-12-14 14:52:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:19,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:20,072 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 14:52:20,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:20,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475724010] [2022-12-14 14:52:20,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475724010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:20,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:20,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:52:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567629788] [2022-12-14 14:52:20,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:20,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:52:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:20,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:52:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:52:20,074 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 14:52:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:20,161 INFO L93 Difference]: Finished difference Result 802 states and 2537 transitions. [2022-12-14 14:52:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:52:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 14:52:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:20,165 INFO L225 Difference]: With dead ends: 802 [2022-12-14 14:52:20,165 INFO L226 Difference]: Without dead ends: 802 [2022-12-14 14:52:20,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:52:20,166 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:20,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-12-14 14:52:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2022-12-14 14:52:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 800 states have (on average 3.17125) internal successors, (2537), 801 states have internal predecessors, (2537), 0 states have call successors, (0), 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 14:52:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2537 transitions. [2022-12-14 14:52:20,185 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 2537 transitions. Word has length 9 [2022-12-14 14:52:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:20,185 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 2537 transitions. [2022-12-14 14:52:20,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 14:52:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 2537 transitions. [2022-12-14 14:52:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:52:20,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:20,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:20,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:52:20,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash -946567464, now seen corresponding path program 1 times [2022-12-14 14:52:20,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:20,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102110185] [2022-12-14 14:52:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:20,790 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 14:52:20,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102110185] [2022-12-14 14:52:20,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102110185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:20,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:20,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:52:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132414965] [2022-12-14 14:52:20,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:20,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:52:20,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:20,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:52:20,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:52:20,793 INFO L87 Difference]: Start difference. First operand 802 states and 2537 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 14:52:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:20,924 INFO L93 Difference]: Finished difference Result 876 states and 2811 transitions. [2022-12-14 14:52:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 14:52:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:20,928 INFO L225 Difference]: With dead ends: 876 [2022-12-14 14:52:20,928 INFO L226 Difference]: Without dead ends: 876 [2022-12-14 14:52:20,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:52:20,929 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:20,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-12-14 14:52:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 836. [2022-12-14 14:52:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 834 states have (on average 3.2002398081534773) internal successors, (2669), 835 states have internal predecessors, (2669), 0 states have call successors, (0), 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 14:52:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2669 transitions. [2022-12-14 14:52:20,948 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 2669 transitions. Word has length 10 [2022-12-14 14:52:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:20,949 INFO L495 AbstractCegarLoop]: Abstraction has 836 states and 2669 transitions. [2022-12-14 14:52:20,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 14:52:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 2669 transitions. [2022-12-14 14:52:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:52:20,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:20,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:20,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:52:20,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:20,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:20,951 INFO L85 PathProgramCache]: Analyzing trace with hash 404872266, now seen corresponding path program 2 times [2022-12-14 14:52:20,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:20,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713282715] [2022-12-14 14:52:20,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:20,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:21,266 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 14:52:21,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:21,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713282715] [2022-12-14 14:52:21,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713282715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:21,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:21,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:52:21,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698898709] [2022-12-14 14:52:21,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:21,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:52:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:52:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:52:21,269 INFO L87 Difference]: Start difference. First operand 836 states and 2669 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 14:52:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:21,395 INFO L93 Difference]: Finished difference Result 864 states and 2753 transitions. [2022-12-14 14:52:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:52:21,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 14:52:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:21,401 INFO L225 Difference]: With dead ends: 864 [2022-12-14 14:52:21,401 INFO L226 Difference]: Without dead ends: 864 [2022-12-14 14:52:21,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:21,402 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:21,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-12-14 14:52:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 848. [2022-12-14 14:52:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 3.1973995271867612) internal successors, (2705), 847 states have internal predecessors, (2705), 0 states have call successors, (0), 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 14:52:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 2705 transitions. [2022-12-14 14:52:21,430 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 2705 transitions. Word has length 10 [2022-12-14 14:52:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:21,431 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 2705 transitions. [2022-12-14 14:52:21,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 14:52:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 2705 transitions. [2022-12-14 14:52:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:52:21,431 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:21,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:21,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:52:21,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 404874743, now seen corresponding path program 1 times [2022-12-14 14:52:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:21,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495639627] [2022-12-14 14:52:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:21,709 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 14:52:21,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:21,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495639627] [2022-12-14 14:52:21,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495639627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:21,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:21,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:52:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548270721] [2022-12-14 14:52:21,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:21,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:52:21,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:21,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:52:21,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:21,711 INFO L87 Difference]: Start difference. First operand 848 states and 2705 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 14:52:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:21,845 INFO L93 Difference]: Finished difference Result 723 states and 2280 transitions. [2022-12-14 14:52:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:52:21,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 14:52:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:21,849 INFO L225 Difference]: With dead ends: 723 [2022-12-14 14:52:21,849 INFO L226 Difference]: Without dead ends: 598 [2022-12-14 14:52:21,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:21,850 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:21,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 36 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-12-14 14:52:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-12-14 14:52:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 3.063651591289782) internal successors, (1829), 597 states have internal predecessors, (1829), 0 states have call successors, (0), 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 14:52:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1829 transitions. [2022-12-14 14:52:21,870 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1829 transitions. Word has length 10 [2022-12-14 14:52:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:21,871 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 1829 transitions. [2022-12-14 14:52:21,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 14:52:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1829 transitions. [2022-12-14 14:52:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:52:21,872 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:21,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:21,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:52:21,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 773756037, now seen corresponding path program 1 times [2022-12-14 14:52:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:21,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911056753] [2022-12-14 14:52:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:22,233 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 14:52:22,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911056753] [2022-12-14 14:52:22,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911056753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:22,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:22,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:52:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497366468] [2022-12-14 14:52:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:22,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:52:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:52:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:52:22,236 INFO L87 Difference]: Start difference. First operand 598 states and 1829 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 14:52:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:22,371 INFO L93 Difference]: Finished difference Result 613 states and 1866 transitions. [2022-12-14 14:52:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:22,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 14:52:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:22,375 INFO L225 Difference]: With dead ends: 613 [2022-12-14 14:52:22,375 INFO L226 Difference]: Without dead ends: 613 [2022-12-14 14:52:22,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:22,376 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:22,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-12-14 14:52:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 607. [2022-12-14 14:52:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 3.047854785478548) internal successors, (1847), 606 states have internal predecessors, (1847), 0 states have call successors, (0), 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 14:52:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1847 transitions. [2022-12-14 14:52:22,394 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1847 transitions. Word has length 11 [2022-12-14 14:52:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:22,394 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 1847 transitions. [2022-12-14 14:52:22,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 14:52:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1847 transitions. [2022-12-14 14:52:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:52:22,396 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:22,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:22,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:52:22,396 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1160159325, now seen corresponding path program 1 times [2022-12-14 14:52:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:22,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700919094] [2022-12-14 14:52:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:22,827 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 14:52:22,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:22,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700919094] [2022-12-14 14:52:22,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700919094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:22,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:22,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:52:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975180663] [2022-12-14 14:52:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:22,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:52:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:22,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:52:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:22,830 INFO L87 Difference]: Start difference. First operand 607 states and 1847 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 14:52:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:22,981 INFO L93 Difference]: Finished difference Result 634 states and 1931 transitions. [2022-12-14 14:52:22,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:22,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 14:52:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:22,985 INFO L225 Difference]: With dead ends: 634 [2022-12-14 14:52:22,985 INFO L226 Difference]: Without dead ends: 634 [2022-12-14 14:52:22,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:22,986 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:22,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 21 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-12-14 14:52:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 612. [2022-12-14 14:52:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 3.0327332242225857) internal successors, (1853), 611 states have internal predecessors, (1853), 0 states have call successors, (0), 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 14:52:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1853 transitions. [2022-12-14 14:52:23,011 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1853 transitions. Word has length 12 [2022-12-14 14:52:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:23,011 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 1853 transitions. [2022-12-14 14:52:23,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 14:52:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1853 transitions. [2022-12-14 14:52:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:52:23,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:23,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:23,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:52:23,013 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:23,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1783368241, now seen corresponding path program 2 times [2022-12-14 14:52:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:23,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965264072] [2022-12-14 14:52:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:23,479 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 14:52:23,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:23,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965264072] [2022-12-14 14:52:23,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965264072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:23,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:23,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:52:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541890506] [2022-12-14 14:52:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:23,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:52:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:23,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:52:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:23,481 INFO L87 Difference]: Start difference. First operand 612 states and 1853 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 14:52:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:23,590 INFO L93 Difference]: Finished difference Result 668 states and 2004 transitions. [2022-12-14 14:52:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 14:52:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:23,594 INFO L225 Difference]: With dead ends: 668 [2022-12-14 14:52:23,594 INFO L226 Difference]: Without dead ends: 668 [2022-12-14 14:52:23,594 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 14:52:23,595 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:23,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 7 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-12-14 14:52:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 619. [2022-12-14 14:52:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 3.017799352750809) internal successors, (1865), 618 states have internal predecessors, (1865), 0 states have call successors, (0), 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 14:52:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1865 transitions. [2022-12-14 14:52:23,613 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 1865 transitions. Word has length 12 [2022-12-14 14:52:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:23,613 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 1865 transitions. [2022-12-14 14:52:23,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 14:52:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1865 transitions. [2022-12-14 14:52:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:52:23,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:23,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:23,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:52:23,615 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash -66050857, now seen corresponding path program 1 times [2022-12-14 14:52:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:23,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483713894] [2022-12-14 14:52:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:23,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:23,768 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 14:52:23,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:23,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483713894] [2022-12-14 14:52:23,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483713894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:23,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:23,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:52:23,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262818713] [2022-12-14 14:52:23,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:23,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:52:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:52:23,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:52:23,770 INFO L87 Difference]: Start difference. First operand 619 states and 1865 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 14:52:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:23,847 INFO L93 Difference]: Finished difference Result 588 states and 1569 transitions. [2022-12-14 14:52:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:23,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 14:52:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:23,849 INFO L225 Difference]: With dead ends: 588 [2022-12-14 14:52:23,850 INFO L226 Difference]: Without dead ends: 433 [2022-12-14 14:52:23,850 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 14:52:23,850 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:23,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-12-14 14:52:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2022-12-14 14:52:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.5949074074074074) internal successors, (1121), 432 states have internal predecessors, (1121), 0 states have call successors, (0), 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 14:52:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1121 transitions. [2022-12-14 14:52:23,857 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1121 transitions. Word has length 12 [2022-12-14 14:52:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:23,857 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 1121 transitions. [2022-12-14 14:52:23,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 14:52:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1121 transitions. [2022-12-14 14:52:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:52:23,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:23,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:23,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 14:52:23,859 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:23,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1697565615, now seen corresponding path program 1 times [2022-12-14 14:52:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:23,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407337629] [2022-12-14 14:52:23,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:23,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:23,966 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 14:52:23,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:23,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407337629] [2022-12-14 14:52:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407337629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:23,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:52:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87972449] [2022-12-14 14:52:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:23,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:52:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:52:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:52:23,968 INFO L87 Difference]: Start difference. First operand 433 states and 1121 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 14:52:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:24,077 INFO L93 Difference]: Finished difference Result 342 states and 817 transitions. [2022-12-14 14:52:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:52:24,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-12-14 14:52:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:24,079 INFO L225 Difference]: With dead ends: 342 [2022-12-14 14:52:24,079 INFO L226 Difference]: Without dead ends: 264 [2022-12-14 14:52:24,079 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 14:52:24,080 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:24,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 21 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-12-14 14:52:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2022-12-14 14:52:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 2.3179916317991633) internal successors, (554), 239 states have internal predecessors, (554), 0 states have call successors, (0), 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 14:52:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 554 transitions. [2022-12-14 14:52:24,086 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 554 transitions. Word has length 13 [2022-12-14 14:52:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:24,087 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 554 transitions. [2022-12-14 14:52:24,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 14:52:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 554 transitions. [2022-12-14 14:52:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 14:52:24,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:24,088 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 14:52:24,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 14:52:24,088 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash 16960894, now seen corresponding path program 1 times [2022-12-14 14:52:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:24,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181778262] [2022-12-14 14:52:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:24,222 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 14:52:24,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:24,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181778262] [2022-12-14 14:52:24,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181778262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:24,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:24,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:52:24,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063463779] [2022-12-14 14:52:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:24,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:52:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:24,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:52:24,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:24,224 INFO L87 Difference]: Start difference. First operand 240 states and 554 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 14:52:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:24,334 INFO L93 Difference]: Finished difference Result 215 states and 502 transitions. [2022-12-14 14:52:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:52:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 14:52:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:24,336 INFO L225 Difference]: With dead ends: 215 [2022-12-14 14:52:24,336 INFO L226 Difference]: Without dead ends: 200 [2022-12-14 14:52:24,336 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 14:52:24,337 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:24,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 21 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-12-14 14:52:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2022-12-14 14:52:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.3968253968253967) internal successors, (453), 189 states have internal predecessors, (453), 0 states have call successors, (0), 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 14:52:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 453 transitions. [2022-12-14 14:52:24,340 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 453 transitions. Word has length 17 [2022-12-14 14:52:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:24,340 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 453 transitions. [2022-12-14 14:52:24,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 14:52:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 453 transitions. [2022-12-14 14:52:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:24,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:24,341 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] [2022-12-14 14:52:24,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 14:52:24,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1054054745, now seen corresponding path program 1 times [2022-12-14 14:52:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:24,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564959585] [2022-12-14 14:52:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:24,556 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 14:52:24,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:24,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564959585] [2022-12-14 14:52:24,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564959585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:24,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:24,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:52:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66374474] [2022-12-14 14:52:24,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:24,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:52:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:52:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:52:24,558 INFO L87 Difference]: Start difference. First operand 190 states and 453 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:24,715 INFO L93 Difference]: Finished difference Result 252 states and 588 transitions. [2022-12-14 14:52:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:52:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 14:52:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:24,716 INFO L225 Difference]: With dead ends: 252 [2022-12-14 14:52:24,716 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 14:52:24,716 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 14:52:24,717 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:24,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 10 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 14:52:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-12-14 14:52:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.108910891089109) internal successors, (213), 101 states have internal predecessors, (213), 0 states have call successors, (0), 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 14:52:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 213 transitions. [2022-12-14 14:52:24,719 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 213 transitions. Word has length 21 [2022-12-14 14:52:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:24,719 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 213 transitions. [2022-12-14 14:52:24,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 213 transitions. [2022-12-14 14:52:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:24,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:24,720 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] [2022-12-14 14:52:24,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 14:52:24,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash -191256027, now seen corresponding path program 2 times [2022-12-14 14:52:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:24,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826557232] [2022-12-14 14:52:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:25,188 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 14:52:25,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:25,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826557232] [2022-12-14 14:52:25,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826557232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:25,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:25,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:52:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278073850] [2022-12-14 14:52:25,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:25,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:52:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:25,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:52:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:52:25,190 INFO L87 Difference]: Start difference. First operand 102 states and 213 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:25,290 INFO L93 Difference]: Finished difference Result 128 states and 261 transitions. [2022-12-14 14:52:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:25,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 14:52:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:25,291 INFO L225 Difference]: With dead ends: 128 [2022-12-14 14:52:25,292 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 14:52:25,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:52:25,292 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:25,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 16 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 14:52:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2022-12-14 14:52:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.032258064516129) internal successors, (189), 93 states have internal predecessors, (189), 0 states have call successors, (0), 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 14:52:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 189 transitions. [2022-12-14 14:52:25,294 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 189 transitions. Word has length 21 [2022-12-14 14:52:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:25,295 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 189 transitions. [2022-12-14 14:52:25,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 189 transitions. [2022-12-14 14:52:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:25,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:25,295 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] [2022-12-14 14:52:25,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 14:52:25,296 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash -991260603, now seen corresponding path program 3 times [2022-12-14 14:52:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:25,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948954621] [2022-12-14 14:52:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:25,890 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 14:52:25,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:52:25,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948954621] [2022-12-14 14:52:25,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948954621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:25,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:25,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:52:25,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277349391] [2022-12-14 14:52:25,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:52:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:52:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:52:25,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:52:25,891 INFO L87 Difference]: Start difference. First operand 94 states and 189 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:25,978 INFO L93 Difference]: Finished difference Result 114 states and 224 transitions. [2022-12-14 14:52:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:25,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 14:52:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:25,980 INFO L225 Difference]: With dead ends: 114 [2022-12-14 14:52:25,980 INFO L226 Difference]: Without dead ends: 82 [2022-12-14 14:52:25,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:52:25,980 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:25,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 13 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-14 14:52:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-12-14 14:52:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.037037037037037) internal successors, (165), 81 states have internal predecessors, (165), 0 states have call successors, (0), 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 14:52:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 165 transitions. [2022-12-14 14:52:25,982 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 165 transitions. Word has length 21 [2022-12-14 14:52:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:25,982 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 165 transitions. [2022-12-14 14:52:25,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 165 transitions. [2022-12-14 14:52:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:25,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:25,983 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] [2022-12-14 14:52:25,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 14:52:25,983 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash -848105203, now seen corresponding path program 4 times [2022-12-14 14:52:25,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:52:25,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433619977] [2022-12-14 14:52:25,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:52:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:52:26,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 14:52:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:52:26,044 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 14:52:26,045 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 14:52:26,045 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-14 14:52:26,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-14 14:52:26,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-14 14:52:26,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-14 14:52:26,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-14 14:52:26,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-14 14:52:26,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-14 14:52:26,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-14 14:52:26,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-14 14:52:26,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-14 14:52:26,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-14 14:52:26,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-14 14:52:26,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-14 14:52:26,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 14:52:26,050 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:26,054 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 14:52:26,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 14:52:26,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:52:26 BasicIcfg [2022-12-14 14:52:26,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 14:52:26,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 14:52:26,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 14:52:26,089 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 14:52:26,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:14" (3/4) ... [2022-12-14 14:52:26,092 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 14:52:26,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 14:52:26,092 INFO L158 Benchmark]: Toolchain (without parser) took 12628.78ms. Allocated memory was 144.7MB in the beginning and 287.3MB in the end (delta: 142.6MB). Free memory was 108.6MB in the beginning and 203.8MB in the end (delta: -95.1MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2022-12-14 14:52:26,092 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 14:52:26,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.83ms. Allocated memory is still 144.7MB. Free memory was 108.2MB in the beginning and 82.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-14 14:52:26,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.65ms. Allocated memory is still 144.7MB. Free memory was 82.0MB in the beginning and 79.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 14:52:26,093 INFO L158 Benchmark]: Boogie Preprocessor took 29.47ms. Allocated memory is still 144.7MB. Free memory was 79.3MB in the beginning and 77.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 14:52:26,093 INFO L158 Benchmark]: RCFGBuilder took 530.41ms. Allocated memory was 144.7MB in the beginning and 239.1MB in the end (delta: 94.4MB). Free memory was 77.2MB in the beginning and 200.2MB in the end (delta: -123.0MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-12-14 14:52:26,093 INFO L158 Benchmark]: TraceAbstraction took 11598.54ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 199.1MB in the beginning and 203.8MB in the end (delta: -4.6MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2022-12-14 14:52:26,093 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 287.3MB. Free memory is still 203.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 14:52:26,094 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.13ms. Allocated memory is still 144.7MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.83ms. Allocated memory is still 144.7MB. Free memory was 108.2MB in the beginning and 82.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.65ms. Allocated memory is still 144.7MB. Free memory was 82.0MB in the beginning and 79.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.47ms. Allocated memory is still 144.7MB. Free memory was 79.3MB in the beginning and 77.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 530.41ms. Allocated memory was 144.7MB in the beginning and 239.1MB in the end (delta: 94.4MB). Free memory was 77.2MB in the beginning and 200.2MB in the end (delta: -123.0MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11598.54ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 199.1MB in the beginning and 203.8MB in the end (delta: -4.6MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 287.3MB. Free memory is still 203.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: 4.5s, 133 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 35 TransitionsAfterwards, 2302 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 6466 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3238, independent: 3055, independent conditional: 0, independent unconditional: 3055, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1737, independent: 1675, independent conditional: 0, independent unconditional: 1675, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1737, independent: 1642, independent conditional: 0, independent unconditional: 1642, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 373, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 347, dependent conditional: 0, dependent unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3238, independent: 1380, independent conditional: 0, independent unconditional: 1380, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1737, unknown conditional: 0, unknown unconditional: 1737] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-2, t1403={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-1, t1403={5:0}, t1404={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=0, t1403={5:0}, t1404={6:0}, t1405={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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L798] 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) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L749] 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) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 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 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 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) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 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) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 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)) [L847] 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)) [L848] 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)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] - 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: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 821]: 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: 823]: 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 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 402 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 402 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 75 mSDtfsCounter, 1300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1094occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 179 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 14:52:26,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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_7f60a969-b0bc-44a7-862f-7fad51016a14/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 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --- 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 14:52:27,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:52:27,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:52:27,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:52:27,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:52:27,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:52:27,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:52:27,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:52:27,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:52:27,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:52:27,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:52:27,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:52:27,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:52:27,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:52:27,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:52:27,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:52:27,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:52:27,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:52:27,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:52:27,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:52:27,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:52:27,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:52:27,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:52:27,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:52:27,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:52:27,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:52:27,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:52:27,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:52:27,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:52:27,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:52:27,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:52:27,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:52:27,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:52:27,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:52:27,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:52:27,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:52:27,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:52:27,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:52:27,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:52:27,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:52:27,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:52:27,911 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 14:52:27,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:52:27,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:52:27,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:52:27,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:52:27,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:52:27,935 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:52:27,935 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:52:27,935 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:52:27,935 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:52:27,935 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:52:27,936 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:52:27,936 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:52:27,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 14:52:27,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 14:52:27,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:52:27,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:52:27,937 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:52:27,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:52:27,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:52:27,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:52:27,937 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 14:52:27,938 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 14:52:27,938 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 14:52:27,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:52:27,938 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 14:52:27,938 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 14:52:27,938 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 14:52:27,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:52:27,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:52:27,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:52:27,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 14:52:27,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:52:27,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:52:27,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:52:27,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:52:27,939 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 14:52:27,939 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 14:52:27,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:52:27,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 14:52:27,940 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_7f60a969-b0bc-44a7-862f-7fad51016a14/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_7f60a969-b0bc-44a7-862f-7fad51016a14/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 -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 [2022-12-14 14:52:28,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:52:28,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:52:28,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:52:28,197 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:52:28,197 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:52:28,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2022-12-14 14:52:30,699 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:52:30,901 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:52:30,901 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2022-12-14 14:52:30,910 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/data/c2cb30e78/c242df320d214c88a43223e9ec9a239f/FLAG27d1e7553 [2022-12-14 14:52:30,924 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/data/c2cb30e78/c242df320d214c88a43223e9ec9a239f [2022-12-14 14:52:30,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:52:30,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:52:30,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:52:30,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:52:30,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:52:30,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:52:30" (1/1) ... [2022-12-14 14:52:30,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6621a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:30, skipping insertion in model container [2022-12-14 14:52:30,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:52:30" (1/1) ... [2022-12-14 14:52:30,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:52:30,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:52:31,131 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_7f60a969-b0bc-44a7-862f-7fad51016a14/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2022-12-14 14:52:31,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:52:31,345 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:52:31,357 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_7f60a969-b0bc-44a7-862f-7fad51016a14/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i[949,962] [2022-12-14 14:52:31,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 14:52:31,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 14:52:31,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:52:31,448 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:52:31,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31 WrapperNode [2022-12-14 14:52:31,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:52:31,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:52:31,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:52:31,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:52:31,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,498 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-14 14:52:31,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:52:31,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:52:31,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:52:31,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:52:31,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,524 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:52:31,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:52:31,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:52:31,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:52:31,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (1/1) ... [2022-12-14 14:52:31,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:52:31,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:52:31,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:52:31,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:52:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 14:52:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 14:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 14:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 14:52:31,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 14:52:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 14:52:31,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 14:52:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 14:52:31,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 14:52:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 14:52:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:52:31,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:52:31,595 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 14:52:31,717 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:52:31,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:52:32,007 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:52:32,143 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:52:32,143 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 14:52:32,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:32 BoogieIcfgContainer [2022-12-14 14:52:32,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:52:32,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:52:32,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:52:32,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:52:32,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:52:30" (1/3) ... [2022-12-14 14:52:32,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c7a951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:52:32, skipping insertion in model container [2022-12-14 14:52:32,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:31" (2/3) ... [2022-12-14 14:52:32,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c7a951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:52:32, skipping insertion in model container [2022-12-14 14:52:32,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:32" (3/3) ... [2022-12-14 14:52:32,154 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2022-12-14 14:52:32,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:52:32,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-14 14:52:32,172 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 14:52:32,237 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 14:52:32,271 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:52:32,286 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 267 flow [2022-12-14 14:52:32,289 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 267 flow [2022-12-14 14:52:32,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-12-14 14:52:32,341 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-14 14:52:32,342 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 14:52:32,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-14 14:52:32,349 INFO L119 LiptonReduction]: Number of co-enabled transitions 2302 [2022-12-14 14:52:38,940 INFO L134 LiptonReduction]: Checked pairs total: 6480 [2022-12-14 14:52:38,940 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-12-14 14:52:38,946 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-12-14 14:52:39,012 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1094 states, 1081 states have (on average 3.3311748381128585) internal successors, (3601), 1093 states have internal predecessors, (3601), 0 states have call successors, (0), 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 14:52:39,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:52:39,033 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;@26701af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:52:39,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-14 14:52:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 1094 states, 1081 states have (on average 3.3311748381128585) internal successors, (3601), 1093 states have internal predecessors, (3601), 0 states have call successors, (0), 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 14:52:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 14:52:39,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:39,041 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 14:52:39,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash 543, now seen corresponding path program 1 times [2022-12-14 14:52:39,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:39,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233813134] [2022-12-14 14:52:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:39,056 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 14:52:39,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:39,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:39,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:39,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 14:52:39,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:39,117 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 14:52:39,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:39,118 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:39,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233813134] [2022-12-14 14:52:39,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233813134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:39,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:39,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 14:52:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629799285] [2022-12-14 14:52:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:39,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 14:52:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 14:52:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:52:39,145 INFO L87 Difference]: Start difference. First operand has 1094 states, 1081 states have (on average 3.3311748381128585) internal successors, (3601), 1093 states have internal predecessors, (3601), 0 states have call successors, (0), 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 14:52:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:39,276 INFO L93 Difference]: Finished difference Result 1022 states and 3273 transitions. [2022-12-14 14:52:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 14:52:39,278 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 14:52:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:39,306 INFO L225 Difference]: With dead ends: 1022 [2022-12-14 14:52:39,307 INFO L226 Difference]: Without dead ends: 1022 [2022-12-14 14:52:39,307 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 14:52:39,309 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:39,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-12-14 14:52:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2022-12-14 14:52:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1017 states have (on average 3.218289085545723) internal successors, (3273), 1021 states have internal predecessors, (3273), 0 states have call successors, (0), 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 14:52:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3273 transitions. [2022-12-14 14:52:39,380 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 3273 transitions. Word has length 1 [2022-12-14 14:52:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:39,380 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 3273 transitions. [2022-12-14 14:52:39,380 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 14:52:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 3273 transitions. [2022-12-14 14:52:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:52:39,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:39,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:52:39,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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)] Forceful destruction successful, exit code 0 [2022-12-14 14:52:39,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:39,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash 515363060, now seen corresponding path program 1 times [2022-12-14 14:52:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:39,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156142368] [2022-12-14 14:52:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:39,588 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 14:52:39,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:39,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:39,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:39,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 14:52:39,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:39,807 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 14:52:39,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:39,807 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:39,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156142368] [2022-12-14 14:52:39,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156142368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:39,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:39,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:52:39,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914839148] [2022-12-14 14:52:39,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:39,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:52:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:52:39,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:52:39,811 INFO L87 Difference]: Start difference. First operand 1022 states and 3273 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 14:52:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:39,905 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-12-14 14:52:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:52:39,906 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 14:52:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:39,909 INFO L225 Difference]: With dead ends: 837 [2022-12-14 14:52:39,909 INFO L226 Difference]: Without dead ends: 812 [2022-12-14 14:52:39,910 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 14:52:39,911 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:39,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-12-14 14:52:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-12-14 14:52:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 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 14:52:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-12-14 14:52:39,932 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2022-12-14 14:52:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:39,932 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-12-14 14:52:39,932 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 14:52:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-12-14 14:52:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 14:52:39,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:39,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:39,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:40,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:40,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:40,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1868679858, now seen corresponding path program 1 times [2022-12-14 14:52:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:40,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177633475] [2022-12-14 14:52:40,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:40,141 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 14:52:40,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:40,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:40,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:40,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 14:52:40,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:40,395 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 14:52:40,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:40,396 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:40,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177633475] [2022-12-14 14:52:40,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177633475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:40,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:40,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:52:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570601954] [2022-12-14 14:52:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:40,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:52:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:40,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:52:40,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:52:40,398 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 14:52:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:40,512 INFO L93 Difference]: Finished difference Result 617 states and 1659 transitions. [2022-12-14 14:52:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 14:52:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:40,514 INFO L225 Difference]: With dead ends: 617 [2022-12-14 14:52:40,514 INFO L226 Difference]: Without dead ends: 492 [2022-12-14 14:52:40,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 14:52:40,515 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:40,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-12-14 14:52:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2022-12-14 14:52:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 490 states have (on average 2.642857142857143) internal successors, (1295), 491 states have internal predecessors, (1295), 0 states have call successors, (0), 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 14:52:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1295 transitions. [2022-12-14 14:52:40,526 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1295 transitions. Word has length 9 [2022-12-14 14:52:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:40,526 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1295 transitions. [2022-12-14 14:52:40,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 14:52:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1295 transitions. [2022-12-14 14:52:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:52:40,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:40,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:52:40,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:40,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:40,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash -975606144, now seen corresponding path program 1 times [2022-12-14 14:52:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:40,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026487010] [2022-12-14 14:52:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:40,731 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 14:52:40,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:40,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:40,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:40,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 14:52:40,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:40,908 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 14:52:40,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:40,908 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:40,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026487010] [2022-12-14 14:52:40,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026487010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:40,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:40,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:52:40,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692704651] [2022-12-14 14:52:40,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:40,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:52:40,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:40,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:52:40,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:52:40,910 INFO L87 Difference]: Start difference. First operand 492 states and 1295 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 14:52:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:41,076 INFO L93 Difference]: Finished difference Result 313 states and 731 transitions. [2022-12-14 14:52:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:52:41,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-12-14 14:52:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:41,078 INFO L225 Difference]: With dead ends: 313 [2022-12-14 14:52:41,078 INFO L226 Difference]: Without dead ends: 252 [2022-12-14 14:52:41,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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 14:52:41,079 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:41,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 27 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:52:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-12-14 14:52:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-12-14 14:52:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 250 states have (on average 2.3) internal successors, (575), 251 states have internal predecessors, (575), 0 states have call successors, (0), 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 14:52:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 575 transitions. [2022-12-14 14:52:41,084 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 575 transitions. Word has length 13 [2022-12-14 14:52:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:41,084 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 575 transitions. [2022-12-14 14:52:41,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 14:52:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 575 transitions. [2022-12-14 14:52:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 14:52:41,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:41,086 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 14:52:41,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:41,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:41,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash 562684708, now seen corresponding path program 1 times [2022-12-14 14:52:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:41,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901676147] [2022-12-14 14:52:41,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:41,292 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 14:52:41,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:41,295 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:41,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:41,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 14:52:41,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:41,531 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 14:52:41,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:41,532 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:41,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901676147] [2022-12-14 14:52:41,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901676147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:41,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:41,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:52:41,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770605368] [2022-12-14 14:52:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:41,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:52:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:52:41,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:52:41,534 INFO L87 Difference]: Start difference. First operand 252 states and 575 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 14:52:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:41,698 INFO L93 Difference]: Finished difference Result 205 states and 479 transitions. [2022-12-14 14:52:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:52:41,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 14:52:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:41,700 INFO L225 Difference]: With dead ends: 205 [2022-12-14 14:52:41,700 INFO L226 Difference]: Without dead ends: 192 [2022-12-14 14:52:41,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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 14:52:41,701 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:41,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 45 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:52:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-12-14 14:52:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-12-14 14:52:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.3947368421052633) internal successors, (455), 191 states have internal predecessors, (455), 0 states have call successors, (0), 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 14:52:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 455 transitions. [2022-12-14 14:52:41,705 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 455 transitions. Word has length 17 [2022-12-14 14:52:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:41,705 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 455 transitions. [2022-12-14 14:52:41,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 14:52:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 455 transitions. [2022-12-14 14:52:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:41,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:41,706 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] [2022-12-14 14:52:41,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:41,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:41,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1422371201, now seen corresponding path program 1 times [2022-12-14 14:52:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:41,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168701324] [2022-12-14 14:52:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:52:41,908 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 14:52:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:41,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:41,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:52:41,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 14:52:42,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:42,028 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 14:52:42,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:42,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:42,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168701324] [2022-12-14 14:52:42,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168701324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:42,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:42,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:52:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20659938] [2022-12-14 14:52:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:42,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:52:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:42,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:52:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:52:42,030 INFO L87 Difference]: Start difference. First operand 192 states and 455 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:42,142 INFO L93 Difference]: Finished difference Result 256 states and 592 transitions. [2022-12-14 14:52:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:52:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 14:52:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:42,145 INFO L225 Difference]: With dead ends: 256 [2022-12-14 14:52:42,145 INFO L226 Difference]: Without dead ends: 256 [2022-12-14 14:52:42,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 14:52:42,145 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:42,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-12-14 14:52:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2022-12-14 14:52:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 252 states have (on average 2.3452380952380953) internal successors, (591), 253 states have internal predecessors, (591), 0 states have call successors, (0), 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 14:52:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 591 transitions. [2022-12-14 14:52:42,151 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 591 transitions. Word has length 21 [2022-12-14 14:52:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:42,151 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 591 transitions. [2022-12-14 14:52:42,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 591 transitions. [2022-12-14 14:52:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:42,152 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:42,152 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] [2022-12-14 14:52:42,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:42,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:42,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1011131469, now seen corresponding path program 2 times [2022-12-14 14:52:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:42,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305986207] [2022-12-14 14:52:42,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:52:42,355 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 14:52:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:42,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:42,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:42,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 14:52:42,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:52:42,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 14:52:42,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:42,510 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 14:52:42,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:42,510 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:42,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305986207] [2022-12-14 14:52:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305986207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:42,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:42,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:52:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612266375] [2022-12-14 14:52:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:42,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:52:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:52:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:52:42,512 INFO L87 Difference]: Start difference. First operand 254 states and 591 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:42,611 INFO L93 Difference]: Finished difference Result 356 states and 806 transitions. [2022-12-14 14:52:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:52:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 14:52:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:42,614 INFO L225 Difference]: With dead ends: 356 [2022-12-14 14:52:42,614 INFO L226 Difference]: Without dead ends: 356 [2022-12-14 14:52:42,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 14:52:42,615 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:42,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-12-14 14:52:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 242. [2022-12-14 14:52:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 2.341666666666667) internal successors, (562), 241 states have internal predecessors, (562), 0 states have call successors, (0), 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 14:52:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 562 transitions. [2022-12-14 14:52:42,621 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 562 transitions. Word has length 21 [2022-12-14 14:52:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:42,621 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 562 transitions. [2022-12-14 14:52:42,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 562 transitions. [2022-12-14 14:52:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:42,621 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:42,622 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] [2022-12-14 14:52:42,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:42,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:42,822 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:42,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1401020557, now seen corresponding path program 3 times [2022-12-14 14:52:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:42,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454309718] [2022-12-14 14:52:42,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:52:42,823 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 14:52:42,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:42,824 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:42,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:42,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 14:52:42,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:52:42,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 14:52:42,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:43,124 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 14:52:43,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:43,124 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:43,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454309718] [2022-12-14 14:52:43,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454309718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:43,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:43,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:52:43,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143724556] [2022-12-14 14:52:43,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:43,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:52:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:43,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:52:43,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:52:43,126 INFO L87 Difference]: Start difference. First operand 242 states and 562 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:43,286 INFO L93 Difference]: Finished difference Result 314 states and 700 transitions. [2022-12-14 14:52:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 14:52:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:43,289 INFO L225 Difference]: With dead ends: 314 [2022-12-14 14:52:43,289 INFO L226 Difference]: Without dead ends: 314 [2022-12-14 14:52:43,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:52:43,290 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:43,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 21 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:52:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-12-14 14:52:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 234. [2022-12-14 14:52:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 232 states have (on average 2.353448275862069) internal successors, (546), 233 states have internal predecessors, (546), 0 states have call successors, (0), 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 14:52:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 546 transitions. [2022-12-14 14:52:43,294 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 546 transitions. Word has length 21 [2022-12-14 14:52:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:43,294 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 546 transitions. [2022-12-14 14:52:43,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 546 transitions. [2022-12-14 14:52:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:43,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:43,295 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] [2022-12-14 14:52:43,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:43,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:43,497 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1332041621, now seen corresponding path program 4 times [2022-12-14 14:52:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:43,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840543695] [2022-12-14 14:52:43,499 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:52:43,500 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 14:52:43,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:43,502 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:43,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:43,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:52:43,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:52:43,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 14:52:43,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:52:43,861 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 14:52:43,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:52:43,861 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:52:43,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840543695] [2022-12-14 14:52:43,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840543695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:52:43,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:52:43,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:52:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713536722] [2022-12-14 14:52:43,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:52:43,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:52:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:52:43,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:52:43,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:52:43,863 INFO L87 Difference]: Start difference. First operand 234 states and 546 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:52:44,024 INFO L93 Difference]: Finished difference Result 300 states and 671 transitions. [2022-12-14 14:52:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:52:44,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 14:52:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:52:44,026 INFO L225 Difference]: With dead ends: 300 [2022-12-14 14:52:44,026 INFO L226 Difference]: Without dead ends: 300 [2022-12-14 14:52:44,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:52:44,027 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:52:44,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:52:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-14 14:52:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 228. [2022-12-14 14:52:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 226 states have (on average 2.349557522123894) internal successors, (531), 227 states have internal predecessors, (531), 0 states have call successors, (0), 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 14:52:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 531 transitions. [2022-12-14 14:52:44,034 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 531 transitions. Word has length 21 [2022-12-14 14:52:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:52:44,034 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 531 transitions. [2022-12-14 14:52:44,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 14:52:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 531 transitions. [2022-12-14 14:52:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:52:44,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:52:44,035 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] [2022-12-14 14:52:44,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:44,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:44,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 14:52:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:52:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash -293682381, now seen corresponding path program 5 times [2022-12-14 14:52:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:52:44,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570916323] [2022-12-14 14:52:44,240 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 14:52:44,240 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 14:52:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:52:44,243 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:44,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:44,504 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 14:52:44,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-14 14:52:44,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 14:52:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 14:52:44,598 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 14:52:44,598 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 14:52:44,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-14 14:52:44,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-14 14:52:44,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-14 14:52:44,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-14 14:52:44,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-14 14:52:44,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-14 14:52:44,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-14 14:52:44,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-14 14:52:44,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-14 14:52:44,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-14 14:52:44,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-14 14:52:44,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-14 14:52:44,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-14 14:52:44,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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)] Forceful destruction successful, exit code 0 [2022-12-14 14:52:44,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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 14:52:44,809 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2022-12-14 14:52:44,822 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 14:52:44,822 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 14:52:44,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:52:44 BasicIcfg [2022-12-14 14:52:44,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 14:52:44,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 14:52:44,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 14:52:44,880 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 14:52:44,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:32" (3/4) ... [2022-12-14 14:52:44,882 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 14:52:44,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 14:52:44,883 INFO L158 Benchmark]: Toolchain (without parser) took 13955.04ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 66.7MB in the beginning and 39.0MB in the end (delta: 27.7MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2022-12-14 14:52:44,883 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 62.9MB. Free memory is still 41.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 14:52:44,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.61ms. Allocated memory is still 90.2MB. Free memory was 66.5MB in the beginning and 59.8MB in the end (delta: 6.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2022-12-14 14:52:44,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.53ms. Allocated memory is still 90.2MB. Free memory was 59.8MB in the beginning and 57.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 14:52:44,884 INFO L158 Benchmark]: Boogie Preprocessor took 29.52ms. Allocated memory is still 90.2MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 14:52:44,884 INFO L158 Benchmark]: RCFGBuilder took 616.19ms. Allocated memory is still 90.2MB. Free memory was 55.2MB in the beginning and 41.3MB in the end (delta: 13.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-12-14 14:52:44,884 INFO L158 Benchmark]: TraceAbstraction took 12731.38ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 40.7MB in the beginning and 40.1MB in the end (delta: 568.0kB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-12-14 14:52:44,884 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 109.1MB. Free memory was 40.1MB in the beginning and 39.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 14:52:44,885 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.10ms. Allocated memory is still 62.9MB. Free memory is still 41.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.61ms. Allocated memory is still 90.2MB. Free memory was 66.5MB in the beginning and 59.8MB in the end (delta: 6.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.53ms. Allocated memory is still 90.2MB. Free memory was 59.8MB in the beginning and 57.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.52ms. Allocated memory is still 90.2MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 616.19ms. Allocated memory is still 90.2MB. Free memory was 55.2MB in the beginning and 41.3MB in the end (delta: 13.9MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12731.38ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 40.7MB in the beginning and 40.1MB in the end (delta: 568.0kB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 109.1MB. Free memory was 40.1MB in the beginning and 39.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 134 PlacesBefore, 44 PlacesAfterwards, 126 TransitionsBefore, 35 TransitionsAfterwards, 2302 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 6480 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3246, independent: 3068, independent conditional: 0, independent unconditional: 3068, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1741, independent: 1682, independent conditional: 0, independent unconditional: 1682, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1741, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 315, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 278, dependent conditional: 0, dependent unconditional: 278, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3246, independent: 1386, independent conditional: 0, independent unconditional: 1386, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 1741, unknown conditional: 0, unknown unconditional: 1741] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-1, t1403={-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=0, t1403={-6:0}, t1404={-10: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=1, t1403={-6:0}, t1404={-10:0}, t1405={-2: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L798] 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) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L746] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L749] 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) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 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 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 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) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={-6:0}, t1404={-10:0}, t1405={-2: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 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) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 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)) [L847] 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)) [L848] 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)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] - 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: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 825]: 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: 821]: 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 7 procedures, 153 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 991 IncrementalHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 57 mSDtfsCounter, 991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1094occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 268 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 843 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1122 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 14:52:44,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f60a969-b0bc-44a7-862f-7fad51016a14/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