./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba --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 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d --- 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-b5237d8 [2022-11-22 00:15:18,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:15:18,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:15:18,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:15:18,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:15:18,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:15:18,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:15:18,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:15:18,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:15:18,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:15:18,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:15:18,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:15:18,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:15:18,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:15:18,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:15:18,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:15:18,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:15:18,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:15:18,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:15:18,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:15:18,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:15:18,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:15:18,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:15:18,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:15:18,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:15:18,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:15:18,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:15:18,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:15:18,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:15:18,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:15:18,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:15:18,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:15:18,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:15:18,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:15:18,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:15:18,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:15:18,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:15:18,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:15:18,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:15:18,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:15:18,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:15:18,494 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 00:15:18,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:15:18,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:15:18,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:15:18,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:15:18,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:15:18,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:15:18,528 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:15:18,528 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:15:18,528 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:15:18,528 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:15:18,528 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:15:18,529 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:15:18,529 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:15:18,529 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:15:18,529 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:15:18,529 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:15:18,530 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:15:18,530 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:15:18,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:15:18,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:15:18,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:15:18,531 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:15:18,531 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:15:18,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:15:18,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:15:18,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:15:18,532 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:15:18,532 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:15:18,532 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:15:18,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:15:18,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:15:18,533 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:15:18,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:15:18,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:15:18,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:15:18,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:18,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:15:18,534 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:15:18,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:15:18,534 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:15:18,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:15:18,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:15:18,535 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_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba 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 -> 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d [2022-11-22 00:15:18,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:15:18,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:15:18,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:15:18,818 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:15:18,818 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:15:18,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-22 00:15:21,852 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:15:22,150 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:15:22,151 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-22 00:15:22,165 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/data/bb7f505ec/dac22d93cb9f483a8d2151f692676bef/FLAG88d3057a2 [2022-11-22 00:15:22,179 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/data/bb7f505ec/dac22d93cb9f483a8d2151f692676bef [2022-11-22 00:15:22,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:15:22,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:15:22,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:22,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:15:22,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:15:22,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8eaf732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22, skipping insertion in model container [2022-11-22 00:15:22,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:15:22,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:15:22,389 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-22 00:15:22,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:22,644 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:15:22,656 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-22 00:15:22,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:22,733 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:15:22,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22 WrapperNode [2022-11-22 00:15:22,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:22,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:22,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:15:22,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:15:22,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,794 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-22 00:15:22,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:22,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:15:22,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:15:22,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:15:22,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,833 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:15:22,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:15:22,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:15:22,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:15:22,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (1/1) ... [2022-11-22 00:15:22,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:22,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:15:22,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:15:22,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:15:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:15:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:15:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:15:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:15:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:15:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:15:22,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:15:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:15:22,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:15:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:15:22,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:15:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:15:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:15:22,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:15:22,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:15:22,954 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:15:23,197 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:15:23,200 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:15:23,528 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:15:23,726 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:15:23,726 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:15:23,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:23 BoogieIcfgContainer [2022-11-22 00:15:23,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:15:23,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:15:23,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:15:23,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:15:23,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:15:22" (1/3) ... [2022-11-22 00:15:23,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612583e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:23, skipping insertion in model container [2022-11-22 00:15:23,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:22" (2/3) ... [2022-11-22 00:15:23,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612583e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:23, skipping insertion in model container [2022-11-22 00:15:23,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:23" (3/3) ... [2022-11-22 00:15:23,738 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.opt.i [2022-11-22 00:15:23,759 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:15:23,759 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-22 00:15:23,760 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:15:23,823 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:15:23,873 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:15:23,894 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-22 00:15:23,900 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-22 00:15:23,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-22 00:15:24,002 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-22 00:15:24,002 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:15:24,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-22 00:15:24,011 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2022-11-22 00:15:30,253 INFO L134 LiptonReduction]: Checked pairs total: 5862 [2022-11-22 00:15:30,253 INFO L136 LiptonReduction]: Total number of compositions: 133 [2022-11-22 00:15:30,262 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-22 00:15:30,365 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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-22 00:15:30,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:15:30,391 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;@46f52186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:15:30,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-22 00:15:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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-22 00:15:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:15:30,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:30,402 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:15:30,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash 575, now seen corresponding path program 1 times [2022-11-22 00:15:30,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:30,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111774338] [2022-11-22 00:15:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:30,527 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-22 00:15:30,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:30,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111774338] [2022-11-22 00:15:30,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111774338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:30,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:30,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:15:30,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709979382] [2022-11-22 00:15:30,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:30,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:15:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:15:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:15:30,569 INFO L87 Difference]: Start difference. First operand has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 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-22 00:15:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:30,688 INFO L93 Difference]: Finished difference Result 932 states and 2966 transitions. [2022-11-22 00:15:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:15:30,691 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-22 00:15:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:30,722 INFO L225 Difference]: With dead ends: 932 [2022-11-22 00:15:30,723 INFO L226 Difference]: Without dead ends: 932 [2022-11-22 00:15:30,724 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-22 00:15:30,728 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:30,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-22 00:15:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2022-11-22 00:15:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 927 states have (on average 3.199568500539374) internal successors, (2966), 931 states have internal predecessors, (2966), 0 states have call successors, (0), 0 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-22 00:15:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2966 transitions. [2022-11-22 00:15:30,880 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2966 transitions. Word has length 1 [2022-11-22 00:15:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:30,880 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2966 transitions. [2022-11-22 00:15:30,880 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-22 00:15:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2966 transitions. [2022-11-22 00:15:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 00:15:30,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:30,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:30,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:15:30,882 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash -608337308, now seen corresponding path program 1 times [2022-11-22 00:15:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:30,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888132367] [2022-11-22 00:15:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:31,333 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-22 00:15:31,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:31,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888132367] [2022-11-22 00:15:31,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888132367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:31,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:31,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:15:31,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101454776] [2022-11-22 00:15:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:31,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:31,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:31,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:31,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:31,337 INFO L87 Difference]: Start difference. First operand 932 states and 2966 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:31,409 INFO L93 Difference]: Finished difference Result 792 states and 2489 transitions. [2022-11-22 00:15:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:31,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 00:15:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:31,416 INFO L225 Difference]: With dead ends: 792 [2022-11-22 00:15:31,416 INFO L226 Difference]: Without dead ends: 772 [2022-11-22 00:15:31,417 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-22 00:15:31,419 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:31,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-11-22 00:15:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2022-11-22 00:15:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 770 states have (on average 3.1662337662337663) internal successors, (2438), 771 states have internal predecessors, (2438), 0 states have call successors, (0), 0 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-22 00:15:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2438 transitions. [2022-11-22 00:15:31,451 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2438 transitions. Word has length 7 [2022-11-22 00:15:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:31,452 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 2438 transitions. [2022-11-22 00:15:31,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2438 transitions. [2022-11-22 00:15:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:15:31,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:31,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:31,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:15:31,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:31,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1788202815, now seen corresponding path program 1 times [2022-11-22 00:15:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:31,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442873266] [2022-11-22 00:15:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:31,869 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-22 00:15:31,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:31,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442873266] [2022-11-22 00:15:31,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442873266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:31,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:31,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:31,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934836131] [2022-11-22 00:15:31,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:31,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:31,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:31,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:31,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:31,873 INFO L87 Difference]: Start difference. First operand 772 states and 2438 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-22 00:15:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:32,043 INFO L93 Difference]: Finished difference Result 988 states and 3042 transitions. [2022-11-22 00:15:32,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:32,043 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-22 00:15:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:32,049 INFO L225 Difference]: With dead ends: 988 [2022-11-22 00:15:32,050 INFO L226 Difference]: Without dead ends: 988 [2022-11-22 00:15:32,051 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-22 00:15:32,054 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:32,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2022-11-22 00:15:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 876. [2022-11-22 00:15:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 874 states have (on average 3.1807780320366135) internal successors, (2780), 875 states have internal predecessors, (2780), 0 states have call successors, (0), 0 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-22 00:15:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 2780 transitions. [2022-11-22 00:15:32,094 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 2780 transitions. Word has length 10 [2022-11-22 00:15:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:32,097 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 2780 transitions. [2022-11-22 00:15:32,097 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-22 00:15:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 2780 transitions. [2022-11-22 00:15:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:15:32,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:32,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:32,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:15:32,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1788202883, now seen corresponding path program 1 times [2022-11-22 00:15:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:32,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796698528] [2022-11-22 00:15:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:32,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:32,586 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-22 00:15:32,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:32,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796698528] [2022-11-22 00:15:32,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796698528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:32,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:32,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:32,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221930230] [2022-11-22 00:15:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:32,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:15:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:32,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:15:32,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:15:32,594 INFO L87 Difference]: Start difference. First operand 876 states and 2780 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-22 00:15:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:32,756 INFO L93 Difference]: Finished difference Result 756 states and 2262 transitions. [2022-11-22 00:15:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:15:32,757 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-22 00:15:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:32,761 INFO L225 Difference]: With dead ends: 756 [2022-11-22 00:15:32,761 INFO L226 Difference]: Without dead ends: 636 [2022-11-22 00:15:32,762 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-22 00:15:32,763 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:32,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 28 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-11-22 00:15:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2022-11-22 00:15:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.099212598425197) internal successors, (1968), 635 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-22 00:15:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1968 transitions. [2022-11-22 00:15:32,785 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1968 transitions. Word has length 10 [2022-11-22 00:15:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:32,786 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 1968 transitions. [2022-11-22 00:15:32,786 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-22 00:15:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1968 transitions. [2022-11-22 00:15:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:15:32,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:32,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:32,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:15:32,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:32,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:32,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1950550391, now seen corresponding path program 1 times [2022-11-22 00:15:32,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:32,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533865246] [2022-11-22 00:15:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:32,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:32,986 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-22 00:15:32,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:32,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533865246] [2022-11-22 00:15:32,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533865246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:32,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:32,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:32,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838535264] [2022-11-22 00:15:32,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:32,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:32,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:32,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:32,993 INFO L87 Difference]: Start difference. First operand 636 states and 1968 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:33,126 INFO L93 Difference]: Finished difference Result 656 states and 1958 transitions. [2022-11-22 00:15:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:33,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:15:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:33,130 INFO L225 Difference]: With dead ends: 656 [2022-11-22 00:15:33,130 INFO L226 Difference]: Without dead ends: 556 [2022-11-22 00:15:33,131 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-22 00:15:33,131 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:33,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 13 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-22 00:15:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2022-11-22 00:15:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.0414414414414415) internal successors, (1688), 555 states have internal predecessors, (1688), 0 states have call successors, (0), 0 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-22 00:15:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1688 transitions. [2022-11-22 00:15:33,152 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1688 transitions. Word has length 12 [2022-11-22 00:15:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:33,152 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 1688 transitions. [2022-11-22 00:15:33,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1688 transitions. [2022-11-22 00:15:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:15:33,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:33,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:33,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:15:33,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:33,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash 475532549, now seen corresponding path program 1 times [2022-11-22 00:15:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478722031] [2022-11-22 00:15:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:33,301 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-22 00:15:33,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:33,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478722031] [2022-11-22 00:15:33,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478722031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:33,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:33,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:33,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871717885] [2022-11-22 00:15:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:33,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:33,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:33,304 INFO L87 Difference]: Start difference. First operand 556 states and 1688 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:33,417 INFO L93 Difference]: Finished difference Result 580 states and 1710 transitions. [2022-11-22 00:15:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:15:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:33,421 INFO L225 Difference]: With dead ends: 580 [2022-11-22 00:15:33,421 INFO L226 Difference]: Without dead ends: 508 [2022-11-22 00:15:33,421 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-22 00:15:33,422 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:33,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:33,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-11-22 00:15:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2022-11-22 00:15:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 3.0059171597633134) internal successors, (1524), 507 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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-22 00:15:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1524 transitions. [2022-11-22 00:15:33,439 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1524 transitions. Word has length 12 [2022-11-22 00:15:33,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:33,440 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 1524 transitions. [2022-11-22 00:15:33,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1524 transitions. [2022-11-22 00:15:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:15:33,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:33,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:33,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:15:33,442 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:33,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1873638961, now seen corresponding path program 1 times [2022-11-22 00:15:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:33,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950123571] [2022-11-22 00:15:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:33,695 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-22 00:15:33,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:33,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950123571] [2022-11-22 00:15:33,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950123571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:33,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:33,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577941181] [2022-11-22 00:15:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:33,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:33,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:33,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:33,698 INFO L87 Difference]: Start difference. First operand 508 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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-22 00:15:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:33,815 INFO L93 Difference]: Finished difference Result 472 states and 1246 transitions. [2022-11-22 00:15:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:33,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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-22 00:15:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:33,818 INFO L225 Difference]: With dead ends: 472 [2022-11-22 00:15:33,818 INFO L226 Difference]: Without dead ends: 352 [2022-11-22 00:15:33,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:33,819 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:33,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-22 00:15:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2022-11-22 00:15:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.5641025641025643) internal successors, (900), 351 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-22 00:15:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 900 transitions. [2022-11-22 00:15:33,830 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 900 transitions. Word has length 14 [2022-11-22 00:15:33,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:33,830 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 900 transitions. [2022-11-22 00:15:33,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-22 00:15:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 900 transitions. [2022-11-22 00:15:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:15:33,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:33,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:33,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:15:33,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash 754875955, now seen corresponding path program 1 times [2022-11-22 00:15:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:33,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129280515] [2022-11-22 00:15:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:34,026 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-22 00:15:34,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:34,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129280515] [2022-11-22 00:15:34,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129280515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:34,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:34,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825339093] [2022-11-22 00:15:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:34,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:15:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:34,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:15:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:34,029 INFO L87 Difference]: Start difference. First operand 352 states and 900 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:34,175 INFO L93 Difference]: Finished difference Result 276 states and 645 transitions. [2022-11-22 00:15:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:15:34,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 00:15:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:34,177 INFO L225 Difference]: With dead ends: 276 [2022-11-22 00:15:34,177 INFO L226 Difference]: Without dead ends: 216 [2022-11-22 00:15:34,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:15:34,178 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:34,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 21 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-22 00:15:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-22 00:15:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.2883720930232556) internal successors, (492), 215 states have internal predecessors, (492), 0 states have call successors, (0), 0 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-22 00:15:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 492 transitions. [2022-11-22 00:15:34,184 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 492 transitions. Word has length 16 [2022-11-22 00:15:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:34,185 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 492 transitions. [2022-11-22 00:15:34,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 492 transitions. [2022-11-22 00:15:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:15:34,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:34,187 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-22 00:15:34,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:15:34,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1520439856, now seen corresponding path program 1 times [2022-11-22 00:15:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:34,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415459319] [2022-11-22 00:15:34,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:34,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:34,487 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-22 00:15:34,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:34,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415459319] [2022-11-22 00:15:34,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415459319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:34,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:34,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:15:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561323110] [2022-11-22 00:15:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:34,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:15:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:15:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:15:34,490 INFO L87 Difference]: Start difference. First operand 216 states and 492 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:34,637 INFO L93 Difference]: Finished difference Result 189 states and 436 transitions. [2022-11-22 00:15:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:15:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 00:15:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:34,638 INFO L225 Difference]: With dead ends: 189 [2022-11-22 00:15:34,639 INFO L226 Difference]: Without dead ends: 176 [2022-11-22 00:15:34,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:34,639 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 70 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:34,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 21 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-22 00:15:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-11-22 00:15:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.354285714285714) internal successors, (412), 175 states have internal predecessors, (412), 0 states have call successors, (0), 0 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-22 00:15:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 412 transitions. [2022-11-22 00:15:34,645 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 412 transitions. Word has length 19 [2022-11-22 00:15:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:34,645 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 412 transitions. [2022-11-22 00:15:34,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 412 transitions. [2022-11-22 00:15:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:15:34,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:34,647 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-22 00:15:34,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:15:34,648 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:34,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2013834747, now seen corresponding path program 1 times [2022-11-22 00:15:34,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:34,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978534616] [2022-11-22 00:15:34,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:34,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:34,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:34,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978534616] [2022-11-22 00:15:34,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978534616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:34,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:34,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79349901] [2022-11-22 00:15:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:34,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:15:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:15:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:34,903 INFO L87 Difference]: Start difference. First operand 176 states and 412 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:35,039 INFO L93 Difference]: Finished difference Result 227 states and 513 transitions. [2022-11-22 00:15:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:15:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:35,041 INFO L225 Difference]: With dead ends: 227 [2022-11-22 00:15:35,041 INFO L226 Difference]: Without dead ends: 104 [2022-11-22 00:15:35,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-22 00:15:35,042 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:35,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 18 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-22 00:15:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-22 00:15:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.9902912621359223) internal successors, (205), 103 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-22 00:15:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 205 transitions. [2022-11-22 00:15:35,045 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 205 transitions. Word has length 22 [2022-11-22 00:15:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:35,046 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 205 transitions. [2022-11-22 00:15:35,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 205 transitions. [2022-11-22 00:15:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:15:35,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:35,047 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-22 00:15:35,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:15:35,047 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:35,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1746440423, now seen corresponding path program 2 times [2022-11-22 00:15:35,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:35,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609300774] [2022-11-22 00:15:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:35,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:36,798 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-22 00:15:36,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:15:36,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609300774] [2022-11-22 00:15:36,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609300774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:36,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:36,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044241027] [2022-11-22 00:15:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:36,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:15:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:15:36,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:15:36,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:15:36,800 INFO L87 Difference]: Start difference. First operand 104 states and 205 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) 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-22 00:15:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:37,343 INFO L93 Difference]: Finished difference Result 136 states and 258 transitions. [2022-11-22 00:15:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:15:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) 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-22 00:15:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:37,344 INFO L225 Difference]: With dead ends: 136 [2022-11-22 00:15:37,344 INFO L226 Difference]: Without dead ends: 111 [2022-11-22 00:15:37,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:15:37,345 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:37,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 25 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-22 00:15:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-11-22 00:15:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.9438202247191012) internal successors, (173), 89 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-22 00:15:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 173 transitions. [2022-11-22 00:15:37,349 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 173 transitions. Word has length 22 [2022-11-22 00:15:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:37,349 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 173 transitions. [2022-11-22 00:15:37,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) 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-22 00:15:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 173 transitions. [2022-11-22 00:15:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:15:37,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:37,350 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-22 00:15:37,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:15:37,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1821621479, now seen corresponding path program 3 times [2022-11-22 00:15:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:15:37,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045335409] [2022-11-22 00:15:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:15:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:15:37,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:15:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:15:37,468 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 00:15:37,469 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:15:37,470 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-22 00:15:37,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-22 00:15:37,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-22 00:15:37,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-22 00:15:37,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-22 00:15:37,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-22 00:15:37,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-22 00:15:37,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-22 00:15:37,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-22 00:15:37,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-22 00:15:37,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-22 00:15:37,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-22 00:15:37,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-22 00:15:37,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:15:37,477 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:37,482 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:15:37,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:15:37,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:15:37 BasicIcfg [2022-11-22 00:15:37,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:15:37,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:15:37,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:15:37,562 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:15:37,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:23" (3/4) ... [2022-11-22 00:15:37,565 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 00:15:37,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:15:37,566 INFO L158 Benchmark]: Toolchain (without parser) took 15382.32ms. Allocated memory was 134.2MB in the beginning and 255.9MB in the end (delta: 121.6MB). Free memory was 104.1MB in the beginning and 138.7MB in the end (delta: -34.6MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2022-11-22 00:15:37,566 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 111.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:15:37,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.31ms. Allocated memory is still 134.2MB. Free memory was 103.8MB in the beginning and 79.9MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-22 00:15:37,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.87ms. Allocated memory is still 134.2MB. Free memory was 79.9MB in the beginning and 77.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:15:37,567 INFO L158 Benchmark]: Boogie Preprocessor took 58.96ms. Allocated memory is still 134.2MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:15:37,568 INFO L158 Benchmark]: RCFGBuilder took 874.07ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 75.1MB in the beginning and 121.2MB in the end (delta: -46.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-11-22 00:15:37,569 INFO L158 Benchmark]: TraceAbstraction took 13829.16ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 120.8MB in the beginning and 138.7MB in the end (delta: -17.9MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-11-22 00:15:37,569 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 255.9MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:15:37,572 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.21ms. Allocated memory is still 111.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.31ms. Allocated memory is still 134.2MB. Free memory was 103.8MB in the beginning and 79.9MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.87ms. Allocated memory is still 134.2MB. Free memory was 79.9MB in the beginning and 77.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.96ms. Allocated memory is still 134.2MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 874.07ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 75.1MB in the beginning and 121.2MB in the end (delta: -46.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13829.16ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 120.8MB in the beginning and 138.7MB in the end (delta: -17.9MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 255.9MB. Free memory is still 138.7MB. 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.4s, 138 PlacesBefore, 44 PlacesAfterwards, 130 TransitionsBefore, 35 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 5862 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3626, independent: 3460, independent conditional: 0, independent unconditional: 3460, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1712, independent: 1667, independent conditional: 0, independent unconditional: 1667, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1712, independent: 1640, independent conditional: 0, independent unconditional: 1640, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 440, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 383, dependent conditional: 0, dependent unconditional: 383, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3626, independent: 1793, independent conditional: 0, independent unconditional: 1793, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1712, unknown conditional: 0, unknown unconditional: 1712] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t388; [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388, ((void *)0), P0, ((void *)0))=-1, t388={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t389; [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389, ((void *)0), P1, ((void *)0))=0, t388={5:0}, t389={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t390; [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390, ((void *)0), P2, ((void *)0))=1, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 158 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 874 IncrementalHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 57 mSDtfsCounter, 874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=984occurred in iteration=0, InterpolantAutomatonStates: 59, 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, 11 MinimizatonAttempts, 133 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-22 00:15:37,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba --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 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d --- 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-b5237d8 [2022-11-22 00:15:40,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:15:40,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:15:40,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:15:40,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:15:40,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:15:40,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:15:40,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:15:40,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:15:40,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:15:40,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:15:40,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:15:40,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:15:40,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:15:40,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:15:40,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:15:40,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:15:40,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:15:40,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:15:40,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:15:40,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:15:40,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:15:40,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:15:40,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:15:40,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:15:40,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:15:40,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:15:40,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:15:40,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:15:40,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:15:40,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:15:40,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:15:40,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:15:40,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:15:40,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:15:40,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:15:40,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:15:40,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:15:40,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:15:40,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:15:40,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:15:40,299 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 00:15:40,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:15:40,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:15:40,341 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:15:40,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:15:40,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:15:40,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:15:40,343 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:15:40,343 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:15:40,344 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:15:40,344 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:15:40,345 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:15:40,345 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:15:40,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:15:40,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:15:40,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:15:40,347 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:15:40,347 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:15:40,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:15:40,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:15:40,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:15:40,348 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:15:40,348 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:15:40,349 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:15:40,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:15:40,349 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:15:40,349 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 00:15:40,350 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 00:15:40,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:15:40,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:15:40,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:15:40,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 00:15:40,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:15:40,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:40,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:15:40,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:15:40,352 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 00:15:40,353 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 00:15:40,353 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:15:40,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 00:15:40,353 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_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba 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 -> 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d [2022-11-22 00:15:40,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:15:40,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:15:40,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:15:40,809 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:15:40,810 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:15:40,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-22 00:15:43,931 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:15:44,245 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:15:44,251 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-11-22 00:15:44,280 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/data/e0086d752/f29a10ff7467413f9eda306c4b8795e2/FLAGd6cdb82b5 [2022-11-22 00:15:44,309 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/data/e0086d752/f29a10ff7467413f9eda306c4b8795e2 [2022-11-22 00:15:44,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:15:44,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:15:44,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:44,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:15:44,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:15:44,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:44" (1/1) ... [2022-11-22 00:15:44,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9c991c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:44, skipping insertion in model container [2022-11-22 00:15:44,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:44" (1/1) ... [2022-11-22 00:15:44,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:15:44,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:15:44,632 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-22 00:15:44,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:44,979 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:15:45,013 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-11-22 00:15:45,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:45,140 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:15:45,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45 WrapperNode [2022-11-22 00:15:45,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:45,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:45,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:15:45,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:15:45,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,207 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-11-22 00:15:45,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:45,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:15:45,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:15:45,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:15:45,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,239 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:15:45,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:15:45,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:15:45,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:15:45,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (1/1) ... [2022-11-22 00:15:45,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:15:45,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:15:45,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:15:45,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:15:45,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:15:45,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:15:45,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:15:45,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-22 00:15:45,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 00:15:45,333 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:15:45,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:15:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:15:45,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:15:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:15:45,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:15:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:15:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:15:45,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:15:45,338 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:15:45,547 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:15:45,549 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:15:46,057 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:15:46,212 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:15:46,212 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:15:46,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:46 BoogieIcfgContainer [2022-11-22 00:15:46,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:15:46,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:15:46,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:15:46,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:15:46,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:15:44" (1/3) ... [2022-11-22 00:15:46,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a0f44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:46, skipping insertion in model container [2022-11-22 00:15:46,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:45" (2/3) ... [2022-11-22 00:15:46,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a0f44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:46, skipping insertion in model container [2022-11-22 00:15:46,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:46" (3/3) ... [2022-11-22 00:15:46,225 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.opt.i [2022-11-22 00:15:46,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:15:46,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-22 00:15:46,245 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:15:46,320 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:15:46,378 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:15:46,400 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-22 00:15:46,406 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-22 00:15:46,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-11-22 00:15:46,492 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-11-22 00:15:46,492 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:15:46,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-22 00:15:46,503 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2022-11-22 00:15:56,614 INFO L134 LiptonReduction]: Checked pairs total: 5983 [2022-11-22 00:15:56,614 INFO L136 LiptonReduction]: Total number of compositions: 132 [2022-11-22 00:15:56,624 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-22 00:15:56,735 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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-22 00:15:56,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:15:56,766 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;@152d15fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:15:56,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-22 00:15:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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-22 00:15:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:15:56,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:56,778 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:15:56,779 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 575, now seen corresponding path program 1 times [2022-11-22 00:15:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:56,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738598347] [2022-11-22 00:15:56,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:56,804 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-22 00:15:56,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:56,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:56,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:56,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-22 00:15:56,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:56,929 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-22 00:15:56,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:56,931 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:56,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738598347] [2022-11-22 00:15:56,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738598347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:56,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:56,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:15:56,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542277147] [2022-11-22 00:15:56,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:56,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:15:56,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:15:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:15:56,970 INFO L87 Difference]: Start difference. First operand has 984 states, 973 states have (on average 3.317574511819116) internal successors, (3228), 983 states have internal predecessors, (3228), 0 states have call successors, (0), 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-22 00:15:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:57,155 INFO L93 Difference]: Finished difference Result 932 states and 2966 transitions. [2022-11-22 00:15:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:15:57,168 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-22 00:15:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:57,209 INFO L225 Difference]: With dead ends: 932 [2022-11-22 00:15:57,210 INFO L226 Difference]: Without dead ends: 932 [2022-11-22 00:15:57,211 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-22 00:15:57,215 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:57,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-22 00:15:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2022-11-22 00:15:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 927 states have (on average 3.199568500539374) internal successors, (2966), 931 states have internal predecessors, (2966), 0 states have call successors, (0), 0 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-22 00:15:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2966 transitions. [2022-11-22 00:15:57,357 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2966 transitions. Word has length 1 [2022-11-22 00:15:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:57,358 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2966 transitions. [2022-11-22 00:15:57,358 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-22 00:15:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2966 transitions. [2022-11-22 00:15:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 00:15:57,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:57,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:57,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:57,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:57,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1965242646, now seen corresponding path program 1 times [2022-11-22 00:15:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:57,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533666854] [2022-11-22 00:15:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:57,574 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-22 00:15:57,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:57,577 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:57,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:57,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:15:57,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:57,748 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-22 00:15:57,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:57,748 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:57,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533666854] [2022-11-22 00:15:57,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533666854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:57,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:57,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:15:57,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112692288] [2022-11-22 00:15:57,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:57,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:57,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:57,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:57,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:57,752 INFO L87 Difference]: Start difference. First operand 932 states and 2966 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:57,844 INFO L93 Difference]: Finished difference Result 792 states and 2489 transitions. [2022-11-22 00:15:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:57,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 00:15:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:57,850 INFO L225 Difference]: With dead ends: 792 [2022-11-22 00:15:57,851 INFO L226 Difference]: Without dead ends: 772 [2022-11-22 00:15:57,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:57,852 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:57,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-11-22 00:15:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2022-11-22 00:15:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 770 states have (on average 3.1662337662337663) internal successors, (2438), 771 states have internal predecessors, (2438), 0 states have call successors, (0), 0 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-22 00:15:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2438 transitions. [2022-11-22 00:15:57,885 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2438 transitions. Word has length 7 [2022-11-22 00:15:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:57,887 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 2438 transitions. [2022-11-22 00:15:57,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2438 transitions. [2022-11-22 00:15:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 00:15:57,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:57,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:57,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:58,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:58,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1187331955, now seen corresponding path program 1 times [2022-11-22 00:15:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:58,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017410731] [2022-11-22 00:15:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:58,110 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-22 00:15:58,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:58,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:58,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:58,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:15:58,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:58,289 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-22 00:15:58,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:58,290 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:58,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017410731] [2022-11-22 00:15:58,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017410731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:58,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:58,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:58,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127210868] [2022-11-22 00:15:58,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:58,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:58,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:58,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:58,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:58,293 INFO L87 Difference]: Start difference. First operand 772 states and 2438 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:58,520 INFO L93 Difference]: Finished difference Result 592 states and 1584 transitions. [2022-11-22 00:15:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:58,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 00:15:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:58,524 INFO L225 Difference]: With dead ends: 592 [2022-11-22 00:15:58,524 INFO L226 Difference]: Without dead ends: 472 [2022-11-22 00:15:58,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:58,525 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:58,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-22 00:15:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-11-22 00:15:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 470 states have (on average 2.6340425531914895) internal successors, (1238), 471 states have internal predecessors, (1238), 0 states have call successors, (0), 0 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-22 00:15:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1238 transitions. [2022-11-22 00:15:58,546 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1238 transitions. Word has length 9 [2022-11-22 00:15:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:58,546 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1238 transitions. [2022-11-22 00:15:58,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1238 transitions. [2022-11-22 00:15:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:15:58,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:58,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:58,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:58,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:58,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:58,762 INFO L85 PathProgramCache]: Analyzing trace with hash -289112148, now seen corresponding path program 1 times [2022-11-22 00:15:58,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:58,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579131848] [2022-11-22 00:15:58,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:58,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:58,765 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:58,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:58,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:15:58,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:58,983 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-22 00:15:58,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:58,983 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:58,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579131848] [2022-11-22 00:15:58,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579131848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:58,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:58,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331044923] [2022-11-22 00:15:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:58,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:15:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:15:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:58,987 INFO L87 Difference]: Start difference. First operand 472 states and 1238 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-22 00:15:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:59,240 INFO L93 Difference]: Finished difference Result 297 states and 686 transitions. [2022-11-22 00:15:59,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:15:59,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-22 00:15:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:59,242 INFO L225 Difference]: With dead ends: 297 [2022-11-22 00:15:59,243 INFO L226 Difference]: Without dead ends: 237 [2022-11-22 00:15:59,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:15:59,244 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:59,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-22 00:15:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2022-11-22 00:15:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 235 states have (on average 2.2680851063829786) internal successors, (533), 236 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-22 00:15:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 533 transitions. [2022-11-22 00:15:59,252 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 533 transitions. Word has length 12 [2022-11-22 00:15:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:59,252 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 533 transitions. [2022-11-22 00:15:59,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-22 00:15:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 533 transitions. [2022-11-22 00:15:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:15:59,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:59,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:59,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:59,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:59,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:15:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 562516090, now seen corresponding path program 1 times [2022-11-22 00:15:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:59,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881880100] [2022-11-22 00:15:59,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:59,468 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-22 00:15:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:59,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:59,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:15:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:59,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:15:59,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:59,703 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-22 00:15:59,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:59,703 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:59,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881880100] [2022-11-22 00:15:59,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881880100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:59,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:59,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:15:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831454587] [2022-11-22 00:15:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:59,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:15:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:59,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:15:59,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:15:59,707 INFO L87 Difference]: Start difference. First operand 237 states and 533 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:59,995 INFO L93 Difference]: Finished difference Result 190 states and 437 transitions. [2022-11-22 00:15:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:15:59,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 00:15:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:59,997 INFO L225 Difference]: With dead ends: 190 [2022-11-22 00:15:59,997 INFO L226 Difference]: Without dead ends: 177 [2022-11-22 00:15:59,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:59,998 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:59,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:15:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-22 00:16:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-11-22 00:16:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 2.36) internal successors, (413), 176 states have internal predecessors, (413), 0 states have call successors, (0), 0 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-22 00:16:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 413 transitions. [2022-11-22 00:16:00,004 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 413 transitions. Word has length 16 [2022-11-22 00:16:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:00,004 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 413 transitions. [2022-11-22 00:16:00,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 413 transitions. [2022-11-22 00:16:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:16:00,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:00,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:00,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:00,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:00,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:16:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:00,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1421382717, now seen corresponding path program 1 times [2022-11-22 00:16:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:16:00,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800662198] [2022-11-22 00:16:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:00,224 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-22 00:16:00,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:16:00,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:00,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:00,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:16:00,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:00,439 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-22 00:16:00,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:16:00,439 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:16:00,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800662198] [2022-11-22 00:16:00,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800662198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:00,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:00,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:00,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880396564] [2022-11-22 00:16:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:00,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:00,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:16:00,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:00,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:00,443 INFO L87 Difference]: Start difference. First operand 177 states and 413 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:00,583 INFO L93 Difference]: Finished difference Result 229 states and 521 transitions. [2022-11-22 00:16:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:00,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 00:16:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:00,584 INFO L225 Difference]: With dead ends: 229 [2022-11-22 00:16:00,585 INFO L226 Difference]: Without dead ends: 229 [2022-11-22 00:16:00,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:16:00,586 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:00,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 7 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-22 00:16:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2022-11-22 00:16:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 2.311111111111111) internal successors, (520), 226 states have internal predecessors, (520), 0 states have call successors, (0), 0 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-22 00:16:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 520 transitions. [2022-11-22 00:16:00,598 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 520 transitions. Word has length 21 [2022-11-22 00:16:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:00,599 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 520 transitions. [2022-11-22 00:16:00,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 520 transitions. [2022-11-22 00:16:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:16:00,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:00,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:00,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:00,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:00,813 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:16:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1622075413, now seen corresponding path program 2 times [2022-11-22 00:16:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:16:00,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445580017] [2022-11-22 00:16:00,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 00:16:00,815 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-22 00:16:00,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:16:00,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:00,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:00,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 00:16:00,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:16:00,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-22 00:16:00,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:01,587 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-22 00:16:01,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:16:01,587 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:16:01,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445580017] [2022-11-22 00:16:01,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445580017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:01,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:01,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:16:01,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060654691] [2022-11-22 00:16:01,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:01,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:16:01,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:16:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:16:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:01,590 INFO L87 Difference]: Start difference. First operand 227 states and 520 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:01,879 INFO L93 Difference]: Finished difference Result 269 states and 591 transitions. [2022-11-22 00:16:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:16:01,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 00:16:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:01,881 INFO L225 Difference]: With dead ends: 269 [2022-11-22 00:16:01,881 INFO L226 Difference]: Without dead ends: 269 [2022-11-22 00:16:01,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:16:01,882 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:01,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 35 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:16:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-22 00:16:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 215. [2022-11-22 00:16:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 213 states have (on average 2.3098591549295775) internal successors, (492), 214 states have internal predecessors, (492), 0 states have call successors, (0), 0 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-22 00:16:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 492 transitions. [2022-11-22 00:16:01,889 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 492 transitions. Word has length 21 [2022-11-22 00:16:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:01,890 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 492 transitions. [2022-11-22 00:16:01,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 492 transitions. [2022-11-22 00:16:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:16:01,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:01,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:01,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:02,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:02,104 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 00:16:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash -554190225, now seen corresponding path program 3 times [2022-11-22 00:16:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:16:02,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887255841] [2022-11-22 00:16:02,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:16:02,106 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-22 00:16:02,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:16:02,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:02,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:02,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 00:16:02,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-22 00:16:02,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:16:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:16:02,441 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-22 00:16:02,441 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:16:02,454 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-22 00:16:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-22 00:16:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-22 00:16:02,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-22 00:16:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-22 00:16:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-22 00:16:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-22 00:16:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-22 00:16:02,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-22 00:16:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-22 00:16:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-22 00:16:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-22 00:16:02,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-22 00:16:02,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:02,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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-22 00:16:02,677 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-22 00:16:02,682 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:16:02,683 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:16:02,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:16:02 BasicIcfg [2022-11-22 00:16:02,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:16:02,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:16:02,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:16:02,793 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:16:02,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:46" (3/4) ... [2022-11-22 00:16:02,797 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 00:16:02,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:16:02,797 INFO L158 Benchmark]: Toolchain (without parser) took 18482.03ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 52.8MB in the beginning and 43.9MB in the end (delta: 8.9MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-11-22 00:16:02,798 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:16:02,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 823.06ms. Allocated memory is still 75.5MB. Free memory was 52.6MB in the beginning and 45.1MB in the end (delta: 7.5MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-11-22 00:16:02,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.04ms. Allocated memory is still 75.5MB. Free memory was 45.1MB in the beginning and 42.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:16:02,799 INFO L158 Benchmark]: Boogie Preprocessor took 36.03ms. Allocated memory is still 75.5MB. Free memory was 42.4MB in the beginning and 40.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:16:02,799 INFO L158 Benchmark]: RCFGBuilder took 969.47ms. Allocated memory is still 75.5MB. Free memory was 40.3MB in the beginning and 41.0MB in the end (delta: -660.4kB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-22 00:16:02,799 INFO L158 Benchmark]: TraceAbstraction took 16576.11ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 40.2MB in the beginning and 44.9MB in the end (delta: -4.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2022-11-22 00:16:02,800 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 111.1MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:16:02,801 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.34ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 823.06ms. Allocated memory is still 75.5MB. Free memory was 52.6MB in the beginning and 45.1MB in the end (delta: 7.5MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.04ms. Allocated memory is still 75.5MB. Free memory was 45.1MB in the beginning and 42.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.03ms. Allocated memory is still 75.5MB. Free memory was 42.4MB in the beginning and 40.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 969.47ms. Allocated memory is still 75.5MB. Free memory was 40.3MB in the beginning and 41.0MB in the end (delta: -660.4kB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16576.11ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 40.2MB in the beginning and 44.9MB in the end (delta: -4.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 111.1MB. Free memory is still 43.9MB. 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.2s, 139 PlacesBefore, 44 PlacesAfterwards, 131 TransitionsBefore, 35 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 5983 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3439, independent: 3267, independent conditional: 0, independent unconditional: 3267, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1755, independent: 1703, independent conditional: 0, independent unconditional: 1703, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1755, independent: 1683, independent conditional: 0, independent unconditional: 1683, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 468, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 401, dependent conditional: 0, dependent unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3439, independent: 1564, independent conditional: 0, independent unconditional: 1564, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 1755, unknown conditional: 0, unknown unconditional: 1755] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t388; [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388, ((void *)0), P0, ((void *)0))=0, t388={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t389; [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389, ((void *)0), P1, ((void *)0))=1, t388={-6:0}, t389={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t390; [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390, ((void *)0), P2, ((void *)0))=2, t388={-6:0}, t389={-10:0}, t390={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=3, weak$$choice2=128, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={-6:0}, t389={-10:0}, t390={-2:0}, weak$$choice0=3, weak$$choice2=128, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=3, weak$$choice2=128, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 159 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 203 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 693 IncrementalHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 47 mSDtfsCounter, 693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=984occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 56 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 15 NumberOfNonLiveVariables, 834 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-22 00:16:02,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6248c96-e0c4-40f5-b568-f8cbdf850846/bin/utaipan-g80aRyZoba/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