./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW --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 26c011a0e45020881b0eb90c07839ec48e6b26942e49028568b078c64e0cf722 --- 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-4e7fbc6 [2022-11-23 13:52:26,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:52:26,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:52:26,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:52:26,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:52:26,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:52:26,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:52:26,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:52:26,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:52:26,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:52:26,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:52:26,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:52:26,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:52:26,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:52:26,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:52:26,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:52:26,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:52:26,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:52:26,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:52:26,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:52:26,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:52:26,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:52:26,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:52:26,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:52:26,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:52:26,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:52:26,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:52:26,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:52:26,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:52:26,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:52:26,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:52:26,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:52:26,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:52:26,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:52:26,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:52:26,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:52:26,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:52:26,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:52:26,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:52:26,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:52:26,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:52:26,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 13:52:26,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:52:26,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:52:26,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:52:26,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:52:26,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:52:26,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:52:26,932 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:52:26,932 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:52:26,933 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:52:26,933 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:52:26,933 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:52:26,933 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:52:26,934 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:52:26,934 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:52:26,934 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:52:26,934 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:52:26,935 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:52:26,935 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:52:26,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 13:52:26,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 13:52:26,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:52:26,936 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:52:26,937 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 13:52:26,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:52:26,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:52:26,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:52:26,938 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 13:52:26,938 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 13:52:26,938 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 13:52:26,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:52:26,939 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 13:52:26,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:52:26,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:52:26,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:52:26,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:52:26,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:26,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:52:26,940 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:52:26,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:52:26,941 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:52:26,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:52:26,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:52:26,942 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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW 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 -> 26c011a0e45020881b0eb90c07839ec48e6b26942e49028568b078c64e0cf722 [2022-11-23 13:52:27,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:52:27,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:52:27,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:52:27,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:52:27,259 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:52:27,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i [2022-11-23 13:52:30,317 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:52:30,581 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:52:30,582 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i [2022-11-23 13:52:30,599 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/data/2c572c2e1/951f997131ff4bb49b9f843b4acb033c/FLAG7f12c59ce [2022-11-23 13:52:30,625 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/data/2c572c2e1/951f997131ff4bb49b9f843b4acb033c [2022-11-23 13:52:30,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:52:30,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:52:30,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:30,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:52:30,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:52:30,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:30" (1/1) ... [2022-11-23 13:52:30,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef04509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:30, skipping insertion in model container [2022-11-23 13:52:30,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:30" (1/1) ... [2022-11-23 13:52:30,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:52:30,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:52:30,878 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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i[949,962] [2022-11-23 13:52:31,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:31,128 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:52:31,141 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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i[949,962] [2022-11-23 13:52:31,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:31,233 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:52:31,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31 WrapperNode [2022-11-23 13:52:31,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:31,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:31,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:52:31,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:52:31,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,343 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-11-23 13:52:31,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:31,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:52:31,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:52:31,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:52:31,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,383 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:52:31,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:52:31,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:52:31,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:52:31,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (1/1) ... [2022-11-23 13:52:31,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:31,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:31,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:52:31,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:52:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 13:52:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 13:52:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 13:52:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 13:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 13:52:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 13:52:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 13:52:31,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 13:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 13:52:31,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 13:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 13:52:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:52:31,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:52:31,473 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 13:52:31,617 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:52:31,619 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:52:32,106 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:52:32,268 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:52:32,269 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 13:52:32,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:32 BoogieIcfgContainer [2022-11-23 13:52:32,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:52:32,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:52:32,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:52:32,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:52:32,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:30" (1/3) ... [2022-11-23 13:52:32,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1171504a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:32, skipping insertion in model container [2022-11-23 13:52:32,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:31" (2/3) ... [2022-11-23 13:52:32,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1171504a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:32, skipping insertion in model container [2022-11-23 13:52:32,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:32" (3/3) ... [2022-11-23 13:52:32,290 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2022-11-23 13:52:32,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:52:32,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 13:52:32,311 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:52:32,399 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 13:52:32,451 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:52:32,474 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-23 13:52:32,479 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-23 13:52:32,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-23 13:52:32,595 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-23 13:52:32,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 13:52:32,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-23 13:52:32,605 INFO L119 LiptonReduction]: Number of co-enabled transitions 3670 [2022-11-23 13:52:39,274 INFO L134 LiptonReduction]: Checked pairs total: 9004 [2022-11-23 13:52:39,274 INFO L136 LiptonReduction]: Total number of compositions: 148 [2022-11-23 13:52:39,287 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-23 13:52:39,605 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 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-11-23 13:52:39,631 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:52:39,639 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;@5b769b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:52:39,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 13:52:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 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-11-23 13:52:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 13:52:39,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:39,680 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 13:52:39,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash 624, now seen corresponding path program 1 times [2022-11-23 13:52:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:39,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598477255] [2022-11-23 13:52:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:39,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-11-23 13:52:39,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:39,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598477255] [2022-11-23 13:52:39,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598477255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:39,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:39,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 13:52:39,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611843747] [2022-11-23 13:52:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:39,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 13:52:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:39,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 13:52:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:52:39,894 INFO L87 Difference]: Start difference. First operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 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-11-23 13:52:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:40,098 INFO L93 Difference]: Finished difference Result 4850 states and 19358 transitions. [2022-11-23 13:52:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 13:52:40,101 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-11-23 13:52:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:40,182 INFO L225 Difference]: With dead ends: 4850 [2022-11-23 13:52:40,182 INFO L226 Difference]: Without dead ends: 4850 [2022-11-23 13:52:40,183 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-11-23 13:52:40,189 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:40,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2022-11-23 13:52:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4850. [2022-11-23 13:52:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4850 states, 4845 states have (on average 3.995459236326109) internal successors, (19358), 4849 states have internal predecessors, (19358), 0 states have call successors, (0), 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-11-23 13:52:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 19358 transitions. [2022-11-23 13:52:40,589 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 19358 transitions. Word has length 1 [2022-11-23 13:52:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:40,591 INFO L495 AbstractCegarLoop]: Abstraction has 4850 states and 19358 transitions. [2022-11-23 13:52:40,595 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-11-23 13:52:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 19358 transitions. [2022-11-23 13:52:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 13:52:40,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:40,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:40,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:52:40,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:40,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1848919921, now seen corresponding path program 1 times [2022-11-23 13:52:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:40,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221327764] [2022-11-23 13:52:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:40,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:41,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:41,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221327764] [2022-11-23 13:52:41,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221327764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:41,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:41,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:52:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712796504] [2022-11-23 13:52:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:41,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:52:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:52:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:52:41,102 INFO L87 Difference]: Start difference. First operand 4850 states and 19358 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-23 13:52:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:41,267 INFO L93 Difference]: Finished difference Result 3970 states and 15654 transitions. [2022-11-23 13:52:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:52:41,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-23 13:52:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:41,302 INFO L225 Difference]: With dead ends: 3970 [2022-11-23 13:52:41,302 INFO L226 Difference]: Without dead ends: 3850 [2022-11-23 13:52:41,303 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-11-23 13:52:41,304 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:41,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-11-23 13:52:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3850. [2022-11-23 13:52:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3848 states have (on average 3.9625779625779627) internal successors, (15248), 3849 states have internal predecessors, (15248), 0 states have call successors, (0), 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-11-23 13:52:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 15248 transitions. [2022-11-23 13:52:41,506 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 15248 transitions. Word has length 7 [2022-11-23 13:52:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:41,507 INFO L495 AbstractCegarLoop]: Abstraction has 3850 states and 15248 transitions. [2022-11-23 13:52:41,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-23 13:52:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 15248 transitions. [2022-11-23 13:52:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:52:41,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:41,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:41,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:52:41,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1188378444, now seen corresponding path program 1 times [2022-11-23 13:52:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045351380] [2022-11-23 13:52:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:42,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:42,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045351380] [2022-11-23 13:52:42,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045351380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:42,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:42,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842553898] [2022-11-23 13:52:42,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:42,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:42,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:42,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:42,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:42,364 INFO L87 Difference]: Start difference. First operand 3850 states and 15248 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11-23 13:52:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:43,046 INFO L93 Difference]: Finished difference Result 7186 states and 27314 transitions. [2022-11-23 13:52:43,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:43,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11-23 13:52:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:43,097 INFO L225 Difference]: With dead ends: 7186 [2022-11-23 13:52:43,097 INFO L226 Difference]: Without dead ends: 7186 [2022-11-23 13:52:43,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:43,098 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:43,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 27 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:52:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2022-11-23 13:52:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4630. [2022-11-23 13:52:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 4628 states have (on average 3.9719101123595504) internal successors, (18382), 4629 states have internal predecessors, (18382), 0 states have call successors, (0), 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-11-23 13:52:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 18382 transitions. [2022-11-23 13:52:43,384 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 18382 transitions. Word has length 12 [2022-11-23 13:52:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:43,385 INFO L495 AbstractCegarLoop]: Abstraction has 4630 states and 18382 transitions. [2022-11-23 13:52:43,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11-23 13:52:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 18382 transitions. [2022-11-23 13:52:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:52:43,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:43,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:43,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 13:52:43,388 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1188378415, now seen corresponding path program 1 times [2022-11-23 13:52:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:43,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034609997] [2022-11-23 13:52:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:44,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:44,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034609997] [2022-11-23 13:52:44,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034609997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:44,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:44,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844579140] [2022-11-23 13:52:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:44,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:52:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:44,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:52:44,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:44,217 INFO L87 Difference]: Start difference. First operand 4630 states and 18382 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:44,519 INFO L93 Difference]: Finished difference Result 4030 states and 15332 transitions. [2022-11-23 13:52:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:44,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 13:52:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:44,590 INFO L225 Difference]: With dead ends: 4030 [2022-11-23 13:52:44,590 INFO L226 Difference]: Without dead ends: 3414 [2022-11-23 13:52:44,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:44,594 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:44,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 50 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:52:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2022-11-23 13:52:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 3414. [2022-11-23 13:52:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3414 states, 3413 states have (on average 3.815411661295048) internal successors, (13022), 3413 states have internal predecessors, (13022), 0 states have call successors, (0), 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-11-23 13:52:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 13022 transitions. [2022-11-23 13:52:44,716 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 13022 transitions. Word has length 12 [2022-11-23 13:52:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:44,718 INFO L495 AbstractCegarLoop]: Abstraction has 3414 states and 13022 transitions. [2022-11-23 13:52:44,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 13022 transitions. [2022-11-23 13:52:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:52:44,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:44,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:44,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:52:44,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash 606292620, now seen corresponding path program 1 times [2022-11-23 13:52:44,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:44,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294249933] [2022-11-23 13:52:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:45,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:45,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294249933] [2022-11-23 13:52:45,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294249933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:45,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:45,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005710619] [2022-11-23 13:52:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:45,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:45,220 INFO L87 Difference]: Start difference. First operand 3414 states and 13022 transitions. Second operand has 5 states, 4 states have (on average 3.25) 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-11-23 13:52:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:45,637 INFO L93 Difference]: Finished difference Result 4474 states and 16390 transitions. [2022-11-23 13:52:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) 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-11-23 13:52:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:45,656 INFO L225 Difference]: With dead ends: 4474 [2022-11-23 13:52:45,657 INFO L226 Difference]: Without dead ends: 3774 [2022-11-23 13:52:45,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:45,658 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:45,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 19 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:52:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2022-11-23 13:52:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 2954. [2022-11-23 13:52:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2953 states have (on average 3.7805621401964102) internal successors, (11164), 2953 states have internal predecessors, (11164), 0 states have call successors, (0), 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-11-23 13:52:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 11164 transitions. [2022-11-23 13:52:45,839 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 11164 transitions. Word has length 13 [2022-11-23 13:52:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:45,840 INFO L495 AbstractCegarLoop]: Abstraction has 2954 states and 11164 transitions. [2022-11-23 13:52:45,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) 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-11-23 13:52:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 11164 transitions. [2022-11-23 13:52:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 13:52:45,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:45,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:45,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:52:45,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash 310232956, now seen corresponding path program 1 times [2022-11-23 13:52:45,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:45,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138082708] [2022-11-23 13:52:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:46,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:46,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138082708] [2022-11-23 13:52:46,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138082708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:46,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:46,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:46,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051754454] [2022-11-23 13:52:46,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:46,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:46,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:46,617 INFO L87 Difference]: Start difference. First operand 2954 states and 11164 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:46,806 INFO L93 Difference]: Finished difference Result 3266 states and 12074 transitions. [2022-11-23 13:52:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:52:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 13:52:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:46,822 INFO L225 Difference]: With dead ends: 3266 [2022-11-23 13:52:46,822 INFO L226 Difference]: Without dead ends: 2906 [2022-11-23 13:52:46,823 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-11-23 13:52:46,824 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:46,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2022-11-23 13:52:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2898. [2022-11-23 13:52:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 3.77148774594408) internal successors, (10926), 2897 states have internal predecessors, (10926), 0 states have call successors, (0), 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-11-23 13:52:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 10926 transitions. [2022-11-23 13:52:46,956 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 10926 transitions. Word has length 15 [2022-11-23 13:52:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:46,956 INFO L495 AbstractCegarLoop]: Abstraction has 2898 states and 10926 transitions. [2022-11-23 13:52:46,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 10926 transitions. [2022-11-23 13:52:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:52:46,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:46,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:46,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:52:46,961 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2071908528, now seen corresponding path program 1 times [2022-11-23 13:52:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:46,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083110986] [2022-11-23 13:52:46,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:47,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:47,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083110986] [2022-11-23 13:52:47,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083110986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:47,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:47,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:52:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275323683] [2022-11-23 13:52:47,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:47,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:52:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:47,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:52:47,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:47,355 INFO L87 Difference]: Start difference. First operand 2898 states and 10926 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:47,650 INFO L93 Difference]: Finished difference Result 3090 states and 11482 transitions. [2022-11-23 13:52:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 13:52:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:47,663 INFO L225 Difference]: With dead ends: 3090 [2022-11-23 13:52:47,664 INFO L226 Difference]: Without dead ends: 2850 [2022-11-23 13:52:47,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:47,665 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:47,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 32 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2022-11-23 13:52:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2770. [2022-11-23 13:52:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2769 states have (on average 3.7667027807872877) internal successors, (10430), 2769 states have internal predecessors, (10430), 0 states have call successors, (0), 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-11-23 13:52:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 10430 transitions. [2022-11-23 13:52:47,808 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 10430 transitions. Word has length 16 [2022-11-23 13:52:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:47,808 INFO L495 AbstractCegarLoop]: Abstraction has 2770 states and 10430 transitions. [2022-11-23 13:52:47,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 10430 transitions. [2022-11-23 13:52:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:52:47,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:47,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:47,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:52:47,812 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1925979227, now seen corresponding path program 1 times [2022-11-23 13:52:47,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:47,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531477265] [2022-11-23 13:52:47,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:48,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:48,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531477265] [2022-11-23 13:52:48,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531477265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:48,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:48,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39543288] [2022-11-23 13:52:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:48,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:48,299 INFO L87 Difference]: Start difference. First operand 2770 states and 10430 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:48,498 INFO L93 Difference]: Finished difference Result 3146 states and 11618 transitions. [2022-11-23 13:52:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 13:52:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:48,511 INFO L225 Difference]: With dead ends: 3146 [2022-11-23 13:52:48,511 INFO L226 Difference]: Without dead ends: 2834 [2022-11-23 13:52:48,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:48,512 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:48,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 25 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2022-11-23 13:52:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2814. [2022-11-23 13:52:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2813 states have (on average 3.756132243156772) internal successors, (10566), 2813 states have internal predecessors, (10566), 0 states have call successors, (0), 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-11-23 13:52:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 10566 transitions. [2022-11-23 13:52:48,642 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 10566 transitions. Word has length 16 [2022-11-23 13:52:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:48,642 INFO L495 AbstractCegarLoop]: Abstraction has 2814 states and 10566 transitions. [2022-11-23 13:52:48,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 10566 transitions. [2022-11-23 13:52:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 13:52:48,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:48,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:48,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 13:52:48,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:48,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1094037255, now seen corresponding path program 1 times [2022-11-23 13:52:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:48,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707674125] [2022-11-23 13:52:48,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:48,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:49,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:49,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707674125] [2022-11-23 13:52:49,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707674125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:49,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:49,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:49,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017394765] [2022-11-23 13:52:49,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:49,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:52:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:52:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:49,246 INFO L87 Difference]: Start difference. First operand 2814 states and 10566 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-11-23 13:52:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:49,679 INFO L93 Difference]: Finished difference Result 3810 states and 14064 transitions. [2022-11-23 13:52:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:52:49,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-11-23 13:52:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:49,740 INFO L225 Difference]: With dead ends: 3810 [2022-11-23 13:52:49,740 INFO L226 Difference]: Without dead ends: 3538 [2022-11-23 13:52:49,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:52:49,741 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 95 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:49,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 51 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:52:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2022-11-23 13:52:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3110. [2022-11-23 13:52:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 3109 states have (on average 3.7510453522032807) internal successors, (11662), 3109 states have internal predecessors, (11662), 0 states have call successors, (0), 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-11-23 13:52:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 11662 transitions. [2022-11-23 13:52:49,881 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 11662 transitions. Word has length 17 [2022-11-23 13:52:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:49,881 INFO L495 AbstractCegarLoop]: Abstraction has 3110 states and 11662 transitions. [2022-11-23 13:52:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-11-23 13:52:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 11662 transitions. [2022-11-23 13:52:49,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:52:49,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:49,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:49,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 13:52:49,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1658480674, now seen corresponding path program 1 times [2022-11-23 13:52:49,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:49,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026436720] [2022-11-23 13:52:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:51,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:51,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026436720] [2022-11-23 13:52:51,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026436720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:51,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:51,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308641625] [2022-11-23 13:52:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:51,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:52:51,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:52:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:51,181 INFO L87 Difference]: Start difference. First operand 3110 states and 11662 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-23 13:52:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:51,578 INFO L93 Difference]: Finished difference Result 3822 states and 14264 transitions. [2022-11-23 13:52:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-23 13:52:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:51,602 INFO L225 Difference]: With dead ends: 3822 [2022-11-23 13:52:51,602 INFO L226 Difference]: Without dead ends: 3662 [2022-11-23 13:52:51,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:52:51,603 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:51,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 57 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:52:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2022-11-23 13:52:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3310. [2022-11-23 13:52:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 3309 states have (on average 3.7739498337866424) internal successors, (12488), 3309 states have internal predecessors, (12488), 0 states have call successors, (0), 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-11-23 13:52:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 12488 transitions. [2022-11-23 13:52:51,744 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 12488 transitions. Word has length 18 [2022-11-23 13:52:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:51,744 INFO L495 AbstractCegarLoop]: Abstraction has 3310 states and 12488 transitions. [2022-11-23 13:52:51,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-23 13:52:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 12488 transitions. [2022-11-23 13:52:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:52:51,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:51,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:51,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 13:52:51,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1761174046, now seen corresponding path program 2 times [2022-11-23 13:52:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:51,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960274978] [2022-11-23 13:52:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:53,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:53,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960274978] [2022-11-23 13:52:53,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960274978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:53,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:53,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415433025] [2022-11-23 13:52:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:53,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:52:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:53,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:52:53,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:53,072 INFO L87 Difference]: Start difference. First operand 3310 states and 12488 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-23 13:52:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:53,574 INFO L93 Difference]: Finished difference Result 3998 states and 14842 transitions. [2022-11-23 13:52:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:52:53,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-23 13:52:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:53,594 INFO L225 Difference]: With dead ends: 3998 [2022-11-23 13:52:53,594 INFO L226 Difference]: Without dead ends: 3838 [2022-11-23 13:52:53,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:52:53,595 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 96 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:53,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 56 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:52:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2022-11-23 13:52:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3294. [2022-11-23 13:52:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 3.7740662010324932) internal successors, (12428), 3293 states have internal predecessors, (12428), 0 states have call successors, (0), 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-11-23 13:52:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 12428 transitions. [2022-11-23 13:52:53,698 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 12428 transitions. Word has length 18 [2022-11-23 13:52:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:53,699 INFO L495 AbstractCegarLoop]: Abstraction has 3294 states and 12428 transitions. [2022-11-23 13:52:53,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-23 13:52:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 12428 transitions. [2022-11-23 13:52:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:52:53,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:53,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:53,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 13:52:53,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash -258359012, now seen corresponding path program 3 times [2022-11-23 13:52:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:53,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732567815] [2022-11-23 13:52:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:55,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:55,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732567815] [2022-11-23 13:52:55,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732567815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:55,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:55,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005147144] [2022-11-23 13:52:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:55,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:52:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:52:55,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:55,067 INFO L87 Difference]: Start difference. First operand 3294 states and 12428 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-23 13:52:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:55,739 INFO L93 Difference]: Finished difference Result 6122 states and 22048 transitions. [2022-11-23 13:52:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 13:52:55,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-23 13:52:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:55,761 INFO L225 Difference]: With dead ends: 6122 [2022-11-23 13:52:55,761 INFO L226 Difference]: Without dead ends: 5402 [2022-11-23 13:52:55,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:52:55,762 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 124 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:55,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 60 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:52:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2022-11-23 13:52:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 3334. [2022-11-23 13:52:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3333 states have (on average 3.701170117011701) internal successors, (12336), 3333 states have internal predecessors, (12336), 0 states have call successors, (0), 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-11-23 13:52:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 12336 transitions. [2022-11-23 13:52:55,879 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 12336 transitions. Word has length 18 [2022-11-23 13:52:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:55,879 INFO L495 AbstractCegarLoop]: Abstraction has 3334 states and 12336 transitions. [2022-11-23 13:52:55,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-23 13:52:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 12336 transitions. [2022-11-23 13:52:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:52:55,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:55,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:55,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 13:52:55,887 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 889766428, now seen corresponding path program 1 times [2022-11-23 13:52:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:55,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622463164] [2022-11-23 13:52:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:56,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:56,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622463164] [2022-11-23 13:52:56,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622463164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:56,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:56,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229564846] [2022-11-23 13:52:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:56,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:56,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:56,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:56,098 INFO L87 Difference]: Start difference. First operand 3334 states and 12336 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-23 13:52:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:56,239 INFO L93 Difference]: Finished difference Result 3479 states and 11718 transitions. [2022-11-23 13:52:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:52:56,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-23 13:52:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:56,249 INFO L225 Difference]: With dead ends: 3479 [2022-11-23 13:52:56,249 INFO L226 Difference]: Without dead ends: 2611 [2022-11-23 13:52:56,249 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-11-23 13:52:56,250 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:56,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-11-23 13:52:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2611. [2022-11-23 13:52:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2610 states have (on average 3.346743295019157) internal successors, (8735), 2610 states have internal predecessors, (8735), 0 states have call successors, (0), 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-11-23 13:52:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 8735 transitions. [2022-11-23 13:52:56,320 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 8735 transitions. Word has length 18 [2022-11-23 13:52:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:56,320 INFO L495 AbstractCegarLoop]: Abstraction has 2611 states and 8735 transitions. [2022-11-23 13:52:56,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-23 13:52:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 8735 transitions. [2022-11-23 13:52:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 13:52:56,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:56,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:56,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 13:52:56,327 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:56,327 INFO L85 PathProgramCache]: Analyzing trace with hash 493062631, now seen corresponding path program 1 times [2022-11-23 13:52:56,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:56,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171404598] [2022-11-23 13:52:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:56,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:56,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:56,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171404598] [2022-11-23 13:52:56,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171404598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:56,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:56,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:52:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337120546] [2022-11-23 13:52:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:56,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:56,512 INFO L87 Difference]: Start difference. First operand 2611 states and 8735 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:56,690 INFO L93 Difference]: Finished difference Result 2232 states and 6827 transitions. [2022-11-23 13:52:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:56,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-23 13:52:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:56,696 INFO L225 Difference]: With dead ends: 2232 [2022-11-23 13:52:56,697 INFO L226 Difference]: Without dead ends: 1675 [2022-11-23 13:52:56,697 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-11-23 13:52:56,698 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 66 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:56,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 28 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-11-23 13:52:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1667. [2022-11-23 13:52:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1666 states have (on average 2.9963985594237696) internal successors, (4992), 1666 states have internal predecessors, (4992), 0 states have call successors, (0), 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-11-23 13:52:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 4992 transitions. [2022-11-23 13:52:56,738 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 4992 transitions. Word has length 19 [2022-11-23 13:52:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:56,738 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 4992 transitions. [2022-11-23 13:52:56,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 4992 transitions. [2022-11-23 13:52:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 13:52:56,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:56,743 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-11-23 13:52:56,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 13:52:56,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash -388611762, now seen corresponding path program 1 times [2022-11-23 13:52:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:56,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875406606] [2022-11-23 13:52:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:56,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:56,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875406606] [2022-11-23 13:52:56,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875406606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:56,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:56,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544384937] [2022-11-23 13:52:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:56,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:56,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:56,902 INFO L87 Difference]: Start difference. First operand 1667 states and 4992 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-11-23 13:52:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:57,066 INFO L93 Difference]: Finished difference Result 2442 states and 7092 transitions. [2022-11-23 13:52:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:52:57,066 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-11-23 13:52:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:57,070 INFO L225 Difference]: With dead ends: 2442 [2022-11-23 13:52:57,071 INFO L226 Difference]: Without dead ends: 1618 [2022-11-23 13:52:57,071 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-11-23 13:52:57,071 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:57,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 24 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2022-11-23 13:52:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1530. [2022-11-23 13:52:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1529 states have (on average 2.856769130150425) internal successors, (4368), 1529 states have internal predecessors, (4368), 0 states have call successors, (0), 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-11-23 13:52:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 4368 transitions. [2022-11-23 13:52:57,107 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 4368 transitions. Word has length 21 [2022-11-23 13:52:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:57,107 INFO L495 AbstractCegarLoop]: Abstraction has 1530 states and 4368 transitions. [2022-11-23 13:52:57,108 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-11-23 13:52:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 4368 transitions. [2022-11-23 13:52:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 13:52:57,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:57,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:57,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 13:52:57,112 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1410729336, now seen corresponding path program 1 times [2022-11-23 13:52:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:57,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799743152] [2022-11-23 13:52:57,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:57,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:57,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:57,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799743152] [2022-11-23 13:52:57,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799743152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:57,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:57,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:57,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849456602] [2022-11-23 13:52:57,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:57,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:52:57,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:52:57,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:57,333 INFO L87 Difference]: Start difference. First operand 1530 states and 4368 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-23 13:52:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:57,536 INFO L93 Difference]: Finished difference Result 1315 states and 3697 transitions. [2022-11-23 13:52:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-23 13:52:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:57,539 INFO L225 Difference]: With dead ends: 1315 [2022-11-23 13:52:57,539 INFO L226 Difference]: Without dead ends: 1146 [2022-11-23 13:52:57,539 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-11-23 13:52:57,540 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:57,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 34 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-11-23 13:52:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1014. [2022-11-23 13:52:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 2.852912142152024) internal successors, (2890), 1013 states have internal predecessors, (2890), 0 states have call successors, (0), 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-11-23 13:52:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2890 transitions. [2022-11-23 13:52:57,565 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2890 transitions. Word has length 22 [2022-11-23 13:52:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:57,565 INFO L495 AbstractCegarLoop]: Abstraction has 1014 states and 2890 transitions. [2022-11-23 13:52:57,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-23 13:52:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2890 transitions. [2022-11-23 13:52:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:52:57,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:57,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:57,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 13:52:57,569 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash 505521562, now seen corresponding path program 1 times [2022-11-23 13:52:57,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:57,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652151121] [2022-11-23 13:52:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:57,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:57,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652151121] [2022-11-23 13:52:57,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652151121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:57,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:57,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:57,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956462334] [2022-11-23 13:52:57,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:57,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:52:57,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:57,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:52:57,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:57,800 INFO L87 Difference]: Start difference. First operand 1014 states and 2890 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-11-23 13:52:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:58,008 INFO L93 Difference]: Finished difference Result 969 states and 2800 transitions. [2022-11-23 13:52:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:52:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:52:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:58,009 INFO L225 Difference]: With dead ends: 969 [2022-11-23 13:52:58,010 INFO L226 Difference]: Without dead ends: 594 [2022-11-23 13:52:58,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:58,011 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 76 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:58,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 26 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-23 13:52:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 494. [2022-11-23 13:52:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.8356997971602436) internal successors, (1398), 493 states have internal predecessors, (1398), 0 states have call successors, (0), 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-11-23 13:52:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1398 transitions. [2022-11-23 13:52:58,023 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1398 transitions. Word has length 25 [2022-11-23 13:52:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:58,023 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 1398 transitions. [2022-11-23 13:52:58,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-11-23 13:52:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1398 transitions. [2022-11-23 13:52:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:52:58,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:58,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:58,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 13:52:58,026 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:58,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1034932711, now seen corresponding path program 1 times [2022-11-23 13:52:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:58,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812005666] [2022-11-23 13:52:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:58,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:58,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812005666] [2022-11-23 13:52:58,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812005666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:58,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:58,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:58,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107444541] [2022-11-23 13:52:58,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:58,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:52:58,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:58,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:52:58,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:58,497 INFO L87 Difference]: Start difference. First operand 494 states and 1398 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:58,882 INFO L93 Difference]: Finished difference Result 704 states and 1976 transitions. [2022-11-23 13:52:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:58,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:52:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:58,883 INFO L225 Difference]: With dead ends: 704 [2022-11-23 13:52:58,883 INFO L226 Difference]: Without dead ends: 211 [2022-11-23 13:52:58,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:52:58,884 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:58,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 24 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:52:58,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-23 13:52:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2022-11-23 13:52:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.442105263157895) internal successors, (464), 190 states have internal predecessors, (464), 0 states have call successors, (0), 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-11-23 13:52:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 464 transitions. [2022-11-23 13:52:58,888 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 464 transitions. Word has length 28 [2022-11-23 13:52:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:58,888 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 464 transitions. [2022-11-23 13:52:58,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 464 transitions. [2022-11-23 13:52:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:52:58,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:58,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:58,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 13:52:58,890 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1579775169, now seen corresponding path program 2 times [2022-11-23 13:52:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:58,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417365291] [2022-11-23 13:52:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:00,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:00,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417365291] [2022-11-23 13:53:00,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417365291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:00,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:00,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 13:53:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115578746] [2022-11-23 13:53:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:00,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 13:53:00,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:00,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 13:53:00,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:53:00,020 INFO L87 Difference]: Start difference. First operand 191 states and 464 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:00,238 INFO L93 Difference]: Finished difference Result 230 states and 551 transitions. [2022-11-23 13:53:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:53:00,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:53:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:00,240 INFO L225 Difference]: With dead ends: 230 [2022-11-23 13:53:00,240 INFO L226 Difference]: Without dead ends: 169 [2022-11-23 13:53:00,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:53:00,241 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 92 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:00,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 25 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-23 13:53:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-11-23 13:53:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.4761904761904763) internal successors, (416), 168 states have internal predecessors, (416), 0 states have call successors, (0), 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-11-23 13:53:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 416 transitions. [2022-11-23 13:53:00,246 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 416 transitions. Word has length 28 [2022-11-23 13:53:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:00,246 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 416 transitions. [2022-11-23 13:53:00,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 416 transitions. [2022-11-23 13:53:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:53:00,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:00,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:00,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 13:53:00,248 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1128561427, now seen corresponding path program 3 times [2022-11-23 13:53:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:00,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973084822] [2022-11-23 13:53:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:53:00,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:53:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:53:00,381 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 13:53:00,382 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:53:00,383 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 13:53:00,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 13:53:00,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 13:53:00,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 13:53:00,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 13:53:00,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 13:53:00,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 13:53:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 13:53:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 13:53:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 13:53:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 13:53:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 13:53:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 13:53:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 13:53:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 13:53:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 13:53:00,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 13:53:00,391 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:00,397 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 13:53:00,397 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:53:00,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:53:00 BasicIcfg [2022-11-23 13:53:00,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:53:00,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:53:00,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:53:00,488 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:53:00,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:32" (3/4) ... [2022-11-23 13:53:00,491 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 13:53:00,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:53:00,492 INFO L158 Benchmark]: Toolchain (without parser) took 29859.39ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 99.2MB in the beginning and 1.1GB in the end (delta: -994.9MB). Peak memory consumption was 269.9MB. Max. memory is 16.1GB. [2022-11-23 13:53:00,493 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 146.8MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:53:00,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.20ms. Allocated memory is still 146.8MB. Free memory was 98.9MB in the beginning and 75.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 13:53:00,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.02ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 75.1MB in the beginning and 159.4MB in the end (delta: -84.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-11-23 13:53:00,494 INFO L158 Benchmark]: Boogie Preprocessor took 43.66ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 160.9MB in the end (delta: -1.5MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-11-23 13:53:00,494 INFO L158 Benchmark]: RCFGBuilder took 887.34ms. Allocated memory is still 190.8MB. Free memory was 160.9MB in the beginning and 122.3MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-23 13:53:00,494 INFO L158 Benchmark]: TraceAbstraction took 28206.94ms. Allocated memory was 190.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 122.3MB in the beginning and 1.1GB in the end (delta: -971.9MB). Peak memory consumption was 247.3MB. Max. memory is 16.1GB. [2022-11-23 13:53:00,495 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:53:00,496 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.27ms. Allocated memory is still 146.8MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.20ms. Allocated memory is still 146.8MB. Free memory was 98.9MB in the beginning and 75.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.02ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 75.1MB in the beginning and 159.4MB in the end (delta: -84.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.66ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 160.9MB in the end (delta: -1.5MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * RCFGBuilder took 887.34ms. Allocated memory is still 190.8MB. Free memory was 160.9MB in the beginning and 122.3MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 28206.94ms. Allocated memory was 190.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 122.3MB in the beginning and 1.1GB in the end (delta: -971.9MB). Peak memory consumption was 247.3MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 161 PlacesBefore, 56 PlacesAfterwards, 150 TransitionsBefore, 44 TransitionsAfterwards, 3670 CoEnabledTransitionPairs, 6 FixpointIterations, 59 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 148 TotalNumberOfCompositions, 9004 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5118, independent: 4931, independent conditional: 0, independent unconditional: 4931, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2544, independent: 2482, independent conditional: 0, independent unconditional: 2482, 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: 2544, independent: 2455, independent conditional: 0, independent unconditional: 2455, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 444, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 406, dependent conditional: 0, dependent unconditional: 406, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5118, independent: 2449, independent conditional: 0, independent unconditional: 2449, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 2544, unknown conditional: 0, unknown unconditional: 2544] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 346, Positive conditional cache size: 0, Positive unconditional cache size: 346, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1081, ((void *)0), P0, ((void *)0))=-3, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1082, ((void *)0), P1, ((void *)0))=-2, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1083, ((void *)0), P2, ((void *)0))=-1, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t1084; [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1084, ((void *)0), P3, ((void *)0))=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 4 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 4 a = 1 [L823] 4 __unbuffered_p3_EAX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L752] 1 b = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: -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: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1159 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1159 mSDsluCounter, 588 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 412 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3145 IncrementalHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 176 mSDtfsCounter, 3145 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5140occurred in iteration=0, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 7224 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 3755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-11-23 13:53:00,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW --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 26c011a0e45020881b0eb90c07839ec48e6b26942e49028568b078c64e0cf722 --- 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-4e7fbc6 [2022-11-23 13:53:02,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:53:02,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:53:02,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:53:02,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:53:02,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:53:02,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:53:02,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:53:02,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:53:02,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:53:02,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:53:02,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:53:02,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:53:02,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:53:02,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:53:02,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:53:02,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:53:02,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:53:02,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:53:02,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:53:02,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:53:02,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:53:02,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:53:02,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:53:02,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:53:02,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:53:02,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:53:02,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:53:02,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:53:02,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:53:02,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:53:02,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:53:02,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:53:02,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:53:02,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:53:02,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:53:02,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:53:02,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:53:02,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:53:02,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:53:02,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:53:02,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 13:53:02,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:53:02,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:53:02,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:53:02,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:53:02,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:53:02,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:53:02,997 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:53:02,998 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:53:02,998 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:53:02,998 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:53:02,999 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:53:03,000 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:53:03,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 13:53:03,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 13:53:03,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:53:03,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:53:03,002 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 13:53:03,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:53:03,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:53:03,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:53:03,003 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 13:53:03,004 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 13:53:03,004 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 13:53:03,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:53:03,004 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 13:53:03,005 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 13:53:03,005 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 13:53:03,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:53:03,006 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:53:03,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:53:03,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 13:53:03,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:53:03,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:53:03,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:53:03,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:53:03,008 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 13:53:03,008 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 13:53:03,008 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:53:03,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 13:53:03,009 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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW 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 -> 26c011a0e45020881b0eb90c07839ec48e6b26942e49028568b078c64e0cf722 [2022-11-23 13:53:03,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:53:03,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:53:03,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:53:03,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:53:03,453 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:53:03,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i [2022-11-23 13:53:06,513 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:53:06,888 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:53:06,893 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i [2022-11-23 13:53:06,925 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/data/4e6a10330/2219076f75764ab7a0ced9854f9e26b7/FLAGb5090453a [2022-11-23 13:53:06,947 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/data/4e6a10330/2219076f75764ab7a0ced9854f9e26b7 [2022-11-23 13:53:06,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:53:06,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:53:06,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:53:06,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:53:06,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:53:06,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:53:06" (1/1) ... [2022-11-23 13:53:06,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ed65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:06, skipping insertion in model container [2022-11-23 13:53:06,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:53:06" (1/1) ... [2022-11-23 13:53:06,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:53:07,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:53:07,211 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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i[949,962] [2022-11-23 13:53:07,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:53:07,565 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:53:07,578 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_b3670da4-184d-42cb-a397-c5d2d9c14ee0/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i[949,962] [2022-11-23 13:53:07,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:53:07,660 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:53:07,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07 WrapperNode [2022-11-23 13:53:07,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:53:07,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:53:07,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:53:07,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:53:07,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,764 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-11-23 13:53:07,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:53:07,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:53:07,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:53:07,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:53:07,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,793 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:53:07,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:53:07,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:53:07,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:53:07,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (1/1) ... [2022-11-23 13:53:07,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:53:07,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:07,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:53:07,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:53:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 13:53:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:53:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:53:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:53:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 13:53:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 13:53:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 13:53:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 13:53:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 13:53:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 13:53:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 13:53:07,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 13:53:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 13:53:07,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 13:53:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 13:53:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:53:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:53:07,917 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 13:53:08,175 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:53:08,178 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:53:08,650 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:53:08,781 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:53:08,781 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 13:53:08,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:08 BoogieIcfgContainer [2022-11-23 13:53:08,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:53:08,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:53:08,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:53:08,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:53:08,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:53:06" (1/3) ... [2022-11-23 13:53:08,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccc97a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:53:08, skipping insertion in model container [2022-11-23 13:53:08,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:07" (2/3) ... [2022-11-23 13:53:08,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccc97a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:53:08, skipping insertion in model container [2022-11-23 13:53:08,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:08" (3/3) ... [2022-11-23 13:53:08,793 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2022-11-23 13:53:08,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:53:08,811 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 13:53:08,811 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:53:08,900 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 13:53:08,953 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:53:08,981 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 151 transitions, 322 flow [2022-11-23 13:53:08,987 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 151 transitions, 322 flow [2022-11-23 13:53:08,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-23 13:53:09,111 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-23 13:53:09,111 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 13:53:09,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-23 13:53:09,123 INFO L119 LiptonReduction]: Number of co-enabled transitions 3670 [2022-11-23 13:53:20,150 INFO L134 LiptonReduction]: Checked pairs total: 9708 [2022-11-23 13:53:20,151 INFO L136 LiptonReduction]: Total number of compositions: 143 [2022-11-23 13:53:20,159 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-23 13:53:20,428 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 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-11-23 13:53:20,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:53:20,454 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;@4e82b0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:53:20,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 13:53:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 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-11-23 13:53:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 13:53:20,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:20,482 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 13:53:20,482 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash 623, now seen corresponding path program 1 times [2022-11-23 13:53:20,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:20,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281794438] [2022-11-23 13:53:20,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:20,513 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-11-23 13:53:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:20,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:20,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:20,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 13:53:20,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:20,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:20,655 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:20,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281794438] [2022-11-23 13:53:20,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281794438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:20,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:20,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 13:53:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546898048] [2022-11-23 13:53:20,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:20,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 13:53:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 13:53:20,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:53:20,701 INFO L87 Difference]: Start difference. First operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 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-11-23 13:53:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:21,062 INFO L93 Difference]: Finished difference Result 4850 states and 19358 transitions. [2022-11-23 13:53:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 13:53:21,064 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-11-23 13:53:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:21,119 INFO L225 Difference]: With dead ends: 4850 [2022-11-23 13:53:21,120 INFO L226 Difference]: Without dead ends: 4850 [2022-11-23 13:53:21,121 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-11-23 13:53:21,124 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:21,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2022-11-23 13:53:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4850. [2022-11-23 13:53:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4850 states, 4845 states have (on average 3.995459236326109) internal successors, (19358), 4849 states have internal predecessors, (19358), 0 states have call successors, (0), 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-11-23 13:53:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 19358 transitions. [2022-11-23 13:53:21,514 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 19358 transitions. Word has length 1 [2022-11-23 13:53:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:21,515 INFO L495 AbstractCegarLoop]: Abstraction has 4850 states and 19358 transitions. [2022-11-23 13:53:21,515 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-11-23 13:53:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 19358 transitions. [2022-11-23 13:53:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 13:53:21,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:21,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:21,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:21,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:21,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1772907556, now seen corresponding path program 1 times [2022-11-23 13:53:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:21,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514249717] [2022-11-23 13:53:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:21,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-11-23 13:53:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:21,737 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:21,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:21,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:53:21,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:21,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:21,880 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:21,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514249717] [2022-11-23 13:53:21,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514249717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:21,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:21,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:53:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067300527] [2022-11-23 13:53:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:21,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:21,884 INFO L87 Difference]: Start difference. First operand 4850 states and 19358 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-23 13:53:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:22,150 INFO L93 Difference]: Finished difference Result 3970 states and 15654 transitions. [2022-11-23 13:53:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-23 13:53:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:22,180 INFO L225 Difference]: With dead ends: 3970 [2022-11-23 13:53:22,180 INFO L226 Difference]: Without dead ends: 3850 [2022-11-23 13:53:22,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-23 13:53:22,182 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:22,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-11-23 13:53:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3850. [2022-11-23 13:53:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3848 states have (on average 3.9625779625779627) internal successors, (15248), 3849 states have internal predecessors, (15248), 0 states have call successors, (0), 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-11-23 13:53:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 15248 transitions. [2022-11-23 13:53:22,559 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 15248 transitions. Word has length 7 [2022-11-23 13:53:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:22,574 INFO L495 AbstractCegarLoop]: Abstraction has 3850 states and 15248 transitions. [2022-11-23 13:53:22,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-23 13:53:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 15248 transitions. [2022-11-23 13:53:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:53:22,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:22,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:22,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:22,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:22,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash -726991152, now seen corresponding path program 1 times [2022-11-23 13:53:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:22,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368606454] [2022-11-23 13:53:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:22,782 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-11-23 13:53:22,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:22,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:22,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:22,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:53:22,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:23,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:23,021 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:23,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368606454] [2022-11-23 13:53:23,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368606454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:23,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:23,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:53:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99428534] [2022-11-23 13:53:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:23,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:23,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:23,027 INFO L87 Difference]: Start difference. First operand 3850 states and 15248 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-11-23 13:53:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:23,302 INFO L93 Difference]: Finished difference Result 3250 states and 11398 transitions. [2022-11-23 13:53:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:23,303 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-11-23 13:53:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:23,322 INFO L225 Difference]: With dead ends: 3250 [2022-11-23 13:53:23,323 INFO L226 Difference]: Without dead ends: 2650 [2022-11-23 13:53:23,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-23 13:53:23,324 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:23,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 20 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-11-23 13:53:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2022-11-23 13:53:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2648 states have (on average 3.4924471299093653) internal successors, (9248), 2649 states have internal predecessors, (9248), 0 states have call successors, (0), 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-11-23 13:53:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 9248 transitions. [2022-11-23 13:53:23,443 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 9248 transitions. Word has length 12 [2022-11-23 13:53:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:23,444 INFO L495 AbstractCegarLoop]: Abstraction has 2650 states and 9248 transitions. [2022-11-23 13:53:23,444 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-11-23 13:53:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 9248 transitions. [2022-11-23 13:53:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 13:53:23,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:23,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:23,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:23,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:23,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1005051214, now seen corresponding path program 1 times [2022-11-23 13:53:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:23,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89524088] [2022-11-23 13:53:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:23,676 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-11-23 13:53:23,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:23,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:23,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:23,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:53:23,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:23,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:23,866 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:23,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89524088] [2022-11-23 13:53:23,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89524088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:23,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:23,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:53:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451608516] [2022-11-23 13:53:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:23,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:23,868 INFO L87 Difference]: Start difference. First operand 2650 states and 9248 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:24,140 INFO L93 Difference]: Finished difference Result 1770 states and 5486 transitions. [2022-11-23 13:53:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:53:24,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 13:53:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:24,150 INFO L225 Difference]: With dead ends: 1770 [2022-11-23 13:53:24,150 INFO L226 Difference]: Without dead ends: 1410 [2022-11-23 13:53:24,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:24,151 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:24,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 36 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-11-23 13:53:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2022-11-23 13:53:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1408 states have (on average 3.0454545454545454) internal successors, (4288), 1409 states have internal predecessors, (4288), 0 states have call successors, (0), 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-11-23 13:53:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 4288 transitions. [2022-11-23 13:53:24,233 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 4288 transitions. Word has length 15 [2022-11-23 13:53:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:24,234 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 4288 transitions. [2022-11-23 13:53:24,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 4288 transitions. [2022-11-23 13:53:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 13:53:24,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:24,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:24,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:24,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:24,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:24,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash 686931217, now seen corresponding path program 1 times [2022-11-23 13:53:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:24,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408717892] [2022-11-23 13:53:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:24,453 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-11-23 13:53:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:24,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:24,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:24,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 13:53:24,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:24,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:24,667 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:24,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408717892] [2022-11-23 13:53:24,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408717892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:24,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:24,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:53:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055849500] [2022-11-23 13:53:24,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:24,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:53:24,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:53:24,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:24,670 INFO L87 Difference]: Start difference. First operand 1410 states and 4288 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:25,050 INFO L93 Difference]: Finished difference Result 1047 states and 3164 transitions. [2022-11-23 13:53:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:53:25,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-23 13:53:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:25,057 INFO L225 Difference]: With dead ends: 1047 [2022-11-23 13:53:25,057 INFO L226 Difference]: Without dead ends: 935 [2022-11-23 13:53:25,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:25,058 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:25,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:53:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2022-11-23 13:53:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2022-11-23 13:53:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 933 states have (on average 3.0685959271168275) internal successors, (2863), 934 states have internal predecessors, (2863), 0 states have call successors, (0), 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-11-23 13:53:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2863 transitions. [2022-11-23 13:53:25,096 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2863 transitions. Word has length 19 [2022-11-23 13:53:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:25,096 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 2863 transitions. [2022-11-23 13:53:25,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2863 transitions. [2022-11-23 13:53:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 13:53:25,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:25,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:25,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:25,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:25,313 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:25,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:25,314 INFO L85 PathProgramCache]: Analyzing trace with hash -152960689, now seen corresponding path program 1 times [2022-11-23 13:53:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:25,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563578265] [2022-11-23 13:53:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:25,317 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-11-23 13:53:25,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:25,319 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:25,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:25,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:53:25,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:25,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:25,559 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:25,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563578265] [2022-11-23 13:53:25,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563578265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:25,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:25,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:53:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701782687] [2022-11-23 13:53:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:25,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:53:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:25,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:53:25,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:25,563 INFO L87 Difference]: Start difference. First operand 935 states and 2863 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:26,047 INFO L93 Difference]: Finished difference Result 872 states and 2735 transitions. [2022-11-23 13:53:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:53:26,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-23 13:53:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:26,052 INFO L225 Difference]: With dead ends: 872 [2022-11-23 13:53:26,052 INFO L226 Difference]: Without dead ends: 855 [2022-11-23 13:53:26,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:53:26,053 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 69 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:26,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 96 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:53:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-11-23 13:53:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-11-23 13:53:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 853 states have (on average 3.168815943728019) internal successors, (2703), 854 states have internal predecessors, (2703), 0 states have call successors, (0), 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-11-23 13:53:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2703 transitions. [2022-11-23 13:53:26,082 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2703 transitions. Word has length 23 [2022-11-23 13:53:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:26,083 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 2703 transitions. [2022-11-23 13:53:26,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2703 transitions. [2022-11-23 13:53:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:53:26,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:26,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:26,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:26,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:26,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1473752827, now seen corresponding path program 1 times [2022-11-23 13:53:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:26,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200344193] [2022-11-23 13:53:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:26,300 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-11-23 13:53:26,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:26,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:26,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:26,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:53:26,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:26,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:26,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:26,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200344193] [2022-11-23 13:53:26,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200344193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:26,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:26,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:53:26,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001282197] [2022-11-23 13:53:26,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:26,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:26,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:26,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:26,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:26,674 INFO L87 Difference]: Start difference. First operand 855 states and 2703 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:26,853 INFO L93 Difference]: Finished difference Result 1195 states and 3679 transitions. [2022-11-23 13:53:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:53:26,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:53:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:26,858 INFO L225 Difference]: With dead ends: 1195 [2022-11-23 13:53:26,858 INFO L226 Difference]: Without dead ends: 1195 [2022-11-23 13:53:26,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-11-23 13:53:26,859 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:26,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-11-23 13:53:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1194. [2022-11-23 13:53:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1192 states have (on average 3.0864093959731544) internal successors, (3679), 1193 states have internal predecessors, (3679), 0 states have call successors, (0), 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-11-23 13:53:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 3679 transitions. [2022-11-23 13:53:26,899 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 3679 transitions. Word has length 28 [2022-11-23 13:53:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:26,899 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 3679 transitions. [2022-11-23 13:53:26,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 3679 transitions. [2022-11-23 13:53:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:53:26,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:26,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:26,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:27,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:27,116 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1473752807, now seen corresponding path program 1 times [2022-11-23 13:53:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:27,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957701961] [2022-11-23 13:53:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:27,117 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-11-23 13:53:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:27,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:27,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:27,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:53:27,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:28,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:28,008 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:28,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957701961] [2022-11-23 13:53:28,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957701961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:28,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:28,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:53:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668589200] [2022-11-23 13:53:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:28,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:53:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:28,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:53:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:28,010 INFO L87 Difference]: Start difference. First operand 1194 states and 3679 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:28,460 INFO L93 Difference]: Finished difference Result 1193 states and 3677 transitions. [2022-11-23 13:53:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:53:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:53:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:28,463 INFO L225 Difference]: With dead ends: 1193 [2022-11-23 13:53:28,463 INFO L226 Difference]: Without dead ends: 518 [2022-11-23 13:53:28,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:28,464 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:28,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 40 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:53:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-11-23 13:53:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2022-11-23 13:53:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 2.858800773694391) internal successors, (1478), 517 states have internal predecessors, (1478), 0 states have call successors, (0), 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-11-23 13:53:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1478 transitions. [2022-11-23 13:53:28,482 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1478 transitions. Word has length 28 [2022-11-23 13:53:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:28,484 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 1478 transitions. [2022-11-23 13:53:28,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1478 transitions. [2022-11-23 13:53:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:53:28,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:28,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:28,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:28,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:28,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1840203963, now seen corresponding path program 2 times [2022-11-23 13:53:28,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:28,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021321795] [2022-11-23 13:53:28,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:53:28,700 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-11-23 13:53:28,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:28,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:28,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:28,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 13:53:28,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:28,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:53:28,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:29,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:29,033 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:29,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021321795] [2022-11-23 13:53:29,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021321795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:29,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:29,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:53:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763413850] [2022-11-23 13:53:29,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:29,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:29,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:29,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:29,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:29,036 INFO L87 Difference]: Start difference. First operand 518 states and 1478 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:29,262 INFO L93 Difference]: Finished difference Result 686 states and 1933 transitions. [2022-11-23 13:53:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:29,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:53:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:29,264 INFO L225 Difference]: With dead ends: 686 [2022-11-23 13:53:29,264 INFO L226 Difference]: Without dead ends: 215 [2022-11-23 13:53:29,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:29,265 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:29,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-23 13:53:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-11-23 13:53:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.542056074766355) internal successors, (544), 214 states have internal predecessors, (544), 0 states have call successors, (0), 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-11-23 13:53:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 544 transitions. [2022-11-23 13:53:29,277 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 544 transitions. Word has length 28 [2022-11-23 13:53:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:29,277 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 544 transitions. [2022-11-23 13:53:29,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 544 transitions. [2022-11-23 13:53:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:53:29,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:29,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:29,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:29,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:29,508 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1260763041, now seen corresponding path program 3 times [2022-11-23 13:53:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:29,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316162664] [2022-11-23 13:53:29,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:53:29,509 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-11-23 13:53:29,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:29,511 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:29,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:29,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 13:53:29,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:29,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:53:29,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:29,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:29,805 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:29,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316162664] [2022-11-23 13:53:29,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316162664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:29,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:29,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:53:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006810477] [2022-11-23 13:53:29,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:29,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:29,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:29,809 INFO L87 Difference]: Start difference. First operand 215 states and 544 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:29,990 INFO L93 Difference]: Finished difference Result 332 states and 836 transitions. [2022-11-23 13:53:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:53:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:29,992 INFO L225 Difference]: With dead ends: 332 [2022-11-23 13:53:29,992 INFO L226 Difference]: Without dead ends: 139 [2022-11-23 13:53:29,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:29,993 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:29,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 17 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-23 13:53:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-23 13:53:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.347826086956522) internal successors, (324), 138 states have internal predecessors, (324), 0 states have call successors, (0), 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-11-23 13:53:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 324 transitions. [2022-11-23 13:53:30,000 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 324 transitions. Word has length 28 [2022-11-23 13:53:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:30,000 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 324 transitions. [2022-11-23 13:53:30,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 324 transitions. [2022-11-23 13:53:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:53:30,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:30,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:30,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:30,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:30,214 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:30,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash -861265123, now seen corresponding path program 4 times [2022-11-23 13:53:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:30,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643166219] [2022-11-23 13:53:30,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:53:30,217 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-11-23 13:53:30,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:30,218 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:30,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 13:53:30,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:53:30,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:30,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:53:30,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:30,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:30,885 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:30,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643166219] [2022-11-23 13:53:30,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643166219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:30,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:30,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 13:53:30,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097856363] [2022-11-23 13:53:30,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:30,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 13:53:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:30,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 13:53:30,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:53:30,887 INFO L87 Difference]: Start difference. First operand 139 states and 324 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:31,159 INFO L93 Difference]: Finished difference Result 178 states and 411 transitions. [2022-11-23 13:53:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:53:31,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-23 13:53:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:31,160 INFO L225 Difference]: With dead ends: 178 [2022-11-23 13:53:31,160 INFO L226 Difference]: Without dead ends: 127 [2022-11-23 13:53:31,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:53:31,161 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:31,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 26 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-23 13:53:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2022-11-23 13:53:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.1403508771929824) internal successors, (244), 114 states have internal predecessors, (244), 0 states have call successors, (0), 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-11-23 13:53:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 244 transitions. [2022-11-23 13:53:31,165 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 244 transitions. Word has length 28 [2022-11-23 13:53:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:31,165 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 244 transitions. [2022-11-23 13:53:31,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 244 transitions. [2022-11-23 13:53:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 13:53:31,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:31,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:31,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:31,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:31,367 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash -894763903, now seen corresponding path program 5 times [2022-11-23 13:53:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:31,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084161775] [2022-11-23 13:53:31,368 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 13:53:31,368 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-11-23 13:53:31,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:31,370 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:31,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-23 13:53:31,591 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 13:53:31,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 13:53:31,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:53:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:53:31,778 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 13:53:31,778 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:53:31,780 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 13:53:31,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 13:53:31,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 13:53:31,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 13:53:31,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 13:53:31,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 13:53:31,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 13:53:31,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 13:53:31,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 13:53:31,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 13:53:31,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 13:53:31,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 13:53:31,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 13:53:31,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 13:53:31,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 13:53:31,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 13:53:31,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:32,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/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-11-23 13:53:32,010 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:32,015 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 13:53:32,015 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:53:32,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:53:32 BasicIcfg [2022-11-23 13:53:32,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:53:32,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:53:32,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:53:32,152 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:53:32,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:08" (3/4) ... [2022-11-23 13:53:32,155 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 13:53:32,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:53:32,156 INFO L158 Benchmark]: Toolchain (without parser) took 25205.66ms. Allocated memory was 104.9MB in the beginning and 367.0MB in the end (delta: 262.1MB). Free memory was 81.2MB in the beginning and 142.9MB in the end (delta: -61.7MB). Peak memory consumption was 202.9MB. Max. memory is 16.1GB. [2022-11-23 13:53:32,156 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 73.4MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:53:32,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.84ms. Allocated memory is still 104.9MB. Free memory was 80.9MB in the beginning and 56.5MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 13:53:32,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.48ms. Allocated memory is still 104.9MB. Free memory was 56.5MB in the beginning and 82.5MB in the end (delta: -26.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-11-23 13:53:32,157 INFO L158 Benchmark]: Boogie Preprocessor took 34.00ms. Allocated memory is still 104.9MB. Free memory was 82.5MB in the beginning and 80.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:32,158 INFO L158 Benchmark]: RCFGBuilder took 984.39ms. Allocated memory is still 104.9MB. Free memory was 80.5MB in the beginning and 64.8MB in the end (delta: 15.6MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2022-11-23 13:53:32,158 INFO L158 Benchmark]: TraceAbstraction took 23364.92ms. Allocated memory was 104.9MB in the beginning and 367.0MB in the end (delta: 262.1MB). Free memory was 64.3MB in the beginning and 144.0MB in the end (delta: -79.7MB). Peak memory consumption was 180.9MB. Max. memory is 16.1GB. [2022-11-23 13:53:32,158 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 367.0MB. Free memory was 144.0MB in the beginning and 142.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:32,160 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.31ms. Allocated memory is still 73.4MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.84ms. Allocated memory is still 104.9MB. Free memory was 80.9MB in the beginning and 56.5MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.48ms. Allocated memory is still 104.9MB. Free memory was 56.5MB in the beginning and 82.5MB in the end (delta: -26.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.00ms. Allocated memory is still 104.9MB. Free memory was 82.5MB in the beginning and 80.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 984.39ms. Allocated memory is still 104.9MB. Free memory was 80.5MB in the beginning and 64.8MB in the end (delta: 15.6MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23364.92ms. Allocated memory was 104.9MB in the beginning and 367.0MB in the end (delta: 262.1MB). Free memory was 64.3MB in the beginning and 144.0MB in the end (delta: -79.7MB). Peak memory consumption was 180.9MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 367.0MB. Free memory was 144.0MB in the beginning and 142.9MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 162 PlacesBefore, 56 PlacesAfterwards, 151 TransitionsBefore, 44 TransitionsAfterwards, 3670 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 143 TotalNumberOfCompositions, 9708 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5238, independent: 5023, independent conditional: 0, independent unconditional: 5023, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2496, independent: 2431, independent conditional: 0, independent unconditional: 2431, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2496, independent: 2398, independent conditional: 0, independent unconditional: 2398, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 524, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 447, dependent conditional: 0, dependent unconditional: 447, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5238, independent: 2592, independent conditional: 0, independent unconditional: 2592, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 2496, unknown conditional: 0, unknown unconditional: 2496] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 302, Positive conditional cache size: 0, Positive unconditional cache size: 302, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1081, ((void *)0), P0, ((void *)0))=-1, t1081={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1082, ((void *)0), P1, ((void *)0))=0, t1081={11:0}, t1082={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1083, ((void *)0), P2, ((void *)0))=1, t1081={11:0}, t1082={15:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t1084; [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1084, ((void *)0), P3, ((void *)0))=2, t1081={11:0}, t1082={15:0}, t1083={7:0}, t1084={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 4 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 4 a = 1 [L823] 4 __unbuffered_p3_EAX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 b = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L755] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={11:0}, t1082={15:0}, t1083={7:0}, t1084={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: -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: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 188 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1736 IncrementalHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 103 mSDtfsCounter, 1736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5140occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 206 ConstructedInterpolants, 13 QuantifiedInterpolants, 1891 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1750 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 13:53:32,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3670da4-184d-42cb-a397-c5d2d9c14ee0/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample