./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9 --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 449d00de99d52e6ea9aa539e57f46adfc8dfbb78972c0dc655f91843e743f43f --- 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-6b4ec56 [2022-11-20 20:45:44,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:45:44,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:45:44,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:45:44,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:45:44,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:45:44,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:45:44,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:45:44,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:45:44,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:45:44,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:45:44,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:45:44,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:45:44,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:45:44,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:45:44,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:45:44,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:45:44,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:45:44,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:45:44,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:45:44,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:45:44,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:45:44,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:45:44,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:45:44,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:45:44,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:45:44,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:45:44,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:45:44,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:45:44,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:45:44,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:45:44,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:45:44,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:45:44,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:45:44,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:45:44,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:45:44,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:45:44,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:45:44,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:45:44,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:45:44,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:45:44,568 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-20 20:45:44,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:45:44,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:45:44,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:45:44,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:45:44,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:45:44,599 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:45:44,599 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:45:44,599 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:45:44,600 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:45:44,600 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:45:44,600 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:45:44,600 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:45:44,600 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:45:44,601 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:45:44,601 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:45:44,601 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:45:44,601 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:45:44,602 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:45:44,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:45:44,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:45:44,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:45:44,603 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:45:44,603 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:45:44,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:45:44,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:45:44,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:45:44,604 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:45:44,604 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:45:44,604 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 20:45:44,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:45:44,605 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:45:44,605 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:45:44,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:45:44,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:45:44,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:45:44,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:45:44,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:45:44,606 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:45:44,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:45:44,607 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:45:44,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:45:44,607 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:45:44,607 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_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/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_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9 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 -> 449d00de99d52e6ea9aa539e57f46adfc8dfbb78972c0dc655f91843e743f43f [2022-11-20 20:45:44,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:45:44,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:45:44,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:45:44,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:45:44,914 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:45:44,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i [2022-11-20 20:45:48,143 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:45:48,497 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:45:48,497 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i [2022-11-20 20:45:48,525 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/data/817543808/3e44113915704347bcf4a88d8f47b3f4/FLAG4a8734a2a [2022-11-20 20:45:48,540 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/data/817543808/3e44113915704347bcf4a88d8f47b3f4 [2022-11-20 20:45:48,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:45:48,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:45:48,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:45:48,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:45:48,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:45:48,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:45:48" (1/1) ... [2022-11-20 20:45:48,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc12c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:48, skipping insertion in model container [2022-11-20 20:45:48,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:45:48" (1/1) ... [2022-11-20 20:45:48,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:45:48,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:45:48,858 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_39c023e0-9028-498b-bbab-cd8a72685b2f/sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i[995,1008] [2022-11-20 20:45:49,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:45:49,151 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:45:49,166 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_39c023e0-9028-498b-bbab-cd8a72685b2f/sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i[995,1008] [2022-11-20 20:45:49,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:45:49,289 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:45:49,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49 WrapperNode [2022-11-20 20:45:49,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:45:49,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:45:49,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:45:49,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:45:49,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,341 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-11-20 20:45:49,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:45:49,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:45:49,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:45:49,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:45:49,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,387 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:45:49,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:45:49,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:45:49,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:45:49,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (1/1) ... [2022-11-20 20:45:49,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:45:49,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:45:49,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:45:49,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:45:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:45:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:45:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 20:45:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:45:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:45:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:45:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 20:45:49,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 20:45:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 20:45:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 20:45:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 20:45:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 20:45:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:45:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 20:45:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:45:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:45:49,497 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:45:49,744 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:45:49,746 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:45:50,272 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:45:50,864 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:45:50,864 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 20:45:50,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:45:50 BoogieIcfgContainer [2022-11-20 20:45:50,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:45:50,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:45:50,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:45:50,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:45:50,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:45:48" (1/3) ... [2022-11-20 20:45:50,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be95c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:45:50, skipping insertion in model container [2022-11-20 20:45:50,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:45:49" (2/3) ... [2022-11-20 20:45:50,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be95c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:45:50, skipping insertion in model container [2022-11-20 20:45:50,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:45:50" (3/3) ... [2022-11-20 20:45:50,882 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.oepc.i [2022-11-20 20:45:50,923 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:45:50,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-11-20 20:45:50,923 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:45:51,080 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 20:45:51,119 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:45:51,142 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 168 transitions, 351 flow [2022-11-20 20:45:51,151 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 168 transitions, 351 flow [2022-11-20 20:45:51,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 351 flow [2022-11-20 20:45:51,309 INFO L130 PetriNetUnfolder]: 2/165 cut-off events. [2022-11-20 20:45:51,312 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 20:45:51,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 165 events. 2/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 204 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2022-11-20 20:45:51,324 INFO L119 LiptonReduction]: Number of co-enabled transitions 5164 [2022-11-20 20:46:11,705 INFO L134 LiptonReduction]: Checked pairs total: 17191 [2022-11-20 20:46:11,705 INFO L136 LiptonReduction]: Total number of compositions: 167 [2022-11-20 20:46:11,715 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 63 transitions, 141 flow [2022-11-20 20:46:12,199 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10286 states, 9146 states have (on average 3.916794226984474) internal successors, (35823), 10285 states have internal predecessors, (35823), 0 states have call successors, (0), 0 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-20 20:46:12,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:46:12,233 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;@3a41e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:46:12,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-20 20:46:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 10286 states, 9146 states have (on average 3.916794226984474) internal successors, (35823), 10285 states have internal predecessors, (35823), 0 states have call successors, (0), 0 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-20 20:46:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 20:46:12,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:12,286 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 20:46:12,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:12,294 INFO L85 PathProgramCache]: Analyzing trace with hash 939, now seen corresponding path program 1 times [2022-11-20 20:46:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:12,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24815734] [2022-11-20 20:46:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:12,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:12,457 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-20 20:46:12,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:12,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24815734] [2022-11-20 20:46:12,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24815734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:12,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:12,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 20:46:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420835593] [2022-11-20 20:46:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:12,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 20:46:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 20:46:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:46:12,525 INFO L87 Difference]: Start difference. First operand has 10286 states, 9146 states have (on average 3.916794226984474) internal successors, (35823), 10285 states have internal predecessors, (35823), 0 states have call successors, (0), 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-20 20:46:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:12,742 INFO L93 Difference]: Finished difference Result 2486 states and 8177 transitions. [2022-11-20 20:46:12,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 20:46:12,745 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-20 20:46:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:12,778 INFO L225 Difference]: With dead ends: 2486 [2022-11-20 20:46:12,778 INFO L226 Difference]: Without dead ends: 2486 [2022-11-20 20:46:12,779 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-20 20:46:12,782 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:12,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-11-20 20:46:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2022-11-20 20:46:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2352 states have (on average 3.4766156462585034) internal successors, (8177), 2485 states have internal predecessors, (8177), 0 states have call successors, (0), 0 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-20 20:46:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 8177 transitions. [2022-11-20 20:46:12,941 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 8177 transitions. Word has length 1 [2022-11-20 20:46:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:12,942 INFO L495 AbstractCegarLoop]: Abstraction has 2486 states and 8177 transitions. [2022-11-20 20:46:12,946 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-20 20:46:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 8177 transitions. [2022-11-20 20:46:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 20:46:12,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:12,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 20:46:12,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:46:12,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:12,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash 928197, now seen corresponding path program 1 times [2022-11-20 20:46:12,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:12,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271924119] [2022-11-20 20:46:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:13,238 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-20 20:46:13,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:13,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271924119] [2022-11-20 20:46:13,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271924119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:13,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:13,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:46:13,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855204956] [2022-11-20 20:46:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:13,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:46:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:46:13,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:46:13,250 INFO L87 Difference]: Start difference. First operand 2486 states and 8177 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:13,419 INFO L93 Difference]: Finished difference Result 1502 states and 4781 transitions. [2022-11-20 20:46:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:46:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 20:46:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:13,431 INFO L225 Difference]: With dead ends: 1502 [2022-11-20 20:46:13,432 INFO L226 Difference]: Without dead ends: 1502 [2022-11-20 20:46:13,433 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-20 20:46:13,434 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:13,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-11-20 20:46:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2022-11-20 20:46:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1453 states have (on average 3.29043358568479) internal successors, (4781), 1501 states have internal predecessors, (4781), 0 states have call successors, (0), 0 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-20 20:46:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4781 transitions. [2022-11-20 20:46:13,502 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4781 transitions. Word has length 3 [2022-11-20 20:46:13,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:13,502 INFO L495 AbstractCegarLoop]: Abstraction has 1502 states and 4781 transitions. [2022-11-20 20:46:13,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4781 transitions. [2022-11-20 20:46:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 20:46:13,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:13,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 20:46:13,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:46:13,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:13,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash 928198, now seen corresponding path program 1 times [2022-11-20 20:46:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:13,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105507360] [2022-11-20 20:46:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:13,734 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-20 20:46:13,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:13,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105507360] [2022-11-20 20:46:13,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105507360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:13,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:13,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:46:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896309137] [2022-11-20 20:46:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:13,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:46:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:13,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:46:13,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:46:13,738 INFO L87 Difference]: Start difference. First operand 1502 states and 4781 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:13,824 INFO L93 Difference]: Finished difference Result 932 states and 2879 transitions. [2022-11-20 20:46:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:46:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 20:46:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:13,830 INFO L225 Difference]: With dead ends: 932 [2022-11-20 20:46:13,830 INFO L226 Difference]: Without dead ends: 932 [2022-11-20 20:46:13,832 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-20 20:46:13,834 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:13,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-20 20:46:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2022-11-20 20:46:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 914 states have (on average 3.149890590809628) internal successors, (2879), 931 states have internal predecessors, (2879), 0 states have call successors, (0), 0 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-20 20:46:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2879 transitions. [2022-11-20 20:46:13,864 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2879 transitions. Word has length 3 [2022-11-20 20:46:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:13,866 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2879 transitions. [2022-11-20 20:46:13,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2879 transitions. [2022-11-20 20:46:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 20:46:13,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:13,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:13,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:46:13,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash 321376791, now seen corresponding path program 1 times [2022-11-20 20:46:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:13,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086583961] [2022-11-20 20:46:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:14,141 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-20 20:46:14,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:14,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086583961] [2022-11-20 20:46:14,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086583961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:14,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:14,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:46:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66674905] [2022-11-20 20:46:14,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:14,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:46:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:14,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:46:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:46:14,144 INFO L87 Difference]: Start difference. First operand 932 states and 2879 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:14,259 INFO L93 Difference]: Finished difference Result 902 states and 2775 transitions. [2022-11-20 20:46:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:46:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 20:46:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:14,265 INFO L225 Difference]: With dead ends: 902 [2022-11-20 20:46:14,266 INFO L226 Difference]: Without dead ends: 902 [2022-11-20 20:46:14,266 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-20 20:46:14,267 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:14,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-11-20 20:46:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2022-11-20 20:46:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 884 states have (on average 3.1391402714932126) internal successors, (2775), 901 states have internal predecessors, (2775), 0 states have call successors, (0), 0 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-20 20:46:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 2775 transitions. [2022-11-20 20:46:14,296 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 2775 transitions. Word has length 10 [2022-11-20 20:46:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:14,297 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 2775 transitions. [2022-11-20 20:46:14,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 2775 transitions. [2022-11-20 20:46:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:46:14,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:14,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:14,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:46:14,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 181501456, now seen corresponding path program 1 times [2022-11-20 20:46:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:14,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355639225] [2022-11-20 20:46:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:14,525 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-20 20:46:14,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:14,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355639225] [2022-11-20 20:46:14,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355639225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:14,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:14,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:46:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394450923] [2022-11-20 20:46:14,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:14,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:46:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:46:14,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:46:14,529 INFO L87 Difference]: Start difference. First operand 902 states and 2775 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:14,682 INFO L93 Difference]: Finished difference Result 857 states and 2634 transitions. [2022-11-20 20:46:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:46:14,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 20:46:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:14,688 INFO L225 Difference]: With dead ends: 857 [2022-11-20 20:46:14,688 INFO L226 Difference]: Without dead ends: 857 [2022-11-20 20:46:14,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:46:14,689 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:14,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-11-20 20:46:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2022-11-20 20:46:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 840 states have (on average 3.1357142857142857) internal successors, (2634), 856 states have internal predecessors, (2634), 0 states have call successors, (0), 0 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-20 20:46:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 2634 transitions. [2022-11-20 20:46:14,723 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 2634 transitions. Word has length 11 [2022-11-20 20:46:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:14,724 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 2634 transitions. [2022-11-20 20:46:14,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 2634 transitions. [2022-11-20 20:46:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:46:14,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:14,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:14,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:46:14,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash 181501457, now seen corresponding path program 1 times [2022-11-20 20:46:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:14,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951566293] [2022-11-20 20:46:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:15,252 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-20 20:46:15,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:15,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951566293] [2022-11-20 20:46:15,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951566293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:15,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:15,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:46:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850311072] [2022-11-20 20:46:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:15,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:46:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:15,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:46:15,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:46:15,254 INFO L87 Difference]: Start difference. First operand 857 states and 2634 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:15,393 INFO L93 Difference]: Finished difference Result 812 states and 2493 transitions. [2022-11-20 20:46:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:46:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 20:46:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:15,398 INFO L225 Difference]: With dead ends: 812 [2022-11-20 20:46:15,398 INFO L226 Difference]: Without dead ends: 812 [2022-11-20 20:46:15,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:46:15,399 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:15,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 2 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-20 20:46:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-20 20:46:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 796 states have (on average 3.1319095477386933) internal successors, (2493), 811 states have internal predecessors, (2493), 0 states have call successors, (0), 0 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-20 20:46:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2493 transitions. [2022-11-20 20:46:15,425 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2493 transitions. Word has length 11 [2022-11-20 20:46:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:15,425 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2493 transitions. [2022-11-20 20:46:15,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2493 transitions. [2022-11-20 20:46:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:46:15,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:15,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:15,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:46:15,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1372741109, now seen corresponding path program 1 times [2022-11-20 20:46:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020128009] [2022-11-20 20:46:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:15,596 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-20 20:46:15,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:15,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020128009] [2022-11-20 20:46:15,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020128009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:15,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:15,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:46:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033980549] [2022-11-20 20:46:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:15,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:46:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:15,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:46:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:46:15,598 INFO L87 Difference]: Start difference. First operand 812 states and 2493 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:15,675 INFO L93 Difference]: Finished difference Result 800 states and 2452 transitions. [2022-11-20 20:46:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:46:15,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 20:46:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:15,680 INFO L225 Difference]: With dead ends: 800 [2022-11-20 20:46:15,681 INFO L226 Difference]: Without dead ends: 800 [2022-11-20 20:46:15,681 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-20 20:46:15,682 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:15,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-11-20 20:46:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2022-11-20 20:46:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 784 states have (on average 3.127551020408163) internal successors, (2452), 799 states have internal predecessors, (2452), 0 states have call successors, (0), 0 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-20 20:46:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2452 transitions. [2022-11-20 20:46:15,706 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2452 transitions. Word has length 11 [2022-11-20 20:46:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:15,706 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 2452 transitions. [2022-11-20 20:46:15,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2452 transitions. [2022-11-20 20:46:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:46:15,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:15,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:15,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:46:15,708 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -395408000, now seen corresponding path program 1 times [2022-11-20 20:46:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:15,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694004955] [2022-11-20 20:46:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:15,880 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-20 20:46:15,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:15,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694004955] [2022-11-20 20:46:15,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694004955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:15,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:15,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:46:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010503481] [2022-11-20 20:46:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:15,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:46:15,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:46:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:46:15,882 INFO L87 Difference]: Start difference. First operand 800 states and 2452 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-20 20:46:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:16,015 INFO L93 Difference]: Finished difference Result 1180 states and 3552 transitions. [2022-11-20 20:46:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:46:16,016 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-20 20:46:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:16,022 INFO L225 Difference]: With dead ends: 1180 [2022-11-20 20:46:16,022 INFO L226 Difference]: Without dead ends: 1180 [2022-11-20 20:46:16,023 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-20 20:46:16,023 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:16,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 7 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-11-20 20:46:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 880. [2022-11-20 20:46:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 864 states have (on average 3.1064814814814814) internal successors, (2684), 879 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2684 transitions. [2022-11-20 20:46:16,076 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2684 transitions. Word has length 12 [2022-11-20 20:46:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:16,077 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 2684 transitions. [2022-11-20 20:46:16,077 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-20 20:46:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2684 transitions. [2022-11-20 20:46:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:46:16,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:16,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:16,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:46:16,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash 649213322, now seen corresponding path program 1 times [2022-11-20 20:46:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:16,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054896787] [2022-11-20 20:46:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:16,319 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-20 20:46:16,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:16,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054896787] [2022-11-20 20:46:16,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054896787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:16,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:16,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:46:16,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21618433] [2022-11-20 20:46:16,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:16,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:46:16,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:46:16,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:46:16,321 INFO L87 Difference]: Start difference. First operand 880 states and 2684 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:16,460 INFO L93 Difference]: Finished difference Result 1072 states and 3085 transitions. [2022-11-20 20:46:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:46:16,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 20:46:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:16,466 INFO L225 Difference]: With dead ends: 1072 [2022-11-20 20:46:16,467 INFO L226 Difference]: Without dead ends: 1036 [2022-11-20 20:46:16,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:46:16,467 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:16,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 6 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-11-20 20:46:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 901. [2022-11-20 20:46:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 885 states have (on average 3.065536723163842) internal successors, (2713), 900 states have internal predecessors, (2713), 0 states have call successors, (0), 0 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-20 20:46:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2713 transitions. [2022-11-20 20:46:16,498 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2713 transitions. Word has length 13 [2022-11-20 20:46:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:16,499 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 2713 transitions. [2022-11-20 20:46:16,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2713 transitions. [2022-11-20 20:46:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:46:16,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:16,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:16,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 20:46:16,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:16,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 649191767, now seen corresponding path program 1 times [2022-11-20 20:46:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:16,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943448671] [2022-11-20 20:46:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:16,808 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-20 20:46:16,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:16,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943448671] [2022-11-20 20:46:16,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943448671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:16,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:16,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:46:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79613516] [2022-11-20 20:46:16,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:16,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:46:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:16,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:46:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:46:16,810 INFO L87 Difference]: Start difference. First operand 901 states and 2713 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:16,951 INFO L93 Difference]: Finished difference Result 893 states and 2687 transitions. [2022-11-20 20:46:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:46:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 20:46:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:16,958 INFO L225 Difference]: With dead ends: 893 [2022-11-20 20:46:16,958 INFO L226 Difference]: Without dead ends: 893 [2022-11-20 20:46:16,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:46:16,959 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:16,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-11-20 20:46:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2022-11-20 20:46:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 877 states have (on average 3.063854047890536) internal successors, (2687), 892 states have internal predecessors, (2687), 0 states have call successors, (0), 0 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-20 20:46:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 2687 transitions. [2022-11-20 20:46:16,990 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 2687 transitions. Word has length 13 [2022-11-20 20:46:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:16,991 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 2687 transitions. [2022-11-20 20:46:16,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 2687 transitions. [2022-11-20 20:46:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 20:46:16,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:16,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:16,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:46:16,992 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:16,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash -258636098, now seen corresponding path program 1 times [2022-11-20 20:46:16,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:16,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106475094] [2022-11-20 20:46:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:19,208 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-20 20:46:19,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:19,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106475094] [2022-11-20 20:46:19,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106475094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:19,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:19,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 20:46:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399935495] [2022-11-20 20:46:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:19,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:46:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:19,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:46:19,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:46:19,210 INFO L87 Difference]: Start difference. First operand 893 states and 2687 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-20 20:46:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:19,602 INFO L93 Difference]: Finished difference Result 1115 states and 3351 transitions. [2022-11-20 20:46:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:46:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-20 20:46:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:19,613 INFO L225 Difference]: With dead ends: 1115 [2022-11-20 20:46:19,614 INFO L226 Difference]: Without dead ends: 1115 [2022-11-20 20:46:19,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-11-20 20:46:19,615 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:19,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 12 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:46:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2022-11-20 20:46:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 971. [2022-11-20 20:46:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 955 states have (on average 3.0439790575916232) internal successors, (2907), 970 states have internal predecessors, (2907), 0 states have call successors, (0), 0 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-20 20:46:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2907 transitions. [2022-11-20 20:46:19,646 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 2907 transitions. Word has length 14 [2022-11-20 20:46:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:19,647 INFO L495 AbstractCegarLoop]: Abstraction has 971 states and 2907 transitions. [2022-11-20 20:46:19,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-20 20:46:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 2907 transitions. [2022-11-20 20:46:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 20:46:19,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:19,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 20:46:19,649 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:19,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1875795140, now seen corresponding path program 2 times [2022-11-20 20:46:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:19,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233928785] [2022-11-20 20:46:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:46:21,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:21,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233928785] [2022-11-20 20:46:21,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233928785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:21,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:21,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 20:46:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132296159] [2022-11-20 20:46:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:21,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:46:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:46:21,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:46:21,481 INFO L87 Difference]: Start difference. First operand 971 states and 2907 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-20 20:46:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:22,133 INFO L93 Difference]: Finished difference Result 1178 states and 3540 transitions. [2022-11-20 20:46:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:46:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-20 20:46:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:22,145 INFO L225 Difference]: With dead ends: 1178 [2022-11-20 20:46:22,151 INFO L226 Difference]: Without dead ends: 1178 [2022-11-20 20:46:22,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-20 20:46:22,152 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:22,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 16 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:46:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-11-20 20:46:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 956. [2022-11-20 20:46:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 940 states have (on average 3.0595744680851062) internal successors, (2876), 955 states have internal predecessors, (2876), 0 states have call successors, (0), 0 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-20 20:46:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2876 transitions. [2022-11-20 20:46:22,186 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2876 transitions. Word has length 14 [2022-11-20 20:46:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:22,187 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 2876 transitions. [2022-11-20 20:46:22,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-20 20:46:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2876 transitions. [2022-11-20 20:46:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 20:46:22,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:22,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:22,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 20:46:22,189 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 273644304, now seen corresponding path program 3 times [2022-11-20 20:46:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:22,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518374300] [2022-11-20 20:46:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:22,425 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-20 20:46:22,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:22,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518374300] [2022-11-20 20:46:22,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518374300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:22,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:22,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:46:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458134590] [2022-11-20 20:46:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:22,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:46:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:22,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:46:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:46:22,428 INFO L87 Difference]: Start difference. First operand 956 states and 2876 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-20 20:46:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:22,503 INFO L93 Difference]: Finished difference Result 610 states and 1549 transitions. [2022-11-20 20:46:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:46:22,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-20 20:46:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:22,533 INFO L225 Difference]: With dead ends: 610 [2022-11-20 20:46:22,533 INFO L226 Difference]: Without dead ends: 610 [2022-11-20 20:46:22,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:46:22,534 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:22,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-20 20:46:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-11-20 20:46:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 594 states have (on average 2.6077441077441077) internal successors, (1549), 609 states have internal predecessors, (1549), 0 states have call successors, (0), 0 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-20 20:46:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1549 transitions. [2022-11-20 20:46:22,551 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1549 transitions. Word has length 14 [2022-11-20 20:46:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:22,553 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 1549 transitions. [2022-11-20 20:46:22,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-20 20:46:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1549 transitions. [2022-11-20 20:46:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:46:22,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:22,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:22,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 20:46:22,555 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1702834941, now seen corresponding path program 1 times [2022-11-20 20:46:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:22,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616394435] [2022-11-20 20:46:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:24,253 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-20 20:46:24,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:24,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616394435] [2022-11-20 20:46:24,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616394435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:24,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:24,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:46:24,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994625762] [2022-11-20 20:46:24,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:24,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 20:46:24,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:24,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 20:46:24,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:46:24,255 INFO L87 Difference]: Start difference. First operand 610 states and 1549 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:24,840 INFO L93 Difference]: Finished difference Result 639 states and 1587 transitions. [2022-11-20 20:46:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:46:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 20:46:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:24,843 INFO L225 Difference]: With dead ends: 639 [2022-11-20 20:46:24,843 INFO L226 Difference]: Without dead ends: 633 [2022-11-20 20:46:24,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-20 20:46:24,844 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:24,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 13 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:46:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-11-20 20:46:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 555. [2022-11-20 20:46:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 539 states have (on average 2.5918367346938775) internal successors, (1397), 554 states have internal predecessors, (1397), 0 states have call successors, (0), 0 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-20 20:46:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1397 transitions. [2022-11-20 20:46:24,860 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1397 transitions. Word has length 15 [2022-11-20 20:46:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:24,860 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 1397 transitions. [2022-11-20 20:46:24,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1397 transitions. [2022-11-20 20:46:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 20:46:24,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:24,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:24,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 20:46:24,862 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:24,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:24,863 INFO L85 PathProgramCache]: Analyzing trace with hash 823275690, now seen corresponding path program 1 times [2022-11-20 20:46:24,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:24,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026702838] [2022-11-20 20:46:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:46:25,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026702838] [2022-11-20 20:46:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026702838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:25,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:25,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:46:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583617147] [2022-11-20 20:46:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:25,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:46:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:25,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:46:25,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:46:25,072 INFO L87 Difference]: Start difference. First operand 555 states and 1397 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:25,162 INFO L93 Difference]: Finished difference Result 242 states and 499 transitions. [2022-11-20 20:46:25,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:46:25,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 20:46:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:25,163 INFO L225 Difference]: With dead ends: 242 [2022-11-20 20:46:25,163 INFO L226 Difference]: Without dead ends: 242 [2022-11-20 20:46:25,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:46:25,164 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:25,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-20 20:46:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-20 20:46:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 232 states have (on average 2.1508620689655173) internal successors, (499), 241 states have internal predecessors, (499), 0 states have call successors, (0), 0 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-20 20:46:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 499 transitions. [2022-11-20 20:46:25,170 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 499 transitions. Word has length 16 [2022-11-20 20:46:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:25,178 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 499 transitions. [2022-11-20 20:46:25,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 499 transitions. [2022-11-20 20:46:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:46:25,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:25,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:25,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 20:46:25,179 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1369634745, now seen corresponding path program 1 times [2022-11-20 20:46:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:25,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774292694] [2022-11-20 20:46:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:46:25,390 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-20 20:46:25,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:46:25,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774292694] [2022-11-20 20:46:25,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774292694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:46:25,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:46:25,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:46:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754039143] [2022-11-20 20:46:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:46:25,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:46:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:46:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:46:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:46:25,396 INFO L87 Difference]: Start difference. First operand 242 states and 499 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:46:25,497 INFO L93 Difference]: Finished difference Result 151 states and 317 transitions. [2022-11-20 20:46:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:46:25,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:46:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:46:25,499 INFO L225 Difference]: With dead ends: 151 [2022-11-20 20:46:25,499 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 20:46:25,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:46:25,500 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:46:25,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:46:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 20:46:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-20 20:46:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 149 states have (on average 2.12751677852349) internal successors, (317), 150 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-20 20:46:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 317 transitions. [2022-11-20 20:46:25,504 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 317 transitions. Word has length 18 [2022-11-20 20:46:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:46:25,505 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 317 transitions. [2022-11-20 20:46:25,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:46:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 317 transitions. [2022-11-20 20:46:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:46:25,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:46:25,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:25,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 20:46:25,506 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:46:25,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:46:25,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2098062423, now seen corresponding path program 1 times [2022-11-20 20:46:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:46:25,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987529634] [2022-11-20 20:46:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:46:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:46:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:46:25,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 20:46:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:46:25,797 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 20:46:25,797 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 20:46:25,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-11-20 20:46:25,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-11-20 20:46:25,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-11-20 20:46:25,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-11-20 20:46:25,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-11-20 20:46:25,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-11-20 20:46:25,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-11-20 20:46:25,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-11-20 20:46:25,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-11-20 20:46:25,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-11-20 20:46:25,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-11-20 20:46:25,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-11-20 20:46:25,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-11-20 20:46:25,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-11-20 20:46:25,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-11-20 20:46:25,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-11-20 20:46:25,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-11-20 20:46:25,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-11-20 20:46:25,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-11-20 20:46:25,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-11-20 20:46:25,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-11-20 20:46:25,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-11-20 20:46:25,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-11-20 20:46:25,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-11-20 20:46:25,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-11-20 20:46:25,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-11-20 20:46:25,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-11-20 20:46:25,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-11-20 20:46:25,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-11-20 20:46:25,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-11-20 20:46:25,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-11-20 20:46:25,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-11-20 20:46:25,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-11-20 20:46:25,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-11-20 20:46:25,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-11-20 20:46:25,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2022-11-20 20:46:25,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2022-11-20 20:46:25,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2022-11-20 20:46:25,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2022-11-20 20:46:25,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-11-20 20:46:25,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-11-20 20:46:25,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-11-20 20:46:25,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-11-20 20:46:25,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-11-20 20:46:25,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-11-20 20:46:25,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-11-20 20:46:25,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-11-20 20:46:25,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-11-20 20:46:25,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-11-20 20:46:25,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-11-20 20:46:25,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-11-20 20:46:25,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-11-20 20:46:25,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-11-20 20:46:25,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-11-20 20:46:25,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-11-20 20:46:25,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-11-20 20:46:25,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-11-20 20:46:25,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2022-11-20 20:46:25,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2022-11-20 20:46:25,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2022-11-20 20:46:25,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2022-11-20 20:46:25,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 20:46:25,817 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:46:25,824 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 20:46:25,824 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:46:25,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:46:25 BasicIcfg [2022-11-20 20:46:25,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:46:25,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:46:25,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:46:25,933 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:46:25,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:45:50" (3/4) ... [2022-11-20 20:46:25,936 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 20:46:25,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:46:25,937 INFO L158 Benchmark]: Toolchain (without parser) took 37391.85ms. Allocated memory was 157.3MB in the beginning and 453.0MB in the end (delta: 295.7MB). Free memory was 118.4MB in the beginning and 328.3MB in the end (delta: -209.9MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2022-11-20 20:46:25,937 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 157.3MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:46:25,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.33ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 94.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 20:46:25,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.05ms. Allocated memory is still 157.3MB. Free memory was 94.8MB in the beginning and 92.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:46:25,938 INFO L158 Benchmark]: Boogie Preprocessor took 51.28ms. Allocated memory is still 157.3MB. Free memory was 92.5MB in the beginning and 90.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:46:25,939 INFO L158 Benchmark]: RCFGBuilder took 1473.72ms. Allocated memory is still 157.3MB. Free memory was 90.1MB in the beginning and 53.1MB in the end (delta: 37.0MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-11-20 20:46:25,939 INFO L158 Benchmark]: TraceAbstraction took 35062.22ms. Allocated memory was 157.3MB in the beginning and 453.0MB in the end (delta: 295.7MB). Free memory was 52.4MB in the beginning and 329.3MB in the end (delta: -276.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2022-11-20 20:46:25,940 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 453.0MB. Free memory was 329.3MB in the beginning and 328.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:46:25,941 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 157.3MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.33ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 94.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.05ms. Allocated memory is still 157.3MB. Free memory was 94.8MB in the beginning and 92.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.28ms. Allocated memory is still 157.3MB. Free memory was 92.5MB in the beginning and 90.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1473.72ms. Allocated memory is still 157.3MB. Free memory was 90.1MB in the beginning and 53.1MB in the end (delta: 37.0MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35062.22ms. Allocated memory was 157.3MB in the beginning and 453.0MB in the end (delta: 295.7MB). Free memory was 52.4MB in the beginning and 329.3MB in the end (delta: -276.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 453.0MB. Free memory was 329.3MB in the beginning and 328.3MB in the end (delta: 1.0MB). 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: 20.6s, 176 PlacesBefore, 72 PlacesAfterwards, 168 TransitionsBefore, 63 TransitionsAfterwards, 5164 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 93 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 167 TotalNumberOfCompositions, 17191 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8374, independent: 8032, independent conditional: 0, independent unconditional: 8032, dependent: 261, dependent conditional: 0, dependent unconditional: 261, unknown: 81, unknown conditional: 0, unknown unconditional: 81] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3441, independent: 3372, independent conditional: 0, independent unconditional: 3372, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3441, independent: 3118, independent conditional: 0, independent unconditional: 3118, dependent: 323, dependent conditional: 0, dependent unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 323, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1787, independent: 1227, independent conditional: 0, independent unconditional: 1227, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 319, unknown conditional: 0, unknown unconditional: 319] ], Cache Queries: [ total: 8374, independent: 4660, independent conditional: 0, independent unconditional: 4660, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 3509, unknown conditional: 0, unknown unconditional: 3509] , Statistics on independence cache: Total cache size (in pairs): 471, Positive cache size: 445, Positive conditional cache size: 0, Positive unconditional cache size: 445, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L832] 0 pthread_t t2201; [L833] FCALL, FORK 0 pthread_create(&t2201, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2201, ((void *)0), P0, ((void *)0))=8, t2201={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 pthread_t t2202; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2201={7:0}, t2202={5:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t2202, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2202, ((void *)0), P1, ((void *)0))=9, t2201={7:0}, t2202={5:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 pthread_t t2203; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2201={7:0}, t2202={5:0}, t2203={6:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t2203, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2203, ((void *)0), P2, ((void *)0))=10, t2201={7:0}, t2202={5:0}, t2203={6:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=255, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=255, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=255, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 \read(y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=255, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L839] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L841] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L841] RET 0 assume_abort_if_not(main$tmp_guard0) [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 \read(y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2201={7:0}, t2202={5:0}, t2203={6:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L852] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 830]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 833]: 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: 835]: 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, 213 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 34.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 577 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1442 IncrementalHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 43 mSDtfsCounter, 1442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10286occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 879 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 2053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-20 20:46:25,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9 --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 449d00de99d52e6ea9aa539e57f46adfc8dfbb78972c0dc655f91843e743f43f --- 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-6b4ec56 [2022-11-20 20:46:28,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:46:28,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:46:28,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:46:28,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:46:28,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:46:28,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:46:28,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:46:28,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:46:28,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:46:28,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:46:28,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:46:28,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:46:28,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:46:28,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:46:28,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:46:28,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:46:28,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:46:28,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:46:28,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:46:28,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:46:28,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:46:28,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:46:28,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:46:28,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:46:28,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:46:28,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:46:28,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:46:28,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:46:28,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:46:28,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:46:28,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:46:28,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:46:28,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:46:28,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:46:28,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:46:28,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:46:28,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:46:28,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:46:28,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:46:28,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:46:28,405 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-20 20:46:28,455 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:46:28,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:46:28,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:46:28,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:46:28,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:46:28,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:46:28,458 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:46:28,458 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:46:28,459 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:46:28,459 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:46:28,460 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:46:28,460 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:46:28,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:46:28,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:46:28,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:46:28,462 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:46:28,462 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:46:28,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:46:28,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:46:28,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:46:28,463 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:46:28,463 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:46:28,463 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 20:46:28,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:46:28,464 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:46:28,464 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 20:46:28,464 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 20:46:28,464 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:46:28,464 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:46:28,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:46:28,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 20:46:28,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:46:28,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:46:28,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:46:28,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:46:28,466 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-20 20:46:28,466 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 20:46:28,466 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:46:28,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 20:46:28,467 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_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/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_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9 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 -> 449d00de99d52e6ea9aa539e57f46adfc8dfbb78972c0dc655f91843e743f43f [2022-11-20 20:46:28,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:46:28,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:46:28,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:46:28,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:46:28,896 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:46:28,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i [2022-11-20 20:46:32,109 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:46:32,434 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:46:32,434 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i [2022-11-20 20:46:32,450 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/data/246b68cb3/6f3320fe0a604e58a24e6f38b8afdb5a/FLAG690d0c428 [2022-11-20 20:46:32,465 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/data/246b68cb3/6f3320fe0a604e58a24e6f38b8afdb5a [2022-11-20 20:46:32,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:46:32,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:46:32,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:46:32,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:46:32,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:46:32,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:46:32" (1/1) ... [2022-11-20 20:46:32,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48575610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:32, skipping insertion in model container [2022-11-20 20:46:32,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:46:32" (1/1) ... [2022-11-20 20:46:32,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:46:32,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:46:32,704 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_39c023e0-9028-498b-bbab-cd8a72685b2f/sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i[995,1008] [2022-11-20 20:46:33,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:46:33,030 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:46:33,042 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_39c023e0-9028-498b-bbab-cd8a72685b2f/sv-benchmarks/c/pthread-wmm/safe018_power.oepc.i[995,1008] [2022-11-20 20:46:33,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:46:33,181 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:46:33,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33 WrapperNode [2022-11-20 20:46:33,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:46:33,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:46:33,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:46:33,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:46:33,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,275 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-20 20:46:33,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:46:33,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:46:33,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:46:33,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:46:33,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,338 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:46:33,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:46:33,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:46:33,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:46:33,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (1/1) ... [2022-11-20 20:46:33,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:46:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:46:33,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:46:33,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:46:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 20:46:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 20:46:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:46:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:46:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:46:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 20:46:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 20:46:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 20:46:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 20:46:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 20:46:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 20:46:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 20:46:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 20:46:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 20:46:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 20:46:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:46:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:46:33,433 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:46:33,707 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:46:33,709 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:46:34,363 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:46:34,973 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:46:34,973 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 20:46:34,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:46:34 BoogieIcfgContainer [2022-11-20 20:46:34,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:46:34,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:46:34,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:46:34,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:46:34,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:46:32" (1/3) ... [2022-11-20 20:46:34,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb5b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:46:34, skipping insertion in model container [2022-11-20 20:46:34,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:46:33" (2/3) ... [2022-11-20 20:46:34,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb5b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:46:34, skipping insertion in model container [2022-11-20 20:46:34,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:46:34" (3/3) ... [2022-11-20 20:46:34,988 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.oepc.i [2022-11-20 20:46:35,006 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:46:35,007 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-11-20 20:46:35,007 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:46:35,167 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 20:46:35,211 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:46:35,241 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 169 transitions, 353 flow [2022-11-20 20:46:35,245 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 169 transitions, 353 flow [2022-11-20 20:46:35,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 353 flow [2022-11-20 20:46:35,387 INFO L130 PetriNetUnfolder]: 2/166 cut-off events. [2022-11-20 20:46:35,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 20:46:35,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 166 events. 2/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2022-11-20 20:46:35,399 INFO L119 LiptonReduction]: Number of co-enabled transitions 5164 [2022-11-20 20:46:48,912 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 195 DAG size of output: 194 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:46:58,336 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 223 DAG size of output: 221 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:47:05,060 WARN L233 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 221 DAG size of output: 221 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 20:47:23,595 INFO L134 LiptonReduction]: Checked pairs total: 15131 [2022-11-20 20:47:23,595 INFO L136 LiptonReduction]: Total number of compositions: 167 [2022-11-20 20:47:23,603 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 63 transitions, 141 flow [2022-11-20 20:47:24,030 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10286 states, 9146 states have (on average 3.916794226984474) internal successors, (35823), 10285 states have internal predecessors, (35823), 0 states have call successors, (0), 0 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-20 20:47:24,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:47:24,059 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;@4ddc3f01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:47:24,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-20 20:47:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 10286 states, 9146 states have (on average 3.916794226984474) internal successors, (35823), 10285 states have internal predecessors, (35823), 0 states have call successors, (0), 0 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-20 20:47:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 20:47:24,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:24,104 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 20:47:24,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:24,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 944, now seen corresponding path program 1 times [2022-11-20 20:47:24,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:24,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478280389] [2022-11-20 20:47:24,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:24,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:47:24,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:24,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:24,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:47:24,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 20:47:24,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:47:24,341 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-20 20:47:24,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:47:24,342 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:47:24,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478280389] [2022-11-20 20:47:24,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478280389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:47:24,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:47:24,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 20:47:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253987156] [2022-11-20 20:47:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:47:24,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 20:47:24,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:47:24,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 20:47:24,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 20:47:24,407 INFO L87 Difference]: Start difference. First operand has 10286 states, 9146 states have (on average 3.916794226984474) internal successors, (35823), 10285 states have internal predecessors, (35823), 0 states have call successors, (0), 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-20 20:47:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:47:24,738 INFO L93 Difference]: Finished difference Result 2486 states and 8177 transitions. [2022-11-20 20:47:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 20:47:24,741 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-20 20:47:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:47:24,777 INFO L225 Difference]: With dead ends: 2486 [2022-11-20 20:47:24,777 INFO L226 Difference]: Without dead ends: 2486 [2022-11-20 20:47:24,778 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-20 20:47:24,781 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:47:24,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:47:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-11-20 20:47:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2022-11-20 20:47:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2352 states have (on average 3.4766156462585034) internal successors, (8177), 2485 states have internal predecessors, (8177), 0 states have call successors, (0), 0 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-20 20:47:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 8177 transitions. [2022-11-20 20:47:25,069 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 8177 transitions. Word has length 1 [2022-11-20 20:47:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:47:25,070 INFO L495 AbstractCegarLoop]: Abstraction has 2486 states and 8177 transitions. [2022-11-20 20:47:25,071 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-20 20:47:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 8177 transitions. [2022-11-20 20:47:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 20:47:25,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:25,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 20:47:25,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:25,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:25,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2022-11-20 20:47:25,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:25,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921626215] [2022-11-20 20:47:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:25,274 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-20 20:47:25,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:25,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:25,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:47:25,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:47:25,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:47:25,635 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 20:47:25,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 20:47:25,669 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-20 20:47:25,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:47:25,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:47:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921626215] [2022-11-20 20:47:25,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921626215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:47:25,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:47:25,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:47:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020775754] [2022-11-20 20:47:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:47:25,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:47:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:47:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:47:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:47:25,677 INFO L87 Difference]: Start difference. First operand 2486 states and 8177 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:47:25,938 INFO L93 Difference]: Finished difference Result 1502 states and 4781 transitions. [2022-11-20 20:47:25,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:47:25,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 20:47:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:47:25,949 INFO L225 Difference]: With dead ends: 1502 [2022-11-20 20:47:25,949 INFO L226 Difference]: Without dead ends: 1502 [2022-11-20 20:47:25,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:47:25,996 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:47:25,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:47:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-11-20 20:47:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2022-11-20 20:47:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1453 states have (on average 3.29043358568479) internal successors, (4781), 1501 states have internal predecessors, (4781), 0 states have call successors, (0), 0 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-20 20:47:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4781 transitions. [2022-11-20 20:47:26,108 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4781 transitions. Word has length 3 [2022-11-20 20:47:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:47:26,108 INFO L495 AbstractCegarLoop]: Abstraction has 1502 states and 4781 transitions. [2022-11-20 20:47:26,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4781 transitions. [2022-11-20 20:47:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 20:47:26,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:26,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 20:47:26,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-20 20:47:26,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:26,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:26,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash 930059, now seen corresponding path program 1 times [2022-11-20 20:47:26,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:26,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328751454] [2022-11-20 20:47:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:26,323 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-20 20:47:26,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:26,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:26,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:47:26,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 20:47:26,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:47:26,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:47:26,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 20:47:26,633 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-20 20:47:26,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:47:26,634 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:47:26,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328751454] [2022-11-20 20:47:26,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328751454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:47:26,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:47:26,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 20:47:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132472133] [2022-11-20 20:47:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:47:26,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:47:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:47:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:47:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:47:26,640 INFO L87 Difference]: Start difference. First operand 1502 states and 4781 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:47:26,792 INFO L93 Difference]: Finished difference Result 932 states and 2879 transitions. [2022-11-20 20:47:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:47:26,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 20:47:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:47:26,799 INFO L225 Difference]: With dead ends: 932 [2022-11-20 20:47:26,800 INFO L226 Difference]: Without dead ends: 932 [2022-11-20 20:47:26,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:47:26,801 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:47:26,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:47:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-20 20:47:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2022-11-20 20:47:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 914 states have (on average 3.149890590809628) internal successors, (2879), 931 states have internal predecessors, (2879), 0 states have call successors, (0), 0 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-20 20:47:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2879 transitions. [2022-11-20 20:47:26,844 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2879 transitions. Word has length 3 [2022-11-20 20:47:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:47:26,844 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2879 transitions. [2022-11-20 20:47:26,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2879 transitions. [2022-11-20 20:47:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 20:47:26,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:26,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:47:26,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:27,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:27,070 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:27,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash -717251789, now seen corresponding path program 1 times [2022-11-20 20:47:27,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:27,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113896086] [2022-11-20 20:47:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:27,072 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-20 20:47:27,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:27,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:27,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:47:27,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:47:27,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:47:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:47:27,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:47:27,380 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:47:27,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113896086] [2022-11-20 20:47:27,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113896086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:47:27,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:47:27,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:47:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518622141] [2022-11-20 20:47:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:47:27,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:47:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:47:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:47:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:47:27,398 INFO L87 Difference]: Start difference. First operand 932 states and 2879 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:47:27,599 INFO L93 Difference]: Finished difference Result 568 states and 1461 transitions. [2022-11-20 20:47:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:47:27,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 20:47:27,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:47:27,603 INFO L225 Difference]: With dead ends: 568 [2022-11-20 20:47:27,603 INFO L226 Difference]: Without dead ends: 568 [2022-11-20 20:47:27,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:47:27,604 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:47:27,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:47:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-11-20 20:47:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2022-11-20 20:47:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 550 states have (on average 2.6563636363636363) internal successors, (1461), 567 states have internal predecessors, (1461), 0 states have call successors, (0), 0 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-20 20:47:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1461 transitions. [2022-11-20 20:47:27,630 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1461 transitions. Word has length 10 [2022-11-20 20:47:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:47:27,631 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 1461 transitions. [2022-11-20 20:47:27,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1461 transitions. [2022-11-20 20:47:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:47:27,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:27,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:47:27,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:27,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:27,846 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash 368139462, now seen corresponding path program 1 times [2022-11-20 20:47:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:27,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246343112] [2022-11-20 20:47:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:27,847 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-20 20:47:27,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:27,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:27,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:47:28,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:47:28,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:47:28,119 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-20 20:47:28,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:47:28,120 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:47:28,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246343112] [2022-11-20 20:47:28,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246343112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:47:28,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:47:28,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:47:28,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275391402] [2022-11-20 20:47:28,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:47:28,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:47:28,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:47:28,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:47:28,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:47:28,122 INFO L87 Difference]: Start difference. First operand 568 states and 1461 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:47:28,342 INFO L93 Difference]: Finished difference Result 220 states and 448 transitions. [2022-11-20 20:47:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:47:28,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 20:47:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:47:28,344 INFO L225 Difference]: With dead ends: 220 [2022-11-20 20:47:28,344 INFO L226 Difference]: Without dead ends: 220 [2022-11-20 20:47:28,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:47:28,345 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:47:28,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:47:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-20 20:47:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-20 20:47:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 2.1538461538461537) internal successors, (448), 219 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-20 20:47:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 448 transitions. [2022-11-20 20:47:28,353 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 448 transitions. Word has length 12 [2022-11-20 20:47:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:47:28,354 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 448 transitions. [2022-11-20 20:47:28,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 448 transitions. [2022-11-20 20:47:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:47:28,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:28,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:47:28,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:28,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:28,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash -368018048, now seen corresponding path program 1 times [2022-11-20 20:47:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:28,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833782341] [2022-11-20 20:47:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:28,579 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-20 20:47:28,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:28,581 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:28,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:47:28,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 20:47:28,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:47:28,921 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-20 20:47:28,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:47:28,922 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:47:28,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833782341] [2022-11-20 20:47:28,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833782341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:47:28,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:47:28,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:47:28,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963906939] [2022-11-20 20:47:28,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:47:28,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:47:28,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:47:28,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:47:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:47:28,924 INFO L87 Difference]: Start difference. First operand 220 states and 448 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:47:29,258 INFO L93 Difference]: Finished difference Result 119 states and 252 transitions. [2022-11-20 20:47:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:47:29,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 20:47:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:47:29,259 INFO L225 Difference]: With dead ends: 119 [2022-11-20 20:47:29,259 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 20:47:29,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:47:29,260 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:47:29,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 18 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:47:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 20:47:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-20 20:47:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 118 states have internal predecessors, (252), 0 states have call successors, (0), 0 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-20 20:47:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 252 transitions. [2022-11-20 20:47:29,265 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 252 transitions. Word has length 15 [2022-11-20 20:47:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:47:29,266 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 252 transitions. [2022-11-20 20:47:29,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 252 transitions. [2022-11-20 20:47:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:47:29,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:29,267 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-20 20:47:29,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:29,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:29,481 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:29,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1568423212, now seen corresponding path program 1 times [2022-11-20 20:47:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:29,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026416642] [2022-11-20 20:47:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:29,482 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-20 20:47:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:29,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:29,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:47:29,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:47:29,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:47:52,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 213 [2022-11-20 20:47:52,621 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-20 20:47:52,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:47:52,621 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:47:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026416642] [2022-11-20 20:47:52,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026416642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:47:52,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:47:52,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:47:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012253475] [2022-11-20 20:47:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:47:52,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:47:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:47:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:47:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:47:52,624 INFO L87 Difference]: Start difference. First operand 119 states and 252 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:47:52,781 INFO L93 Difference]: Finished difference Result 118 states and 251 transitions. [2022-11-20 20:47:52,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:47:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:47:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:47:52,783 INFO L225 Difference]: With dead ends: 118 [2022-11-20 20:47:52,783 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 20:47:52,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-20 20:47:52,784 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:47:52,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:47:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 20:47:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-20 20:47:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 2.1826086956521737) internal successors, (251), 117 states have internal predecessors, (251), 0 states have call successors, (0), 0 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-20 20:47:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 251 transitions. [2022-11-20 20:47:52,788 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 251 transitions. Word has length 19 [2022-11-20 20:47:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:47:52,789 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 251 transitions. [2022-11-20 20:47:52,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 251 transitions. [2022-11-20 20:47:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:47:52,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:52,790 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-20 20:47:52,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:52,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:52,991 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:52,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1568423213, now seen corresponding path program 1 times [2022-11-20 20:47:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:52,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245179510] [2022-11-20 20:47:52,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:52,992 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-20 20:47:52,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:52,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:53,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:47:53,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 20:47:53,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:47:59,182 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-20 20:47:59,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:47:59,183 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:47:59,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245179510] [2022-11-20 20:47:59,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245179510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:47:59,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:47:59,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:47:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20212946] [2022-11-20 20:47:59,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:47:59,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:47:59,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:47:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:47:59,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:47:59,184 INFO L87 Difference]: Start difference. First operand 118 states and 251 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:47:59,372 INFO L93 Difference]: Finished difference Result 117 states and 250 transitions. [2022-11-20 20:47:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:47:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:47:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:47:59,374 INFO L225 Difference]: With dead ends: 117 [2022-11-20 20:47:59,374 INFO L226 Difference]: Without dead ends: 117 [2022-11-20 20:47:59,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:47:59,375 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:47:59,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:47:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-20 20:47:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-20 20:47:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 116 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-20 20:47:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 250 transitions. [2022-11-20 20:47:59,379 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 250 transitions. Word has length 19 [2022-11-20 20:47:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:47:59,379 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 250 transitions. [2022-11-20 20:47:59,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:47:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 250 transitions. [2022-11-20 20:47:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:47:59,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:47:59,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:47:59,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:59,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:59,593 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-20 20:47:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:47:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1376474528, now seen corresponding path program 1 times [2022-11-20 20:47:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:47:59,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304216077] [2022-11-20 20:47:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:47:59,595 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-20 20:47:59,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:47:59,596 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:47:59,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-20 20:47:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:47:59,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 20:48:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:48:00,143 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-20 20:48:00,143 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 20:48:00,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-11-20 20:48:00,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-11-20 20:48:00,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-11-20 20:48:00,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-11-20 20:48:00,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-11-20 20:48:00,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-11-20 20:48:00,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-11-20 20:48:00,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-11-20 20:48:00,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-11-20 20:48:00,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-11-20 20:48:00,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-11-20 20:48:00,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-11-20 20:48:00,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-11-20 20:48:00,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-11-20 20:48:00,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-11-20 20:48:00,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-11-20 20:48:00,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-11-20 20:48:00,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-11-20 20:48:00,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-11-20 20:48:00,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-11-20 20:48:00,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-11-20 20:48:00,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-11-20 20:48:00,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-11-20 20:48:00,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-11-20 20:48:00,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-11-20 20:48:00,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-11-20 20:48:00,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-11-20 20:48:00,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-11-20 20:48:00,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-11-20 20:48:00,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-11-20 20:48:00,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-11-20 20:48:00,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-11-20 20:48:00,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-11-20 20:48:00,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-11-20 20:48:00,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-11-20 20:48:00,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2022-11-20 20:48:00,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2022-11-20 20:48:00,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2022-11-20 20:48:00,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2022-11-20 20:48:00,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-11-20 20:48:00,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-11-20 20:48:00,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-11-20 20:48:00,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-11-20 20:48:00,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-11-20 20:48:00,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-11-20 20:48:00,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-11-20 20:48:00,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-11-20 20:48:00,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-11-20 20:48:00,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-11-20 20:48:00,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-11-20 20:48:00,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-11-20 20:48:00,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-11-20 20:48:00,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-11-20 20:48:00,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-11-20 20:48:00,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-11-20 20:48:00,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-11-20 20:48:00,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-11-20 20:48:00,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2022-11-20 20:48:00,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2022-11-20 20:48:00,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2022-11-20 20:48:00,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2022-11-20 20:48:00,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:48:00,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/mathsat -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-20 20:48:00,382 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:48:00,388 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 20:48:00,388 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:48:00,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:48:00 BasicIcfg [2022-11-20 20:48:00,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:48:00,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:48:00,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:48:00,519 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:48:00,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:46:34" (3/4) ... [2022-11-20 20:48:00,530 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 20:48:00,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:48:00,531 INFO L158 Benchmark]: Toolchain (without parser) took 88062.23ms. Allocated memory was 81.8MB in the beginning and 1.0GB in the end (delta: 958.4MB). Free memory was 58.6MB in the beginning and 695.1MB in the end (delta: -636.5MB). Peak memory consumption was 324.8MB. Max. memory is 16.1GB. [2022-11-20 20:48:00,531 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 62.9MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:48:00,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.37ms. Allocated memory is still 81.8MB. Free memory was 58.6MB in the beginning and 58.0MB in the end (delta: 611.4kB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2022-11-20 20:48:00,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.78ms. Allocated memory is still 81.8MB. Free memory was 58.0MB in the beginning and 55.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:48:00,533 INFO L158 Benchmark]: Boogie Preprocessor took 66.57ms. Allocated memory is still 81.8MB. Free memory was 55.6MB in the beginning and 53.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:48:00,533 INFO L158 Benchmark]: RCFGBuilder took 1631.33ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 53.1MB in the beginning and 44.3MB in the end (delta: 8.9MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2022-11-20 20:48:00,533 INFO L158 Benchmark]: TraceAbstraction took 85539.49ms. Allocated memory was 98.6MB in the beginning and 1.0GB in the end (delta: 941.6MB). Free memory was 43.6MB in the beginning and 695.1MB in the end (delta: -651.5MB). Peak memory consumption was 289.8MB. Max. memory is 16.1GB. [2022-11-20 20:48:00,534 INFO L158 Benchmark]: Witness Printer took 11.77ms. Allocated memory is still 1.0GB. Free memory is still 695.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:48:00,536 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.22ms. Allocated memory is still 62.9MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.37ms. Allocated memory is still 81.8MB. Free memory was 58.6MB in the beginning and 58.0MB in the end (delta: 611.4kB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.78ms. Allocated memory is still 81.8MB. Free memory was 58.0MB in the beginning and 55.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.57ms. Allocated memory is still 81.8MB. Free memory was 55.6MB in the beginning and 53.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1631.33ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 53.1MB in the beginning and 44.3MB in the end (delta: 8.9MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * TraceAbstraction took 85539.49ms. Allocated memory was 98.6MB in the beginning and 1.0GB in the end (delta: 941.6MB). Free memory was 43.6MB in the beginning and 695.1MB in the end (delta: -651.5MB). Peak memory consumption was 289.8MB. Max. memory is 16.1GB. * Witness Printer took 11.77ms. Allocated memory is still 1.0GB. Free memory is still 695.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.4s, 177 PlacesBefore, 72 PlacesAfterwards, 169 TransitionsBefore, 63 TransitionsAfterwards, 5164 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 167 TotalNumberOfCompositions, 15131 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6347, independent: 6055, independent conditional: 0, independent unconditional: 6055, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 107, unknown conditional: 0, unknown unconditional: 107] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3147, independent: 3082, independent conditional: 0, independent unconditional: 3082, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3147, independent: 2859, independent conditional: 0, independent unconditional: 2859, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 288, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2594, independent: 1311, independent conditional: 0, independent unconditional: 1311, dependent: 427, dependent conditional: 0, dependent unconditional: 427, unknown: 856, unknown conditional: 0, unknown unconditional: 856] ], Cache Queries: [ total: 6347, independent: 2973, independent conditional: 0, independent unconditional: 2973, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 3236, unknown conditional: 0, unknown unconditional: 3236] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 9, Unknown conditional cache size: 0, Unknown unconditional cache size: 9 - 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L832] 0 pthread_t t2201; [L833] FCALL, FORK 0 pthread_create(&t2201, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2201, ((void *)0), P0, ((void *)0))=-1, t2201={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 pthread_t t2202; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2201={15:0}, t2202={23:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L835] FCALL, FORK 0 pthread_create(&t2202, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2202, ((void *)0), P1, ((void *)0))=0, t2201={15:0}, t2202={23:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 pthread_t t2203; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2201={15:0}, t2202={23:0}, t2203={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L837] FCALL, FORK 0 pthread_create(&t2203, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2203, ((void *)0), P2, ((void *)0))=1, t2201={15:0}, t2202={23:0}, t2203={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 \read(y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L839] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L841] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L841] RET 0 assume_abort_if_not(main$tmp_guard0) [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 \read(y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2201={15:0}, t2202={23:0}, t2203={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L852] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=128, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 830]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 835]: 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: 837]: 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: 833]: 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, 214 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 85.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 48.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 549 IncrementalHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 23 mSDtfsCounter, 549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10286occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 369 SizeOfPredicates, 39 NumberOfNonLiveVariables, 967 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-20 20:48:00,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39c023e0-9028-498b-bbab-cd8a72685b2f/bin/utaipan-6cKwYrpEi9/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