./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS --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 e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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-8393723 [2022-11-19 06:49:20,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:49:20,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:49:20,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:49:20,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:49:20,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:49:20,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:49:20,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:49:20,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:49:20,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:49:20,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:49:20,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:49:20,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:49:20,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:49:20,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:49:20,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:49:20,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:49:20,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:49:20,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:49:20,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:49:20,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:49:20,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:49:20,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:49:20,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:49:20,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:49:20,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:49:20,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:49:20,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:49:20,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:49:20,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:49:20,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:49:20,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:49:20,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:49:20,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:49:20,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:49:20,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:49:20,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:49:20,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:49:20,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:49:20,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:49:20,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:49:20,899 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 06:49:20,927 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:49:20,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:49:20,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:49:20,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:49:20,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:49:20,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:49:20,929 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:49:20,930 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:49:20,930 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:49:20,930 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:49:20,930 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:49:20,931 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:49:20,931 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:49:20,931 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:49:20,931 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:49:20,932 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:49:20,932 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:49:20,932 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:49:20,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 06:49:20,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 06:49:20,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:49:20,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:49:20,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:49:20,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:49:20,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:49:20,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:49:20,935 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 06:49:20,935 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 06:49:20,936 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 06:49:20,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:49:20,936 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 06:49:20,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:49:20,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:49:20,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:49:20,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:49:20,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:49:20,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:49:20,938 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:49:20,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:49:20,938 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:49:20,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:49:20,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:49:20,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_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-11-19 06:49:21,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:49:21,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:49:21,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:49:21,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:49:21,295 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:49:21,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-19 06:49:21,363 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data/862ade273/a3a4c566d44646a381e5d85871ee2d44/FLAG8207c37df [2022-11-19 06:49:21,934 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:49:21,935 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-19 06:49:21,950 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data/862ade273/a3a4c566d44646a381e5d85871ee2d44/FLAG8207c37df [2022-11-19 06:49:22,250 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data/862ade273/a3a4c566d44646a381e5d85871ee2d44 [2022-11-19 06:49:22,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:49:22,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:49:22,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:49:22,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:49:22,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:49:22,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:22,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196c9ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22, skipping insertion in model container [2022-11-19 06:49:22,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:22,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:49:22,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:49:22,537 WARN L234 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_7ccf07d2-899d-4464-9666-bc015dbbe536/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-19 06:49:22,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:49:22,759 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:49:22,776 WARN L234 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_7ccf07d2-899d-4464-9666-bc015dbbe536/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-19 06:49:22,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:49:22,927 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:49:22,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22 WrapperNode [2022-11-19 06:49:22,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:49:22,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:49:22,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:49:22,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:49:22,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:22,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,008 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-11-19 06:49:23,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:49:23,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:49:23,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:49:23,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:49:23,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,057 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:49:23,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:49:23,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:49:23,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:49:23,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (1/1) ... [2022-11-19 06:49:23,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:49:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:23,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:49:23,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 06:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 06:49:23,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 06:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 06:49:23,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 06:49:23,150 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 06:49:23,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 06:49:23,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:49:23,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 06:49:23,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:49:23,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:49:23,153 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 06:49:23,301 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:49:23,303 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:49:23,780 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:49:23,972 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:49:23,972 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:49:23,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:23 BoogieIcfgContainer [2022-11-19 06:49:23,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:49:23,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:49:23,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:49:23,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:49:23,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:49:22" (1/3) ... [2022-11-19 06:49:23,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140f6cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:49:23, skipping insertion in model container [2022-11-19 06:49:23,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:22" (2/3) ... [2022-11-19 06:49:23,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140f6cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:49:23, skipping insertion in model container [2022-11-19 06:49:23,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:23" (3/3) ... [2022-11-19 06:49:23,987 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-11-19 06:49:24,005 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:49:24,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 06:49:24,006 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 06:49:24,061 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 06:49:24,108 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 06:49:24,123 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 134 transitions, 283 flow [2022-11-19 06:49:24,126 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 134 transitions, 283 flow [2022-11-19 06:49:24,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 134 transitions, 283 flow [2022-11-19 06:49:24,179 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-19 06:49:24,179 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 06:49:24,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-11-19 06:49:24,187 INFO L119 LiptonReduction]: Number of co-enabled transitions 2824 [2022-11-19 06:49:30,161 INFO L134 LiptonReduction]: Checked pairs total: 8308 [2022-11-19 06:49:30,161 INFO L136 LiptonReduction]: Total number of compositions: 135 [2022-11-19 06:49:30,171 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 38 transitions, 91 flow [2022-11-19 06:49:30,315 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 0 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-19 06:49:30,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:49:30,342 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;@669a8c92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:49:30,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 06:49:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 0 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-19 06:49:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 06:49:30,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:30,357 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 06:49:30,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash 576, now seen corresponding path program 1 times [2022-11-19 06:49:30,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:30,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748405627] [2022-11-19 06:49:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:30,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:30,507 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-19 06:49:30,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:30,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748405627] [2022-11-19 06:49:30,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748405627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:30,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:30,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 06:49:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326522092] [2022-11-19 06:49:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:30,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 06:49:30,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 06:49:30,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 06:49:30,551 INFO L87 Difference]: Start difference. First operand has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 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-19 06:49:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:30,680 INFO L93 Difference]: Finished difference Result 1684 states and 5558 transitions. [2022-11-19 06:49:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 06:49:30,683 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-19 06:49:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:30,715 INFO L225 Difference]: With dead ends: 1684 [2022-11-19 06:49:30,715 INFO L226 Difference]: Without dead ends: 1684 [2022-11-19 06:49:30,716 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-19 06:49:30,722 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:30,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-11-19 06:49:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2022-11-19 06:49:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1679 states have (on average 3.310303752233472) internal successors, (5558), 1683 states have internal predecessors, (5558), 0 states have call successors, (0), 0 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-19 06:49:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 5558 transitions. [2022-11-19 06:49:30,923 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 5558 transitions. Word has length 1 [2022-11-19 06:49:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:30,924 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 5558 transitions. [2022-11-19 06:49:30,930 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-19 06:49:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 5558 transitions. [2022-11-19 06:49:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 06:49:30,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:30,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 06:49:30,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:49:30,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:30,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 565749, now seen corresponding path program 1 times [2022-11-19 06:49:30,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:30,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723632624] [2022-11-19 06:49:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:31,255 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-19 06:49:31,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:31,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723632624] [2022-11-19 06:49:31,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723632624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:31,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:31,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:49:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210493722] [2022-11-19 06:49:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:31,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:49:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:31,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:49:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:31,260 INFO L87 Difference]: Start difference. First operand 1684 states and 5558 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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-19 06:49:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:31,389 INFO L93 Difference]: Finished difference Result 1418 states and 4632 transitions. [2022-11-19 06:49:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:49:31,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-19 06:49:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:31,402 INFO L225 Difference]: With dead ends: 1418 [2022-11-19 06:49:31,402 INFO L226 Difference]: Without dead ends: 1382 [2022-11-19 06:49:31,404 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-19 06:49:31,405 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:31,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-11-19 06:49:31,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2022-11-19 06:49:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1380 states have (on average 3.2869565217391306) internal successors, (4536), 1381 states have internal predecessors, (4536), 0 states have call successors, (0), 0 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-19 06:49:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 4536 transitions. [2022-11-19 06:49:31,505 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 4536 transitions. Word has length 3 [2022-11-19 06:49:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:31,505 INFO L495 AbstractCegarLoop]: Abstraction has 1382 states and 4536 transitions. [2022-11-19 06:49:31,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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-19 06:49:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 4536 transitions. [2022-11-19 06:49:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 06:49:31,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:31,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:31,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:49:31,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash -556120754, now seen corresponding path program 1 times [2022-11-19 06:49:31,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:31,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660229684] [2022-11-19 06:49:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:31,912 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-19 06:49:31,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660229684] [2022-11-19 06:49:31,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660229684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:31,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:31,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:49:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967440731] [2022-11-19 06:49:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:31,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:49:31,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:49:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:31,915 INFO L87 Difference]: Start difference. First operand 1382 states and 4536 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:32,132 INFO L93 Difference]: Finished difference Result 1790 states and 5744 transitions. [2022-11-19 06:49:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:49:32,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 06:49:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:32,183 INFO L225 Difference]: With dead ends: 1790 [2022-11-19 06:49:32,183 INFO L226 Difference]: Without dead ends: 1790 [2022-11-19 06:49:32,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:32,185 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:32,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 12 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:49:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2022-11-19 06:49:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1582. [2022-11-19 06:49:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1580 states have (on average 3.3088607594936708) internal successors, (5228), 1581 states have internal predecessors, (5228), 0 states have call successors, (0), 0 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-19 06:49:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 5228 transitions. [2022-11-19 06:49:32,267 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 5228 transitions. Word has length 10 [2022-11-19 06:49:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:32,270 INFO L495 AbstractCegarLoop]: Abstraction has 1582 states and 5228 transitions. [2022-11-19 06:49:32,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 5228 transitions. [2022-11-19 06:49:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 06:49:32,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:32,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:32,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:49:32,277 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash -556120690, now seen corresponding path program 1 times [2022-11-19 06:49:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:32,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037075029] [2022-11-19 06:49:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:32,814 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-19 06:49:32,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:32,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037075029] [2022-11-19 06:49:32,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037075029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:32,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:32,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:49:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115996262] [2022-11-19 06:49:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:32,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:49:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:49:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:49:32,817 INFO L87 Difference]: Start difference. First operand 1582 states and 5228 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:33,056 INFO L93 Difference]: Finished difference Result 2254 states and 7134 transitions. [2022-11-19 06:49:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:49:33,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 06:49:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:33,070 INFO L225 Difference]: With dead ends: 2254 [2022-11-19 06:49:33,070 INFO L226 Difference]: Without dead ends: 2038 [2022-11-19 06:49:33,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:49:33,073 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:33,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:49:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2022-11-19 06:49:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1894. [2022-11-19 06:49:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1892 states have (on average 3.2970401691331923) internal successors, (6238), 1893 states have internal predecessors, (6238), 0 states have call successors, (0), 0 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-19 06:49:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 6238 transitions. [2022-11-19 06:49:33,148 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 6238 transitions. Word has length 10 [2022-11-19 06:49:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:33,149 INFO L495 AbstractCegarLoop]: Abstraction has 1894 states and 6238 transitions. [2022-11-19 06:49:33,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 6238 transitions. [2022-11-19 06:49:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:49:33,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:33,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:33,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:49:33,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:33,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash 523173245, now seen corresponding path program 1 times [2022-11-19 06:49:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238319540] [2022-11-19 06:49:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:33,370 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-19 06:49:33,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:33,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238319540] [2022-11-19 06:49:33,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238319540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:33,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:33,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:49:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295346077] [2022-11-19 06:49:33,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:49:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:49:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:33,379 INFO L87 Difference]: Start difference. First operand 1894 states and 6238 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-19 06:49:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:33,571 INFO L93 Difference]: Finished difference Result 1958 states and 6310 transitions. [2022-11-19 06:49:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:49:33,571 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-19 06:49:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:33,582 INFO L225 Difference]: With dead ends: 1958 [2022-11-19 06:49:33,582 INFO L226 Difference]: Without dead ends: 1766 [2022-11-19 06:49:33,582 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-19 06:49:33,583 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:33,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:49:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2022-11-19 06:49:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2022-11-19 06:49:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 3.2732426303854876) internal successors, (5774), 1765 states have internal predecessors, (5774), 0 states have call successors, (0), 0 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-19 06:49:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 5774 transitions. [2022-11-19 06:49:33,668 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 5774 transitions. Word has length 12 [2022-11-19 06:49:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:33,669 INFO L495 AbstractCegarLoop]: Abstraction has 1766 states and 5774 transitions. [2022-11-19 06:49:33,669 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-19 06:49:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 5774 transitions. [2022-11-19 06:49:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:49:33,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:33,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:33,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 06:49:33,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1856908857, now seen corresponding path program 1 times [2022-11-19 06:49:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:33,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684651126] [2022-11-19 06:49:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:33,895 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-19 06:49:33,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:33,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684651126] [2022-11-19 06:49:33,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684651126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:33,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:33,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:49:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091612512] [2022-11-19 06:49:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:33,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:49:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:49:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:33,900 INFO L87 Difference]: Start difference. First operand 1766 states and 5774 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-19 06:49:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:34,119 INFO L93 Difference]: Finished difference Result 2006 states and 6322 transitions. [2022-11-19 06:49:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:49:34,120 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-19 06:49:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:34,132 INFO L225 Difference]: With dead ends: 2006 [2022-11-19 06:49:34,132 INFO L226 Difference]: Without dead ends: 1862 [2022-11-19 06:49:34,132 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-19 06:49:34,134 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 43 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:34,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 16 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:49:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2022-11-19 06:49:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1766. [2022-11-19 06:49:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 3.2324263038548753) internal successors, (5702), 1765 states have internal predecessors, (5702), 0 states have call successors, (0), 0 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-19 06:49:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 5702 transitions. [2022-11-19 06:49:34,271 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 5702 transitions. Word has length 12 [2022-11-19 06:49:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:34,272 INFO L495 AbstractCegarLoop]: Abstraction has 1766 states and 5702 transitions. [2022-11-19 06:49:34,273 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-19 06:49:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 5702 transitions. [2022-11-19 06:49:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:49:34,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:34,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:34,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:49:34,276 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1886523143, now seen corresponding path program 1 times [2022-11-19 06:49:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:34,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547491153] [2022-11-19 06:49:34,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:34,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:49:34,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:34,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547491153] [2022-11-19 06:49:34,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547491153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:34,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:34,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:49:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047515983] [2022-11-19 06:49:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:34,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:49:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:34,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:49:34,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:49:34,669 INFO L87 Difference]: Start difference. First operand 1766 states and 5702 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:34,859 INFO L93 Difference]: Finished difference Result 1622 states and 5114 transitions. [2022-11-19 06:49:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:49:34,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 06:49:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:34,868 INFO L225 Difference]: With dead ends: 1622 [2022-11-19 06:49:34,868 INFO L226 Difference]: Without dead ends: 1478 [2022-11-19 06:49:34,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:49:34,869 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:34,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:49:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-11-19 06:49:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 926. [2022-11-19 06:49:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 3.1437837837837836) internal successors, (2908), 925 states have internal predecessors, (2908), 0 states have call successors, (0), 0 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-19 06:49:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2908 transitions. [2022-11-19 06:49:34,908 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 2908 transitions. Word has length 12 [2022-11-19 06:49:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:34,909 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 2908 transitions. [2022-11-19 06:49:34,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 2908 transitions. [2022-11-19 06:49:34,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 06:49:34,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:34,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:34,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 06:49:34,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash 193432539, now seen corresponding path program 1 times [2022-11-19 06:49:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:34,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623498589] [2022-11-19 06:49:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:35,032 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-19 06:49:35,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:35,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623498589] [2022-11-19 06:49:35,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623498589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:35,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:35,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:49:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814700687] [2022-11-19 06:49:35,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:35,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:49:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:35,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:49:35,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:35,035 INFO L87 Difference]: Start difference. First operand 926 states and 2908 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:35,146 INFO L93 Difference]: Finished difference Result 958 states and 2940 transitions. [2022-11-19 06:49:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:49:35,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 06:49:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:35,152 INFO L225 Difference]: With dead ends: 958 [2022-11-19 06:49:35,152 INFO L226 Difference]: Without dead ends: 862 [2022-11-19 06:49:35,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:35,153 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:35,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-11-19 06:49:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-11-19 06:49:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 3.1173054587688735) internal successors, (2684), 861 states have internal predecessors, (2684), 0 states have call successors, (0), 0 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-19 06:49:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2684 transitions. [2022-11-19 06:49:35,181 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 2684 transitions. Word has length 14 [2022-11-19 06:49:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:35,182 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 2684 transitions. [2022-11-19 06:49:35,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 2684 transitions. [2022-11-19 06:49:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 06:49:35,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:35,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:35,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 06:49:35,184 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:35,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash 626431114, now seen corresponding path program 1 times [2022-11-19 06:49:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:35,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491841119] [2022-11-19 06:49:35,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:35,380 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-19 06:49:35,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:35,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491841119] [2022-11-19 06:49:35,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491841119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:35,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:35,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:49:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576172316] [2022-11-19 06:49:35,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:35,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:49:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:35,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:49:35,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:35,383 INFO L87 Difference]: Start difference. First operand 862 states and 2684 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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-19 06:49:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:35,444 INFO L93 Difference]: Finished difference Result 558 states and 1468 transitions. [2022-11-19 06:49:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:49:35,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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-19 06:49:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:35,447 INFO L225 Difference]: With dead ends: 558 [2022-11-19 06:49:35,448 INFO L226 Difference]: Without dead ends: 558 [2022-11-19 06:49:35,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:35,449 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:35,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-19 06:49:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2022-11-19 06:49:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.6355475763016156) internal successors, (1468), 557 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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-19 06:49:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1468 transitions. [2022-11-19 06:49:35,467 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1468 transitions. Word has length 16 [2022-11-19 06:49:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:35,468 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1468 transitions. [2022-11-19 06:49:35,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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-19 06:49:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1468 transitions. [2022-11-19 06:49:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 06:49:35,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:35,470 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-19 06:49:35,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 06:49:35,470 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:35,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:35,471 INFO L85 PathProgramCache]: Analyzing trace with hash -226292600, now seen corresponding path program 1 times [2022-11-19 06:49:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:35,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249772976] [2022-11-19 06:49:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:35,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:35,674 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-19 06:49:35,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:35,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249772976] [2022-11-19 06:49:35,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249772976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:35,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:35,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:49:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124382177] [2022-11-19 06:49:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:35,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:49:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:49:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:35,678 INFO L87 Difference]: Start difference. First operand 558 states and 1468 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-19 06:49:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:35,763 INFO L93 Difference]: Finished difference Result 354 states and 856 transitions. [2022-11-19 06:49:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:49:35,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-19 06:49:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:35,765 INFO L225 Difference]: With dead ends: 354 [2022-11-19 06:49:35,765 INFO L226 Difference]: Without dead ends: 354 [2022-11-19 06:49:35,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:35,766 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:35,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-19 06:49:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2022-11-19 06:49:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.424929178470255) internal successors, (856), 353 states have internal predecessors, (856), 0 states have call successors, (0), 0 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-19 06:49:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 856 transitions. [2022-11-19 06:49:35,778 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 856 transitions. Word has length 19 [2022-11-19 06:49:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:35,778 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 856 transitions. [2022-11-19 06:49:35,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-19 06:49:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 856 transitions. [2022-11-19 06:49:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:49:35,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:35,780 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-19 06:49:35,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 06:49:35,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash -847094901, now seen corresponding path program 1 times [2022-11-19 06:49:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:35,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950251093] [2022-11-19 06:49:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:35,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:36,213 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-19 06:49:36,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:36,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950251093] [2022-11-19 06:49:36,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950251093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:36,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:36,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:49:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534399026] [2022-11-19 06:49:36,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:36,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:49:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:36,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:49:36,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:49:36,216 INFO L87 Difference]: Start difference. First operand 354 states and 856 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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-19 06:49:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:36,710 INFO L93 Difference]: Finished difference Result 624 states and 1472 transitions. [2022-11-19 06:49:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 06:49:36,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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-19 06:49:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:36,713 INFO L225 Difference]: With dead ends: 624 [2022-11-19 06:49:36,713 INFO L226 Difference]: Without dead ends: 454 [2022-11-19 06:49:36,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-19 06:49:36,714 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 84 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:36,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 36 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:49:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-19 06:49:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 354. [2022-11-19 06:49:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.3342776203966005) internal successors, (824), 353 states have internal predecessors, (824), 0 states have call successors, (0), 0 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-19 06:49:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 824 transitions. [2022-11-19 06:49:36,726 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 824 transitions. Word has length 22 [2022-11-19 06:49:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:36,726 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 824 transitions. [2022-11-19 06:49:36,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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-19 06:49:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 824 transitions. [2022-11-19 06:49:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:49:36,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:36,728 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-19 06:49:36,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 06:49:36,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:36,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1850774645, now seen corresponding path program 1 times [2022-11-19 06:49:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:36,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308846857] [2022-11-19 06:49:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:37,357 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-19 06:49:37,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:37,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308846857] [2022-11-19 06:49:37,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308846857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:37,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:37,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:49:37,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974509125] [2022-11-19 06:49:37,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:37,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:49:37,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:37,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:49:37,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:49:37,359 INFO L87 Difference]: Start difference. First operand 354 states and 824 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-19 06:49:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:37,740 INFO L93 Difference]: Finished difference Result 588 states and 1314 transitions. [2022-11-19 06:49:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:49:37,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-19 06:49:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:37,744 INFO L225 Difference]: With dead ends: 588 [2022-11-19 06:49:37,744 INFO L226 Difference]: Without dead ends: 510 [2022-11-19 06:49:37,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-19 06:49:37,745 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:37,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 60 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:49:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-19 06:49:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 395. [2022-11-19 06:49:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.2918781725888326) internal successors, (903), 394 states have internal predecessors, (903), 0 states have call successors, (0), 0 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-19 06:49:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 903 transitions. [2022-11-19 06:49:37,760 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 903 transitions. Word has length 22 [2022-11-19 06:49:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:37,761 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 903 transitions. [2022-11-19 06:49:37,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-19 06:49:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 903 transitions. [2022-11-19 06:49:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:49:37,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:37,763 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-19 06:49:37,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 06:49:37,763 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1850917631, now seen corresponding path program 2 times [2022-11-19 06:49:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:37,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029545569] [2022-11-19 06:49:37,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:37,963 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-19 06:49:37,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:37,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029545569] [2022-11-19 06:49:37,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029545569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:37,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:37,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:49:37,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632639699] [2022-11-19 06:49:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:37,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:49:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:49:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:37,966 INFO L87 Difference]: Start difference. First operand 395 states and 903 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-19 06:49:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:38,062 INFO L93 Difference]: Finished difference Result 344 states and 801 transitions. [2022-11-19 06:49:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:49:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-19 06:49:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:38,065 INFO L225 Difference]: With dead ends: 344 [2022-11-19 06:49:38,065 INFO L226 Difference]: Without dead ends: 246 [2022-11-19 06:49:38,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:38,066 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:38,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 11 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-19 06:49:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-11-19 06:49:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.3183673469387753) internal successors, (568), 245 states have internal predecessors, (568), 0 states have call successors, (0), 0 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-19 06:49:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 568 transitions. [2022-11-19 06:49:38,074 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 568 transitions. Word has length 22 [2022-11-19 06:49:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:38,074 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 568 transitions. [2022-11-19 06:49:38,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-19 06:49:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 568 transitions. [2022-11-19 06:49:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:49:38,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:38,076 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-19 06:49:38,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 06:49:38,077 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1737794188, now seen corresponding path program 1 times [2022-11-19 06:49:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:38,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410424840] [2022-11-19 06:49:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:38,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:39,226 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-19 06:49:39,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410424840] [2022-11-19 06:49:39,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410424840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:39,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:39,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:49:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281985458] [2022-11-19 06:49:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:39,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:49:39,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:39,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:49:39,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:49:39,230 INFO L87 Difference]: Start difference. First operand 246 states and 568 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-19 06:49:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:39,537 INFO L93 Difference]: Finished difference Result 261 states and 591 transitions. [2022-11-19 06:49:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:49:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-19 06:49:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:39,539 INFO L225 Difference]: With dead ends: 261 [2022-11-19 06:49:39,539 INFO L226 Difference]: Without dead ends: 194 [2022-11-19 06:49:39,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:49:39,540 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:39,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 57 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:49:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-19 06:49:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2022-11-19 06:49:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.263803680981595) internal successors, (369), 163 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-19 06:49:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 369 transitions. [2022-11-19 06:49:39,546 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 369 transitions. Word has length 25 [2022-11-19 06:49:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:39,547 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 369 transitions. [2022-11-19 06:49:39,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-19 06:49:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 369 transitions. [2022-11-19 06:49:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:49:39,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:39,548 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-19 06:49:39,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 06:49:39,549 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1108436016, now seen corresponding path program 2 times [2022-11-19 06:49:39,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:39,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021221845] [2022-11-19 06:49:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:49:39,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 06:49:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:49:39,681 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 06:49:39,685 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 06:49:39,686 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 06:49:39,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 06:49:39,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 06:49:39,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 06:49:39,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 06:49:39,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 06:49:39,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 06:49:39,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 06:49:39,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 06:49:39,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 06:49:39,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 06:49:39,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 06:49:39,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 06:49:39,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 06:49:39,695 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:39,702 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 06:49:39,703 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:49:39,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:49:39 BasicIcfg [2022-11-19 06:49:39,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:49:39,826 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:49:39,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:49:39,827 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:49:39,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:23" (3/4) ... [2022-11-19 06:49:39,830 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 06:49:39,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:49:39,831 INFO L158 Benchmark]: Toolchain (without parser) took 17575.61ms. Allocated memory was 90.2MB in the beginning and 249.6MB in the end (delta: 159.4MB). Free memory was 51.9MB in the beginning and 132.8MB in the end (delta: -80.8MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2022-11-19 06:49:39,832 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 70.1MB in the beginning and 70.0MB in the end (delta: 79.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:49:39,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.16ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 51.8MB in the beginning and 73.8MB in the end (delta: -22.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-19 06:49:39,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.95ms. Allocated memory is still 111.1MB. Free memory was 73.8MB in the beginning and 71.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:49:39,833 INFO L158 Benchmark]: Boogie Preprocessor took 54.07ms. Allocated memory is still 111.1MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:49:39,833 INFO L158 Benchmark]: RCFGBuilder took 909.57ms. Allocated memory is still 111.1MB. Free memory was 69.2MB in the beginning and 76.4MB in the end (delta: -7.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2022-11-19 06:49:39,833 INFO L158 Benchmark]: TraceAbstraction took 15846.35ms. Allocated memory was 111.1MB in the beginning and 249.6MB in the end (delta: 138.4MB). Free memory was 75.7MB in the beginning and 132.8MB in the end (delta: -57.1MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2022-11-19 06:49:39,834 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 249.6MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:49:39,835 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.28ms. Allocated memory is still 90.2MB. Free memory was 70.1MB in the beginning and 70.0MB in the end (delta: 79.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.16ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 51.8MB in the beginning and 73.8MB in the end (delta: -22.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.95ms. Allocated memory is still 111.1MB. Free memory was 73.8MB in the beginning and 71.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.07ms. Allocated memory is still 111.1MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 909.57ms. Allocated memory is still 111.1MB. Free memory was 69.2MB in the beginning and 76.4MB in the end (delta: -7.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15846.35ms. Allocated memory was 111.1MB in the beginning and 249.6MB in the end (delta: 138.4MB). Free memory was 75.7MB in the beginning and 132.8MB in the end (delta: -57.1MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 249.6MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 142 PlacesBefore, 47 PlacesAfterwards, 134 TransitionsBefore, 38 TransitionsAfterwards, 2824 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 8308 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4409, independent: 4197, independent conditional: 0, independent unconditional: 4197, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1928, independent: 1873, independent conditional: 0, independent unconditional: 1873, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1928, independent: 1853, independent conditional: 0, independent unconditional: 1853, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 325, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4409, independent: 2324, independent conditional: 0, independent unconditional: 2324, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 1928, unknown conditional: 0, unknown unconditional: 1928] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, 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: [L721] 0 int __unbuffered_p2_EBX = 0; [L739] 0 _Bool a$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L725] 0 int a$mem_tmp; [L734] 0 _Bool a$read_delayed; [L715] 0 int __unbuffered_p1_EAX = 0; [L723] 0 int a = 0; [L733] 0 _Bool a$r_buff1_thd3; [L719] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool a$r_buff1_thd1; [L736] 0 int a$w_buff0; [L732] 0 _Bool a$r_buff1_thd2; [L738] 0 int a$w_buff1; [L724] 0 _Bool a$flush_delayed; [L730] 0 _Bool a$r_buff1_thd0; [L709] 0 int __unbuffered_cnt = 0; [L735] 0 int *a$read_delayed_var; [L713] 0 int __unbuffered_p0_EBX = 0; [L741] 0 _Bool main$tmp_guard1; [L740] 0 _Bool main$tmp_guard0; [L737] 0 _Bool a$w_buff0_used; [L717] 0 int __unbuffered_p1_EBX = 0; [L727] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd0; [L729] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff0_thd2; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-3, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-2, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=-1, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L814] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 165 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1795 IncrementalHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 98 mSDtfsCounter, 1795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1894occurred in iteration=4, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 1245 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-19 06:49:39,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS --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 e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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-8393723 [2022-11-19 06:49:42,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:49:42,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:49:42,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:49:42,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:49:42,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:49:42,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:49:42,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:49:42,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:49:42,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:49:42,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:49:42,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:49:42,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:49:42,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:49:42,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:49:42,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:49:42,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:49:42,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:49:42,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:49:42,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:49:42,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:49:42,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:49:42,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:49:42,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:49:42,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:49:42,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:49:42,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:49:42,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:49:42,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:49:42,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:49:42,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:49:42,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:49:42,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:49:42,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:49:42,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:49:42,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:49:42,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:49:42,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:49:42,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:49:42,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:49:42,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:49:42,351 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 06:49:42,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:49:42,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:49:42,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:49:42,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:49:42,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:49:42,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:49:42,385 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:49:42,385 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:49:42,385 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:49:42,385 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:49:42,386 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:49:42,387 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:49:42,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 06:49:42,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 06:49:42,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:49:42,389 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:49:42,389 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:49:42,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:49:42,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:49:42,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:49:42,390 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 06:49:42,390 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 06:49:42,391 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 06:49:42,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:49:42,391 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 06:49:42,391 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 06:49:42,391 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 06:49:42,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:49:42,392 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:49:42,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:49:42,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 06:49:42,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:49:42,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:49:42,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:49:42,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:49:42,394 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 06:49:42,394 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 06:49:42,394 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:49:42,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 06:49:42,395 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_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-11-19 06:49:42,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:49:42,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:49:42,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:49:42,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:49:42,832 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:49:42,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-19 06:49:42,901 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data/5b170be38/c0fc0f97404340f5bf8f8f3fd4589cb3/FLAG50aede104 [2022-11-19 06:49:43,625 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:49:43,626 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-19 06:49:43,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data/5b170be38/c0fc0f97404340f5bf8f8f3fd4589cb3/FLAG50aede104 [2022-11-19 06:49:43,849 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/data/5b170be38/c0fc0f97404340f5bf8f8f3fd4589cb3 [2022-11-19 06:49:43,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:49:43,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:49:43,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:49:43,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:49:43,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:49:43,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:43" (1/1) ... [2022-11-19 06:49:43,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab9d12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:43, skipping insertion in model container [2022-11-19 06:49:43,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:43" (1/1) ... [2022-11-19 06:49:43,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:49:43,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:49:44,127 WARN L234 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_7ccf07d2-899d-4464-9666-bc015dbbe536/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-19 06:49:44,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:49:44,353 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:49:44,367 WARN L234 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_7ccf07d2-899d-4464-9666-bc015dbbe536/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-19 06:49:44,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:49:44,473 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:49:44,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44 WrapperNode [2022-11-19 06:49:44,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:49:44,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:49:44,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:49:44,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:49:44,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,569 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2022-11-19 06:49:44,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:49:44,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:49:44,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:49:44,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:49:44,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,601 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:49:44,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:49:44,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:49:44,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:49:44,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (1/1) ... [2022-11-19 06:49:44,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:49:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:44,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:49:44,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:49:44,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 06:49:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:49:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:49:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:49:44,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 06:49:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 06:49:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 06:49:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 06:49:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 06:49:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 06:49:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 06:49:44,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 06:49:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 06:49:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:49:44,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:49:44,722 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 06:49:45,009 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:49:45,011 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:49:45,555 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:49:45,737 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:49:45,737 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:49:45,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:45 BoogieIcfgContainer [2022-11-19 06:49:45,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:49:45,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:49:45,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:49:45,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:49:45,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:49:43" (1/3) ... [2022-11-19 06:49:45,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22aa6869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:49:45, skipping insertion in model container [2022-11-19 06:49:45,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:44" (2/3) ... [2022-11-19 06:49:45,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22aa6869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:49:45, skipping insertion in model container [2022-11-19 06:49:45,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:45" (3/3) ... [2022-11-19 06:49:45,749 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-11-19 06:49:45,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:49:45,767 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 06:49:45,767 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 06:49:45,864 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 06:49:45,911 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 06:49:45,942 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 135 transitions, 285 flow [2022-11-19 06:49:45,946 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 135 transitions, 285 flow [2022-11-19 06:49:45,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 135 transitions, 285 flow [2022-11-19 06:49:46,033 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-19 06:49:46,034 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 06:49:46,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-11-19 06:49:46,057 INFO L119 LiptonReduction]: Number of co-enabled transitions 2824 [2022-11-19 06:49:55,990 INFO L134 LiptonReduction]: Checked pairs total: 8023 [2022-11-19 06:49:55,990 INFO L136 LiptonReduction]: Total number of compositions: 133 [2022-11-19 06:49:55,999 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 38 transitions, 91 flow [2022-11-19 06:49:56,154 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 0 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-19 06:49:56,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:49:56,186 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;@4c69e495, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:49:56,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 06:49:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 0 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-19 06:49:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 06:49:56,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:56,204 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 06:49:56,205 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash 575, now seen corresponding path program 1 times [2022-11-19 06:49:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:49:56,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871336697] [2022-11-19 06:49:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:56,227 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-19 06:49:56,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:49:56,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:56,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:56,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 06:49:56,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:56,338 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-19 06:49:56,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:49:56,339 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:49:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871336697] [2022-11-19 06:49:56,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871336697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:56,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:56,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 06:49:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161351622] [2022-11-19 06:49:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:56,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 06:49:56,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:49:56,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 06:49:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 06:49:56,381 INFO L87 Difference]: Start difference. First operand has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 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-19 06:49:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:56,655 INFO L93 Difference]: Finished difference Result 1684 states and 5558 transitions. [2022-11-19 06:49:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 06:49:56,658 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-19 06:49:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:56,721 INFO L225 Difference]: With dead ends: 1684 [2022-11-19 06:49:56,722 INFO L226 Difference]: Without dead ends: 1684 [2022-11-19 06:49:56,723 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-19 06:49:56,729 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:56,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-11-19 06:49:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2022-11-19 06:49:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1679 states have (on average 3.310303752233472) internal successors, (5558), 1683 states have internal predecessors, (5558), 0 states have call successors, (0), 0 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-19 06:49:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 5558 transitions. [2022-11-19 06:49:56,898 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 5558 transitions. Word has length 1 [2022-11-19 06:49:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:56,899 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 5558 transitions. [2022-11-19 06:49:56,899 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-19 06:49:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 5558 transitions. [2022-11-19 06:49:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 06:49:56,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:56,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 06:49:56,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:57,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:57,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:57,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash 566646, now seen corresponding path program 1 times [2022-11-19 06:49:57,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:49:57,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508739644] [2022-11-19 06:49:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:57,125 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-19 06:49:57,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:49:57,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:57,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:57,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:49:57,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:57,287 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-19 06:49:57,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:49:57,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:49:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508739644] [2022-11-19 06:49:57,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508739644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:57,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:57,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:49:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83136989] [2022-11-19 06:49:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:57,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:49:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:49:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:49:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:57,294 INFO L87 Difference]: Start difference. First operand 1684 states and 5558 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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-19 06:49:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:57,460 INFO L93 Difference]: Finished difference Result 1418 states and 4632 transitions. [2022-11-19 06:49:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:49:57,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-19 06:49:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:57,470 INFO L225 Difference]: With dead ends: 1418 [2022-11-19 06:49:57,470 INFO L226 Difference]: Without dead ends: 1382 [2022-11-19 06:49:57,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:57,473 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:57,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-11-19 06:49:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2022-11-19 06:49:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1380 states have (on average 3.2869565217391306) internal successors, (4536), 1381 states have internal predecessors, (4536), 0 states have call successors, (0), 0 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-19 06:49:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 4536 transitions. [2022-11-19 06:49:57,533 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 4536 transitions. Word has length 3 [2022-11-19 06:49:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:57,536 INFO L495 AbstractCegarLoop]: Abstraction has 1382 states and 4536 transitions. [2022-11-19 06:49:57,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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-19 06:49:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 4536 transitions. [2022-11-19 06:49:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 06:49:57,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:57,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:57,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:57,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:57,750 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 549892495, now seen corresponding path program 1 times [2022-11-19 06:49:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:49:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118119406] [2022-11-19 06:49:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:57,753 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-19 06:49:57,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:49:57,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:57,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:57,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:49:57,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:57,945 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-19 06:49:57,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:49:57,947 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:49:57,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118119406] [2022-11-19 06:49:57,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118119406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:57,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:57,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:49:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588599794] [2022-11-19 06:49:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:57,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:49:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:49:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:49:57,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:49:57,950 INFO L87 Difference]: Start difference. First operand 1382 states and 4536 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:58,057 INFO L93 Difference]: Finished difference Result 757 states and 2036 transitions. [2022-11-19 06:49:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:49:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 06:49:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:58,098 INFO L225 Difference]: With dead ends: 757 [2022-11-19 06:49:58,098 INFO L226 Difference]: Without dead ends: 757 [2022-11-19 06:49:58,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-19 06:49:58,101 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:58,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-11-19 06:49:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2022-11-19 06:49:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 755 states have (on average 2.696688741721854) internal successors, (2036), 756 states have internal predecessors, (2036), 0 states have call successors, (0), 0 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-19 06:49:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 2036 transitions. [2022-11-19 06:49:58,130 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 2036 transitions. Word has length 10 [2022-11-19 06:49:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:58,131 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 2036 transitions. [2022-11-19 06:49:58,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 2036 transitions. [2022-11-19 06:49:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 06:49:58,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:58,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:58,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-19 06:49:58,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:58,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1589609721, now seen corresponding path program 1 times [2022-11-19 06:49:58,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:49:58,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085969009] [2022-11-19 06:49:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:58,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 06:49:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:49:58,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:58,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:58,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:49:58,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:58,543 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-19 06:49:58,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:49:58,543 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:49:58,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085969009] [2022-11-19 06:49:58,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085969009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:58,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:58,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:49:58,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629065071] [2022-11-19 06:49:58,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:58,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:49:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:49:58,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:49:58,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:58,547 INFO L87 Difference]: Start difference. First operand 757 states and 2036 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-19 06:49:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:58,701 INFO L93 Difference]: Finished difference Result 382 states and 911 transitions. [2022-11-19 06:49:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:49:58,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-19 06:49:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:58,704 INFO L225 Difference]: With dead ends: 382 [2022-11-19 06:49:58,704 INFO L226 Difference]: Without dead ends: 382 [2022-11-19 06:49:58,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:58,705 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:58,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:49:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-19 06:49:58,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-11-19 06:49:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 380 states have (on average 2.3973684210526316) internal successors, (911), 381 states have internal predecessors, (911), 0 states have call successors, (0), 0 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-19 06:49:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 911 transitions. [2022-11-19 06:49:58,717 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 911 transitions. Word has length 15 [2022-11-19 06:49:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:58,718 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 911 transitions. [2022-11-19 06:49:58,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-19 06:49:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 911 transitions. [2022-11-19 06:49:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:49:58,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:58,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:58,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:58,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:58,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -658120982, now seen corresponding path program 1 times [2022-11-19 06:49:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:49:58,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082511063] [2022-11-19 06:49:58,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:58,933 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-19 06:49:58,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:49:58,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:58,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:59,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 06:49:59,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:59,150 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-19 06:49:59,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:49:59,151 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:49:59,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082511063] [2022-11-19 06:49:59,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082511063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:59,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:59,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:49:59,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137007696] [2022-11-19 06:49:59,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:59,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:49:59,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:49:59,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:49:59,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:59,154 INFO L87 Difference]: Start difference. First operand 382 states and 911 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:59,376 INFO L93 Difference]: Finished difference Result 307 states and 761 transitions. [2022-11-19 06:49:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:49:59,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-19 06:49:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:59,378 INFO L225 Difference]: With dead ends: 307 [2022-11-19 06:49:59,378 INFO L226 Difference]: Without dead ends: 307 [2022-11-19 06:49:59,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:49:59,379 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:59,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 36 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:49:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-19 06:49:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-11-19 06:49:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 305 states have (on average 2.495081967213115) internal successors, (761), 306 states have internal predecessors, (761), 0 states have call successors, (0), 0 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-19 06:49:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 761 transitions. [2022-11-19 06:49:59,389 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 761 transitions. Word has length 20 [2022-11-19 06:49:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:59,389 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 761 transitions. [2022-11-19 06:49:59,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:49:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 761 transitions. [2022-11-19 06:49:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:49:59,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:59,391 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-19 06:49:59,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:59,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:59,608 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:49:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1603277080, now seen corresponding path program 1 times [2022-11-19 06:49:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:49:59,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882463667] [2022-11-19 06:49:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:59,612 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-19 06:49:59,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:49:59,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:59,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:49:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:59,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 06:49:59,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:00,450 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-19 06:50:00,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:50:00,451 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:50:00,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882463667] [2022-11-19 06:50:00,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882463667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:00,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:50:00,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:50:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316861409] [2022-11-19 06:50:00,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:00,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:50:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:50:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:50:00,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:50:00,452 INFO L87 Difference]: Start difference. First operand 307 states and 761 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 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-19 06:50:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:00,528 INFO L93 Difference]: Finished difference Result 306 states and 760 transitions. [2022-11-19 06:50:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:50:00,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 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-19 06:50:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:00,531 INFO L225 Difference]: With dead ends: 306 [2022-11-19 06:50:00,531 INFO L226 Difference]: Without dead ends: 306 [2022-11-19 06:50:00,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:50:00,532 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:00,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-11-19 06:50:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-19 06:50:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-11-19 06:50:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.4918032786885247) internal successors, (760), 305 states have internal predecessors, (760), 0 states have call successors, (0), 0 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-19 06:50:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 760 transitions. [2022-11-19 06:50:00,542 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 760 transitions. Word has length 25 [2022-11-19 06:50:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:00,542 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 760 transitions. [2022-11-19 06:50:00,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 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-19 06:50:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 760 transitions. [2022-11-19 06:50:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:50:00,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:00,544 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-19 06:50:00,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:00,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:00,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:50:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1603277141, now seen corresponding path program 1 times [2022-11-19 06:50:00,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:50:00,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013025028] [2022-11-19 06:50:00,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:00,764 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-19 06:50:00,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:50:00,766 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:00,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:00,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:50:00,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:00,972 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-19 06:50:00,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:50:00,972 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:50:00,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013025028] [2022-11-19 06:50:00,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013025028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:00,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:50:00,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:50:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664162503] [2022-11-19 06:50:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:00,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:50:00,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:50:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:50:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:50:00,975 INFO L87 Difference]: Start difference. First operand 306 states and 760 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-19 06:50:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:01,181 INFO L93 Difference]: Finished difference Result 429 states and 1044 transitions. [2022-11-19 06:50:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:50:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-19 06:50:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:01,182 INFO L225 Difference]: With dead ends: 429 [2022-11-19 06:50:01,182 INFO L226 Difference]: Without dead ends: 186 [2022-11-19 06:50:01,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-19 06:50:01,183 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:01,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:50:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-19 06:50:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-11-19 06:50:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.2432432432432434) internal successors, (415), 185 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-19 06:50:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 415 transitions. [2022-11-19 06:50:01,189 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 415 transitions. Word has length 25 [2022-11-19 06:50:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:01,190 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 415 transitions. [2022-11-19 06:50:01,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-19 06:50:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 415 transitions. [2022-11-19 06:50:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:50:01,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:01,191 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-19 06:50:01,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-19 06:50:01,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:01,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:50:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -206539191, now seen corresponding path program 2 times [2022-11-19 06:50:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:50:01,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541569457] [2022-11-19 06:50:01,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 06:50:01,409 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-19 06:50:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:50:01,410 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:01,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:01,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 06:50:01,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:50:01,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:50:01,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:01,632 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-19 06:50:01,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:50:01,633 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:50:01,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541569457] [2022-11-19 06:50:01,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541569457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:01,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:50:01,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:50:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882166720] [2022-11-19 06:50:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:01,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:50:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:50:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:50:01,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:50:01,635 INFO L87 Difference]: Start difference. First operand 186 states and 415 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-19 06:50:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:01,809 INFO L93 Difference]: Finished difference Result 234 states and 514 transitions. [2022-11-19 06:50:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:50:01,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-19 06:50:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:01,810 INFO L225 Difference]: With dead ends: 234 [2022-11-19 06:50:01,810 INFO L226 Difference]: Without dead ends: 126 [2022-11-19 06:50:01,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-19 06:50:01,811 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:01,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:50:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-19 06:50:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-19 06:50:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.12) internal successors, (265), 125 states have internal predecessors, (265), 0 states have call successors, (0), 0 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-19 06:50:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 265 transitions. [2022-11-19 06:50:01,816 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 265 transitions. Word has length 25 [2022-11-19 06:50:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:01,816 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 265 transitions. [2022-11-19 06:50:01,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-19 06:50:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 265 transitions. [2022-11-19 06:50:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:50:01,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:01,817 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-19 06:50:01,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:02,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:02,018 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:50:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash 615654307, now seen corresponding path program 3 times [2022-11-19 06:50:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:50:02,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513083406] [2022-11-19 06:50:02,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:50:02,019 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-19 06:50:02,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:50:02,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:02,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:02,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 06:50:02,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:50:02,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 06:50:02,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:02,366 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-19 06:50:02,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:50:02,367 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:50:02,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513083406] [2022-11-19 06:50:02,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513083406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:02,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:50:02,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:50:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390486797] [2022-11-19 06:50:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:02,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:50:02,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:50:02,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:50:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:50:02,369 INFO L87 Difference]: Start difference. First operand 126 states and 265 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) 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-19 06:50:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:02,658 INFO L93 Difference]: Finished difference Result 147 states and 301 transitions. [2022-11-19 06:50:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:50:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) 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-19 06:50:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:02,659 INFO L225 Difference]: With dead ends: 147 [2022-11-19 06:50:02,659 INFO L226 Difference]: Without dead ends: 126 [2022-11-19 06:50:02,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:50:02,660 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:02,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:50:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-19 06:50:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-19 06:50:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.104) internal successors, (263), 125 states have internal predecessors, (263), 0 states have call successors, (0), 0 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-19 06:50:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 263 transitions. [2022-11-19 06:50:02,664 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 263 transitions. Word has length 25 [2022-11-19 06:50:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:02,665 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 263 transitions. [2022-11-19 06:50:02,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) 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-19 06:50:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 263 transitions. [2022-11-19 06:50:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:50:02,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:02,665 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-19 06:50:02,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:02,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:02,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:50:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1119545193, now seen corresponding path program 4 times [2022-11-19 06:50:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:50:02,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665984703] [2022-11-19 06:50:02,876 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:50:02,876 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-19 06:50:02,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:50:02,877 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:02,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:03,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:50:03,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:50:03,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 06:50:03,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:03,368 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-19 06:50:03,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:50:03,368 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 06:50:03,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665984703] [2022-11-19 06:50:03,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665984703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:03,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:50:03,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:50:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86325382] [2022-11-19 06:50:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:03,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:50:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 06:50:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:50:03,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:50:03,370 INFO L87 Difference]: Start difference. First operand 126 states and 263 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-19 06:50:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:03,639 INFO L93 Difference]: Finished difference Result 141 states and 286 transitions. [2022-11-19 06:50:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:50:03,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-19 06:50:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:03,640 INFO L225 Difference]: With dead ends: 141 [2022-11-19 06:50:03,640 INFO L226 Difference]: Without dead ends: 74 [2022-11-19 06:50:03,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-19 06:50:03,641 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:03,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 28 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:50:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-19 06:50:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-19 06:50:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 73 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-19 06:50:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 129 transitions. [2022-11-19 06:50:03,644 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 129 transitions. Word has length 25 [2022-11-19 06:50:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:03,644 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 129 transitions. [2022-11-19 06:50:03,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-19 06:50:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 129 transitions. [2022-11-19 06:50:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:50:03,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:03,645 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-19 06:50:03,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:03,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:03,854 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 06:50:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1089860771, now seen corresponding path program 5 times [2022-11-19 06:50:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 06:50:03,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013531664] [2022-11-19 06:50:03,855 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-19 06:50:03,855 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-19 06:50:03,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 06:50:03,856 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:03,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:04,034 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 06:50:04,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 06:50:04,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 06:50:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:50:04,214 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 06:50:04,214 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 06:50:04,215 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 06:50:04,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 06:50:04,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 06:50:04,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 06:50:04,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 06:50:04,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 06:50:04,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 06:50:04,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 06:50:04,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 06:50:04,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 06:50:04,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 06:50:04,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 06:50:04,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 06:50:04,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:04,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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-19 06:50:04,434 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-11-19 06:50:04,438 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 06:50:04,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:50:04,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:50:04 BasicIcfg [2022-11-19 06:50:04,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:50:04,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:50:04,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:50:04,530 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:50:04,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:45" (3/4) ... [2022-11-19 06:50:04,533 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 06:50:04,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:50:04,534 INFO L158 Benchmark]: Toolchain (without parser) took 20681.29ms. Allocated memory was 60.8MB in the beginning and 113.2MB in the end (delta: 52.4MB). Free memory was 40.2MB in the beginning and 34.8MB in the end (delta: 5.3MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2022-11-19 06:50:04,534 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:50:04,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.64ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 31.5MB in the end (delta: 8.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 06:50:04,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.33ms. Allocated memory is still 60.8MB. Free memory was 31.5MB in the beginning and 28.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:50:04,535 INFO L158 Benchmark]: Boogie Preprocessor took 37.98ms. Allocated memory is still 60.8MB. Free memory was 28.8MB in the beginning and 26.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:50:04,536 INFO L158 Benchmark]: RCFGBuilder took 1131.51ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 26.6MB in the beginning and 45.9MB in the end (delta: -19.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-11-19 06:50:04,536 INFO L158 Benchmark]: TraceAbstraction took 18786.74ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 45.1MB in the beginning and 35.9MB in the end (delta: 9.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-11-19 06:50:04,536 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 113.2MB. Free memory was 35.9MB in the beginning and 34.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:50:04,538 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.32ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 619.64ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 31.5MB in the end (delta: 8.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.33ms. Allocated memory is still 60.8MB. Free memory was 31.5MB in the beginning and 28.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.98ms. Allocated memory is still 60.8MB. Free memory was 28.8MB in the beginning and 26.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1131.51ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 26.6MB in the beginning and 45.9MB in the end (delta: -19.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18786.74ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 45.1MB in the beginning and 35.9MB in the end (delta: 9.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 113.2MB. Free memory was 35.9MB in the beginning and 34.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 143 PlacesBefore, 47 PlacesAfterwards, 135 TransitionsBefore, 38 TransitionsAfterwards, 2824 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 8023 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4454, independent: 4248, independent conditional: 0, independent unconditional: 4248, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1948, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1948, independent: 1877, independent conditional: 0, independent unconditional: 1877, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 434, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4454, independent: 2350, independent conditional: 0, independent unconditional: 2350, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1948, unknown conditional: 0, unknown unconditional: 1948] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 250, Positive conditional cache size: 0, Positive unconditional cache size: 250, 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: [L721] 0 int __unbuffered_p2_EBX = 0; [L739] 0 _Bool a$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L725] 0 int a$mem_tmp; [L734] 0 _Bool a$read_delayed; [L715] 0 int __unbuffered_p1_EAX = 0; [L723] 0 int a = 0; [L733] 0 _Bool a$r_buff1_thd3; [L719] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool a$r_buff1_thd1; [L736] 0 int a$w_buff0; [L732] 0 _Bool a$r_buff1_thd2; [L738] 0 int a$w_buff1; [L724] 0 _Bool a$flush_delayed; [L730] 0 _Bool a$r_buff1_thd0; [L709] 0 int __unbuffered_cnt = 0; [L735] 0 int *a$read_delayed_var; [L713] 0 int __unbuffered_p0_EBX = 0; [L741] 0 _Bool main$tmp_guard1; [L740] 0 _Bool main$tmp_guard0; [L737] 0 _Bool a$w_buff0_used; [L717] 0 int __unbuffered_p1_EBX = 0; [L727] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd0; [L729] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff0_thd2; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=0, t38={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=1, t38={-6:0}, t39={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=2, t38={-6:0}, t39={-10:0}, t40={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={-6:0}, t39={-10:0}, t40={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 166 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 65 mSDtfsCounter, 962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1784occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 164 ConstructedInterpolants, 20 QuantifiedInterpolants, 1522 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1355 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-19 06:50:04,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ccf07d2-899d-4464-9666-bc015dbbe536/bin/utaipan-I9t0OCRTmS/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