./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:32:34,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:32:34,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:32:34,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:32:34,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:32:34,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:32:34,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:32:34,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:32:34,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:32:34,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:32:34,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:32:34,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:32:34,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:32:34,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:32:34,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:32:34,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:32:34,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:32:34,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:32:34,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:32:34,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:32:34,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:32:34,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:32:34,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:32:34,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:32:34,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:32:34,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:32:34,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:32:34,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:32:34,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:32:34,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:32:34,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:32:34,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:32:34,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:32:34,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:32:34,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:32:34,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:32:34,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:32:34,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:32:34,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:32:34,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:32:34,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:32:34,482 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:32:34,504 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:32:34,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:32:34,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:32:34,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:32:34,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:32:34,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:32:34,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:32:34,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:32:34,506 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:32:34,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:32:34,506 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:32:34,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:32:34,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:32:34,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:32:34,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:32:34,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:32:34,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:32:34,507 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:32:34,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:32:34,507 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:32:34,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:32:34,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:32:34,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:32:34,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:32:34,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:32:34,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:32:34,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:32:34,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:32:34,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:32:34,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:32:34,508 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:32:34,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:32:34,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:32:34,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:32:34,509 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_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/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_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2021-12-07 00:32:34,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:32:34,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:32:34,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:32:34,727 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:32:34,727 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:32:34,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-07 00:32:34,770 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/data/3788e2848/01f02cc2dfcc41d595cf479f27d83605/FLAG3826845ec [2021-12-07 00:32:35,170 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:32:35,170 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-07 00:32:35,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/data/3788e2848/01f02cc2dfcc41d595cf479f27d83605/FLAG3826845ec [2021-12-07 00:32:35,196 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/data/3788e2848/01f02cc2dfcc41d595cf479f27d83605 [2021-12-07 00:32:35,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:32:35,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:32:35,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:32:35,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:32:35,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:32:35,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1827fbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35, skipping insertion in model container [2021-12-07 00:32:35,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:32:35,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:32:35,371 WARN L230 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_c4868367-71c3-4a97-8057-aaee903baa7e/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2021-12-07 00:32:35,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:32:35,477 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:32:35,486 WARN L230 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_c4868367-71c3-4a97-8057-aaee903baa7e/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2021-12-07 00:32:35,518 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:32:35,544 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:32:35,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35 WrapperNode [2021-12-07 00:32:35,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:32:35,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:32:35,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:32:35,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:32:35,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,583 INFO L137 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2021-12-07 00:32:35,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:32:35,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:32:35,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:32:35,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:32:35,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:32:35,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:32:35,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:32:35,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:32:35,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (1/1) ... [2021-12-07 00:32:35,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:32:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:32:35,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:32:35,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:32:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 00:32:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-07 00:32:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:32:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 00:32:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 00:32:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-07 00:32:35,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-07 00:32:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-07 00:32:35,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-07 00:32:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:32:35,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-07 00:32:35,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:32:35,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:32:35,673 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-07 00:32:35,759 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:32:35,761 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:32:36,060 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:32:36,221 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:32:36,221 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-07 00:32:36,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:36 BoogieIcfgContainer [2021-12-07 00:32:36,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:32:36,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:32:36,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:32:36,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:32:36,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:32:35" (1/3) ... [2021-12-07 00:32:36,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f7be1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:36, skipping insertion in model container [2021-12-07 00:32:36,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:35" (2/3) ... [2021-12-07 00:32:36,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f7be1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:36, skipping insertion in model container [2021-12-07 00:32:36,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:36" (3/3) ... [2021-12-07 00:32:36,228 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-07 00:32:36,232 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-07 00:32:36,232 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:32:36,232 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-07 00:32:36,232 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-07 00:32:36,256 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,256 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,256 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,256 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,257 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,257 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,257 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,257 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,257 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,257 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,258 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,259 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,259 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,259 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,259 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,259 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,259 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,259 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,260 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,260 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,260 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,260 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,260 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,260 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,260 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,260 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,261 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,261 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,261 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,261 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,261 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,261 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,261 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,262 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,262 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,262 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,262 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,262 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,262 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,262 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,264 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,264 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,264 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,264 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,264 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,264 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,264 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,265 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,265 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,265 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,265 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,265 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,265 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,265 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,266 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,266 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,266 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,266 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,266 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,266 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,266 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,266 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,267 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,268 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,269 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,271 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,271 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,271 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,271 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,272 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,272 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,272 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,272 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,272 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,272 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,280 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,280 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,280 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,281 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,281 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,281 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,281 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,281 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,281 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,281 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,282 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,282 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,282 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,282 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,282 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,292 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,292 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,292 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,292 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,292 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,292 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,293 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,293 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,293 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,293 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,293 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,293 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-07 00:32:36,294 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-07 00:32:36,330 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:32:36,337 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 00:32:36,337 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-07 00:32:36,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2021-12-07 00:32:36,382 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-12-07 00:32:36,382 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-07 00:32:36,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2021-12-07 00:32:36,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2021-12-07 00:32:36,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2021-12-07 00:32:36,402 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-12-07 00:32:36,402 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-07 00:32:36,402 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:36,403 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:36,403 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash -608487488, now seen corresponding path program 1 times [2021-12-07 00:32:36,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:36,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479374561] [2021-12-07 00:32:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:36,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:36,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479374561] [2021-12-07 00:32:36,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479374561] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:36,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:36,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:32:36,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459089659] [2021-12-07 00:32:36,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:36,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:32:36,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:36,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:32:36,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:32:36,639 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 97 [2021-12-07 00:32:36,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:36,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:36,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 97 [2021-12-07 00:32:36,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:36,702 INFO L129 PetriNetUnfolder]: 10/133 cut-off events. [2021-12-07 00:32:36,702 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-07 00:32:36,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 133 events. 10/133 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 228 event pairs, 2 based on Foata normal form. 6/132 useless extension candidates. Maximal degree in co-relation 119. Up to 17 conditions per place. [2021-12-07 00:32:36,704 INFO L132 encePairwiseOnDemand]: 92/97 looper letters, 7 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2021-12-07 00:32:36,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 210 flow [2021-12-07 00:32:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:32:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-07 00:32:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2021-12-07 00:32:36,716 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9347079037800687 [2021-12-07 00:32:36,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2021-12-07 00:32:36,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2021-12-07 00:32:36,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:36,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2021-12-07 00:32:36,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:36,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:36,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:36,732 INFO L186 Difference]: Start difference. First operand has 100 places, 95 transitions, 196 flow. Second operand 3 states and 272 transitions. [2021-12-07 00:32:36,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 93 transitions, 210 flow [2021-12-07 00:32:36,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-07 00:32:36,739 INFO L242 Difference]: Finished difference. Result has 98 places, 91 transitions, 190 flow [2021-12-07 00:32:36,741 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2021-12-07 00:32:36,745 INFO L334 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2021-12-07 00:32:36,745 INFO L470 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 190 flow [2021-12-07 00:32:36,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:36,746 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:36,746 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:36,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:32:36,746 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1133223224, now seen corresponding path program 1 times [2021-12-07 00:32:36,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:36,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240146126] [2021-12-07 00:32:36,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:36,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:36,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:36,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240146126] [2021-12-07 00:32:36,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240146126] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:36,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:36,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:32:36,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439313513] [2021-12-07 00:32:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:36,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:32:36,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:32:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:32:36,983 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2021-12-07 00:32:36,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:36,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:36,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2021-12-07 00:32:36,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:37,393 INFO L129 PetriNetUnfolder]: 273/974 cut-off events. [2021-12-07 00:32:37,393 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-12-07 00:32:37,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 974 events. 273/974 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6258 event pairs, 28 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1463. Up to 108 conditions per place. [2021-12-07 00:32:37,398 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 25 selfloop transitions, 5 changer transitions 62/153 dead transitions. [2021-12-07 00:32:37,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 153 transitions, 486 flow [2021-12-07 00:32:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:32:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-07 00:32:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1022 transitions. [2021-12-07 00:32:37,404 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8104678826328311 [2021-12-07 00:32:37,404 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1022 transitions. [2021-12-07 00:32:37,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1022 transitions. [2021-12-07 00:32:37,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:37,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1022 transitions. [2021-12-07 00:32:37,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 78.61538461538461) internal successors, (1022), 13 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,414 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,414 INFO L186 Difference]: Start difference. First operand has 98 places, 91 transitions, 190 flow. Second operand 13 states and 1022 transitions. [2021-12-07 00:32:37,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 153 transitions, 486 flow [2021-12-07 00:32:37,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 153 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-07 00:32:37,418 INFO L242 Difference]: Finished difference. Result has 120 places, 84 transitions, 238 flow [2021-12-07 00:32:37,418 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=238, PETRI_PLACES=120, PETRI_TRANSITIONS=84} [2021-12-07 00:32:37,419 INFO L334 CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places. [2021-12-07 00:32:37,419 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 84 transitions, 238 flow [2021-12-07 00:32:37,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,419 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:37,419 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:37,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:32:37,420 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1165718378, now seen corresponding path program 1 times [2021-12-07 00:32:37,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:37,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165167501] [2021-12-07 00:32:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:37,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:37,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:37,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165167501] [2021-12-07 00:32:37,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165167501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:37,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:37,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:32:37,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786118078] [2021-12-07 00:32:37,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:37,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:32:37,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:37,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:32:37,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:32:37,522 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 97 [2021-12-07 00:32:37,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 84 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:37,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 97 [2021-12-07 00:32:37,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:37,705 INFO L129 PetriNetUnfolder]: 73/300 cut-off events. [2021-12-07 00:32:37,705 INFO L130 PetriNetUnfolder]: For 482/506 co-relation queries the response was YES. [2021-12-07 00:32:37,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 300 events. 73/300 cut-off events. For 482/506 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1203 event pairs, 20 based on Foata normal form. 8/289 useless extension candidates. Maximal degree in co-relation 719. Up to 75 conditions per place. [2021-12-07 00:32:37,707 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 14 selfloop transitions, 3 changer transitions 21/106 dead transitions. [2021-12-07 00:32:37,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 446 flow [2021-12-07 00:32:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:32:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-07 00:32:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 739 transitions. [2021-12-07 00:32:37,710 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8465063001145475 [2021-12-07 00:32:37,710 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 739 transitions. [2021-12-07 00:32:37,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 739 transitions. [2021-12-07 00:32:37,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:37,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 739 transitions. [2021-12-07 00:32:37,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,715 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,715 INFO L186 Difference]: Start difference. First operand has 120 places, 84 transitions, 238 flow. Second operand 9 states and 739 transitions. [2021-12-07 00:32:37,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 446 flow [2021-12-07 00:32:37,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 408 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-12-07 00:32:37,721 INFO L242 Difference]: Finished difference. Result has 111 places, 84 transitions, 239 flow [2021-12-07 00:32:37,721 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=111, PETRI_TRANSITIONS=84} [2021-12-07 00:32:37,722 INFO L334 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2021-12-07 00:32:37,722 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 239 flow [2021-12-07 00:32:37,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,722 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:37,723 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:37,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 00:32:37,723 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:37,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1609767230, now seen corresponding path program 1 times [2021-12-07 00:32:37,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:37,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458776098] [2021-12-07 00:32:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:37,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:37,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:37,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458776098] [2021-12-07 00:32:37,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458776098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:37,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:37,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:32:37,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885210574] [2021-12-07 00:32:37,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:37,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:32:37,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:37,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:32:37,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:32:37,804 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2021-12-07 00:32:37,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:37,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:37,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2021-12-07 00:32:37,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:38,059 INFO L129 PetriNetUnfolder]: 238/669 cut-off events. [2021-12-07 00:32:38,059 INFO L130 PetriNetUnfolder]: For 703/760 co-relation queries the response was YES. [2021-12-07 00:32:38,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 669 events. 238/669 cut-off events. For 703/760 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3798 event pairs, 14 based on Foata normal form. 20/662 useless extension candidates. Maximal degree in co-relation 1491. Up to 131 conditions per place. [2021-12-07 00:32:38,064 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 22 selfloop transitions, 5 changer transitions 42/136 dead transitions. [2021-12-07 00:32:38,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 136 transitions, 567 flow [2021-12-07 00:32:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:32:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:32:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 833 transitions. [2021-12-07 00:32:38,068 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8587628865979381 [2021-12-07 00:32:38,068 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 833 transitions. [2021-12-07 00:32:38,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 833 transitions. [2021-12-07 00:32:38,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:38,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 833 transitions. [2021-12-07 00:32:38,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.3) internal successors, (833), 10 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,075 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,075 INFO L186 Difference]: Start difference. First operand has 111 places, 84 transitions, 239 flow. Second operand 10 states and 833 transitions. [2021-12-07 00:32:38,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 136 transitions, 567 flow [2021-12-07 00:32:38,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 136 transitions, 545 flow, removed 8 selfloop flow, removed 10 redundant places. [2021-12-07 00:32:38,082 INFO L242 Difference]: Finished difference. Result has 110 places, 86 transitions, 263 flow [2021-12-07 00:32:38,082 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=263, PETRI_PLACES=110, PETRI_TRANSITIONS=86} [2021-12-07 00:32:38,083 INFO L334 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2021-12-07 00:32:38,083 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 86 transitions, 263 flow [2021-12-07 00:32:38,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,083 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:38,084 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:38,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 00:32:38,084 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash -489563907, now seen corresponding path program 1 times [2021-12-07 00:32:38,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:38,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834507953] [2021-12-07 00:32:38,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:38,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:38,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:38,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834507953] [2021-12-07 00:32:38,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834507953] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:38,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:38,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:32:38,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230415972] [2021-12-07 00:32:38,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:38,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:32:38,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:32:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:32:38,209 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 97 [2021-12-07 00:32:38,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 86 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:38,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 97 [2021-12-07 00:32:38,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:38,363 INFO L129 PetriNetUnfolder]: 80/495 cut-off events. [2021-12-07 00:32:38,363 INFO L130 PetriNetUnfolder]: For 364/365 co-relation queries the response was YES. [2021-12-07 00:32:38,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 495 events. 80/495 cut-off events. For 364/365 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3045 event pairs, 30 based on Foata normal form. 4/473 useless extension candidates. Maximal degree in co-relation 1114. Up to 96 conditions per place. [2021-12-07 00:32:38,366 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 21 selfloop transitions, 3 changer transitions 11/101 dead transitions. [2021-12-07 00:32:38,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 398 flow [2021-12-07 00:32:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:32:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-07 00:32:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2021-12-07 00:32:38,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8264604810996563 [2021-12-07 00:32:38,368 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 481 transitions. [2021-12-07 00:32:38,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 481 transitions. [2021-12-07 00:32:38,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:38,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 481 transitions. [2021-12-07 00:32:38,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,371 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,371 INFO L186 Difference]: Start difference. First operand has 110 places, 86 transitions, 263 flow. Second operand 6 states and 481 transitions. [2021-12-07 00:32:38,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 101 transitions, 398 flow [2021-12-07 00:32:38,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 101 transitions, 390 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-12-07 00:32:38,375 INFO L242 Difference]: Finished difference. Result has 109 places, 86 transitions, 272 flow [2021-12-07 00:32:38,376 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=109, PETRI_TRANSITIONS=86} [2021-12-07 00:32:38,376 INFO L334 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2021-12-07 00:32:38,377 INFO L470 AbstractCegarLoop]: Abstraction has has 109 places, 86 transitions, 272 flow [2021-12-07 00:32:38,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,377 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:38,377 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:38,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 00:32:38,378 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1461942785, now seen corresponding path program 2 times [2021-12-07 00:32:38,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:38,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643580167] [2021-12-07 00:32:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:38,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:38,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:38,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643580167] [2021-12-07 00:32:38,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643580167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:38,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:38,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:32:38,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708983159] [2021-12-07 00:32:38,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:38,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:32:38,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:32:38,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:32:38,485 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2021-12-07 00:32:38,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 86 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:38,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2021-12-07 00:32:38,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:38,640 INFO L129 PetriNetUnfolder]: 62/298 cut-off events. [2021-12-07 00:32:38,641 INFO L130 PetriNetUnfolder]: For 339/345 co-relation queries the response was YES. [2021-12-07 00:32:38,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 298 events. 62/298 cut-off events. For 339/345 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1358 event pairs, 10 based on Foata normal form. 17/313 useless extension candidates. Maximal degree in co-relation 776. Up to 56 conditions per place. [2021-12-07 00:32:38,643 INFO L132 encePairwiseOnDemand]: 89/97 looper letters, 15 selfloop transitions, 7 changer transitions 17/106 dead transitions. [2021-12-07 00:32:38,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 464 flow [2021-12-07 00:32:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:32:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:32:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 807 transitions. [2021-12-07 00:32:38,647 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.831958762886598 [2021-12-07 00:32:38,647 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 807 transitions. [2021-12-07 00:32:38,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 807 transitions. [2021-12-07 00:32:38,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:38,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 807 transitions. [2021-12-07 00:32:38,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.7) internal successors, (807), 10 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,653 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,653 INFO L186 Difference]: Start difference. First operand has 109 places, 86 transitions, 272 flow. Second operand 10 states and 807 transitions. [2021-12-07 00:32:38,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 106 transitions, 464 flow [2021-12-07 00:32:38,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 106 transitions, 399 flow, removed 27 selfloop flow, removed 10 redundant places. [2021-12-07 00:32:38,659 INFO L242 Difference]: Finished difference. Result has 111 places, 86 transitions, 266 flow [2021-12-07 00:32:38,659 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=266, PETRI_PLACES=111, PETRI_TRANSITIONS=86} [2021-12-07 00:32:38,660 INFO L334 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2021-12-07 00:32:38,660 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 86 transitions, 266 flow [2021-12-07 00:32:38,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,660 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:38,661 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:38,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 00:32:38,661 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 311180574, now seen corresponding path program 1 times [2021-12-07 00:32:38,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:38,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644740946] [2021-12-07 00:32:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:38,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:38,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644740946] [2021-12-07 00:32:38,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644740946] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:38,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:38,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:32:38,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788843464] [2021-12-07 00:32:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:38,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:32:38,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:32:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:32:38,779 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2021-12-07 00:32:38,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 86 transitions, 266 flow. Second operand has 8 states, 8 states have (on average 74.5) internal successors, (596), 8 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:38,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2021-12-07 00:32:38,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:38,916 INFO L129 PetriNetUnfolder]: 14/234 cut-off events. [2021-12-07 00:32:38,916 INFO L130 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2021-12-07 00:32:38,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 234 events. 14/234 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1039 event pairs, 1 based on Foata normal form. 1/223 useless extension candidates. Maximal degree in co-relation 468. Up to 45 conditions per place. [2021-12-07 00:32:38,918 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 20 selfloop transitions, 4 changer transitions 12/99 dead transitions. [2021-12-07 00:32:38,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 99 transitions, 378 flow [2021-12-07 00:32:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 00:32:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-07 00:32:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2021-12-07 00:32:38,921 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7823596792668958 [2021-12-07 00:32:38,921 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2021-12-07 00:32:38,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2021-12-07 00:32:38,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:38,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2021-12-07 00:32:38,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,927 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,927 INFO L186 Difference]: Start difference. First operand has 111 places, 86 transitions, 266 flow. Second operand 9 states and 683 transitions. [2021-12-07 00:32:38,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 99 transitions, 378 flow [2021-12-07 00:32:38,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 337 flow, removed 12 selfloop flow, removed 12 redundant places. [2021-12-07 00:32:38,932 INFO L242 Difference]: Finished difference. Result has 108 places, 85 transitions, 241 flow [2021-12-07 00:32:38,932 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=241, PETRI_PLACES=108, PETRI_TRANSITIONS=85} [2021-12-07 00:32:38,933 INFO L334 CegarLoopForPetriNet]: 100 programPoint places, 8 predicate places. [2021-12-07 00:32:38,933 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 241 flow [2021-12-07 00:32:38,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.5) internal successors, (596), 8 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:38,933 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:38,934 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:38,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 00:32:38,934 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:38,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash 387184494, now seen corresponding path program 2 times [2021-12-07 00:32:38,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:38,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720603818] [2021-12-07 00:32:38,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:38,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:32:39,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:39,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720603818] [2021-12-07 00:32:39,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720603818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:39,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:39,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 00:32:39,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068672148] [2021-12-07 00:32:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:39,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 00:32:39,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 00:32:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-07 00:32:39,096 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 97 [2021-12-07 00:32:39,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 241 flow. Second operand has 9 states, 9 states have (on average 75.11111111111111) internal successors, (676), 9 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:39,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-07 00:32:39,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 97 [2021-12-07 00:32:39,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-07 00:32:39,212 INFO L129 PetriNetUnfolder]: 8/173 cut-off events. [2021-12-07 00:32:39,212 INFO L130 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2021-12-07 00:32:39,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 173 events. 8/173 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 557 event pairs, 0 based on Foata normal form. 1/167 useless extension candidates. Maximal degree in co-relation 294. Up to 18 conditions per place. [2021-12-07 00:32:39,213 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 16 selfloop transitions, 4 changer transitions 7/92 dead transitions. [2021-12-07 00:32:39,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 92 transitions, 326 flow [2021-12-07 00:32:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:32:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-07 00:32:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 756 transitions. [2021-12-07 00:32:39,215 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7793814432989691 [2021-12-07 00:32:39,215 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 756 transitions. [2021-12-07 00:32:39,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 756 transitions. [2021-12-07 00:32:39,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:32:39,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 756 transitions. [2021-12-07 00:32:39,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.6) internal successors, (756), 10 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:39,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:39,220 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:39,220 INFO L186 Difference]: Start difference. First operand has 108 places, 85 transitions, 241 flow. Second operand 10 states and 756 transitions. [2021-12-07 00:32:39,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 92 transitions, 326 flow [2021-12-07 00:32:39,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 92 transitions, 298 flow, removed 8 selfloop flow, removed 8 redundant places. [2021-12-07 00:32:39,222 INFO L242 Difference]: Finished difference. Result has 110 places, 85 transitions, 243 flow [2021-12-07 00:32:39,223 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=243, PETRI_PLACES=110, PETRI_TRANSITIONS=85} [2021-12-07 00:32:39,223 INFO L334 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2021-12-07 00:32:39,223 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 243 flow [2021-12-07 00:32:39,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 75.11111111111111) internal successors, (676), 9 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:32:39,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-07 00:32:39,224 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:39,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 00:32:39,224 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-07 00:32:39,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash -556548774, now seen corresponding path program 3 times [2021-12-07 00:32:39,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:39,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723779350] [2021-12-07 00:32:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:39,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:32:39,255 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:32:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:32:39,316 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:32:39,316 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 00:32:39,317 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-12-07 00:32:39,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-12-07 00:32:39,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2021-12-07 00:32:39,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2021-12-07 00:32:39,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-12-07 00:32:39,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 00:32:39,322 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2021-12-07 00:32:39,326 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-07 00:32:39,326 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:32:39,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:32:39 BasicIcfg [2021-12-07 00:32:39,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:32:39,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:32:39,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:32:39,430 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:32:39,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:36" (3/4) ... [2021-12-07 00:32:39,431 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 00:32:39,530 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 00:32:39,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:32:39,531 INFO L158 Benchmark]: Toolchain (without parser) took 4331.45ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 71.4MB in the beginning and 94.1MB in the end (delta: -22.7MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2021-12-07 00:32:39,531 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:32:39,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.85ms. Allocated memory is still 109.1MB. Free memory was 71.2MB in the beginning and 71.8MB in the end (delta: -645.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 00:32:39,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.34ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 69.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-07 00:32:39,532 INFO L158 Benchmark]: Boogie Preprocessor took 26.23ms. Allocated memory is still 109.1MB. Free memory was 69.3MB in the beginning and 67.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:39,533 INFO L158 Benchmark]: RCFGBuilder took 611.56ms. Allocated memory is still 109.1MB. Free memory was 67.2MB in the beginning and 51.5MB in the end (delta: 15.6MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2021-12-07 00:32:39,533 INFO L158 Benchmark]: TraceAbstraction took 3205.28ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 50.9MB in the beginning and 39.6MB in the end (delta: 11.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2021-12-07 00:32:39,533 INFO L158 Benchmark]: Witness Printer took 101.02ms. Allocated memory is still 138.4MB. Free memory was 39.6MB in the beginning and 94.1MB in the end (delta: -54.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 00:32:39,535 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.85ms. Allocated memory is still 109.1MB. Free memory was 71.2MB in the beginning and 71.8MB in the end (delta: -645.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.34ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 69.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.23ms. Allocated memory is still 109.1MB. Free memory was 69.3MB in the beginning and 67.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.56ms. Allocated memory is still 109.1MB. Free memory was 67.2MB in the beginning and 51.5MB in the end (delta: 15.6MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3205.28ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 50.9MB in the beginning and 39.6MB in the end (delta: 11.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Witness Printer took 101.02ms. Allocated memory is still 138.4MB. Free memory was 39.6MB in the beginning and 94.1MB in the end (delta: -54.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L721] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 0 pthread_t t1633; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1633, ((void *)0), P0, ((void *)0))=-1, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 0 pthread_t t1634; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1634, ((void *)0), P1, ((void *)0))=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L751] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L753] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L754] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L755] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L756] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 116 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 67 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=5, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 2083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 proved your program to be incorrect! [2021-12-07 00:32:39,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4868367-71c3-4a97-8057-aaee903baa7e/bin/uautomizer-DrprNOufMa/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE