./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_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 aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0 --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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 14:31:31,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 14:31:31,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 14:31:31,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 14:31:31,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 14:31:31,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 14:31:31,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 14:31:31,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 14:31:31,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 14:31:31,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 14:31:31,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 14:31:31,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 14:31:31,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 14:31:31,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 14:31:31,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 14:31:31,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 14:31:31,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 14:31:31,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 14:31:31,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 14:31:31,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 14:31:31,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 14:31:31,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 14:31:31,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 14:31:31,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 14:31:31,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 14:31:31,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 14:31:31,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 14:31:31,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 14:31:31,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 14:31:31,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 14:31:31,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 14:31:31,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 14:31:31,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 14:31:31,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 14:31:31,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 14:31:31,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 14:31:31,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 14:31:31,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 14:31:31,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 14:31:31,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 14:31:31,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 14:31:31,673 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-22 14:31:31,698 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 14:31:31,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 14:31:31,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 14:31:31,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 14:31:31,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 14:31:31,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 14:31:31,700 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 14:31:31,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 14:31:31,701 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 14:31:31,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 14:31:31,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 14:31:31,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 14:31:31,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 14:31:31,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 14:31:31,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 14:31:31,702 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 14:31:31,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 14:31:31,702 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 14:31:31,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 14:31:31,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 14:31:31,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 14:31:31,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 14:31:31,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:31:31,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 14:31:31,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 14:31:31,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 14:31:31,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 14:31:31,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 14:31:31,705 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 14:31:31,705 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 14:31:31,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 14:31:31,714 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 14:31:31,715 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_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/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_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2021-11-22 14:31:32,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 14:31:32,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 14:31:32,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 14:31:32,075 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 14:31:32,076 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 14:31:32,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-11-22 14:31:32,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/data/c35f90644/34bdc1a3e87b42cc88c49a317a4ce60d/FLAGdb5e65916 [2021-11-22 14:31:32,731 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 14:31:32,735 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-11-22 14:31:32,759 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/data/c35f90644/34bdc1a3e87b42cc88c49a317a4ce60d/FLAGdb5e65916 [2021-11-22 14:31:32,981 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/data/c35f90644/34bdc1a3e87b42cc88c49a317a4ce60d [2021-11-22 14:31:32,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 14:31:32,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 14:31:32,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 14:31:32,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 14:31:32,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 14:31:32,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:31:32" (1/1) ... [2021-11-22 14:31:32,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729896db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:32, skipping insertion in model container [2021-11-22 14:31:32,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:31:32" (1/1) ... [2021-11-22 14:31:33,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 14:31:33,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 14:31:33,259 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_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-11-22 14:31:33,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:31:33,511 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 14:31:33,525 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_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-11-22 14:31:33,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:31:33,672 INFO L208 MainTranslator]: Completed translation [2021-11-22 14:31:33,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33 WrapperNode [2021-11-22 14:31:33,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 14:31:33,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 14:31:33,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 14:31:33,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 14:31:33,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,775 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2021-11-22 14:31:33,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 14:31:33,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 14:31:33,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 14:31:33,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 14:31:33,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 14:31:33,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 14:31:33,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 14:31:33,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 14:31:33,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (1/1) ... [2021-11-22 14:31:33,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:31:33,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:31:33,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 14:31:33,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 14:31:33,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 14:31:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-22 14:31:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 14:31:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 14:31:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 14:31:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-22 14:31:33,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-22 14:31:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-22 14:31:33,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-22 14:31:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-22 14:31:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-22 14:31:33,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 14:31:33,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-22 14:31:33,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 14:31:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 14:31:33,938 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-22 14:31:34,065 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 14:31:34,067 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 14:31:34,970 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 14:31:35,653 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 14:31:35,653 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 14:31:35,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:31:35 BoogieIcfgContainer [2021-11-22 14:31:35,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 14:31:35,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 14:31:35,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 14:31:35,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 14:31:35,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:31:32" (1/3) ... [2021-11-22 14:31:35,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f3dc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:31:35, skipping insertion in model container [2021-11-22 14:31:35,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:33" (2/3) ... [2021-11-22 14:31:35,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f3dc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:31:35, skipping insertion in model container [2021-11-22 14:31:35,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:31:35" (3/3) ... [2021-11-22 14:31:35,667 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-11-22 14:31:35,672 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-22 14:31:35,673 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 14:31:35,673 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-22 14:31:35,673 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-22 14:31:35,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,737 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,737 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,738 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,738 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,738 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,739 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,740 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,741 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,741 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,741 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,742 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,742 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,742 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,743 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,743 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,743 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,744 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,744 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,745 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,745 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,745 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,746 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,747 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,748 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,748 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,748 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,748 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,748 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,749 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,749 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,751 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,751 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,751 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,752 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,752 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,752 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,752 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,752 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,753 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,753 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,753 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,753 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,753 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,754 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,755 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,755 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,755 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,755 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,755 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,758 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,758 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,758 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,759 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,760 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,762 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,762 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,766 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,767 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,767 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,768 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,768 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,769 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,769 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,775 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,775 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,776 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,776 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,776 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,776 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,776 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,784 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,784 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,784 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,785 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,785 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,785 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,785 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,785 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,787 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,787 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,787 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,788 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,792 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,792 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,793 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,793 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,793 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,793 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,793 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,794 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,794 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,794 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,794 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,794 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,794 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,795 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,795 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,795 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,795 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,795 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,796 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,796 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,796 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,796 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,796 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,796 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,797 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,797 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,797 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,797 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,797 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,798 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,798 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,799 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,800 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,800 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,800 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,800 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,800 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,801 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,801 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,801 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,801 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,802 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,802 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,802 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,802 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,803 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,803 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,803 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,803 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,804 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,804 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,804 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,804 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,805 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,809 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,809 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,809 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,812 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,813 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,813 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,813 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,813 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,813 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,814 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,814 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,814 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,814 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,815 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,815 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,815 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,815 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,815 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,816 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,816 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,830 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,830 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,830 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,830 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,830 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,832 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,832 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,832 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,832 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,832 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,833 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,833 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,833 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,833 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,833 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,833 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,834 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,834 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,834 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,834 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,834 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,834 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,835 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,835 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,835 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,835 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,835 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,835 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,836 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,836 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,836 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,836 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,836 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,837 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,838 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,838 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,838 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,838 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,838 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,838 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,840 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,841 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,842 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,842 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,842 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,842 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,842 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,842 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-22 14:31:35,845 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-22 14:31:35,912 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 14:31:35,921 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-11-22 14:31:35,921 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-22 14:31:35,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-11-22 14:31:36,013 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-11-22 14:31:36,013 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-22 14:31:36,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-11-22 14:31:36,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-11-22 14:31:36,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2021-11-22 14:31:36,040 INFO L129 PetriNetUnfolder]: 0/74 cut-off events. [2021-11-22 14:31:36,040 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-22 14:31:36,041 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:36,041 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] [2021-11-22 14:31:36,042 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1547640948, now seen corresponding path program 1 times [2021-11-22 14:31:36,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:36,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838107010] [2021-11-22 14:31:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:36,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:36,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838107010] [2021-11-22 14:31:36,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838107010] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:36,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:36,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:31:36,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566274949] [2021-11-22 14:31:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:36,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:31:36,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:36,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:31:36,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:31:36,536 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2021-11-22 14:31:36,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-11-22 14:31:36,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:36,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2021-11-22 14:31:36,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:36,848 INFO L129 PetriNetUnfolder]: 126/549 cut-off events. [2021-11-22 14:31:36,848 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-11-22 14:31:36,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 549 events. 126/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2889 event pairs, 34 based on Foata normal form. 24/540 useless extension candidates. Maximal degree in co-relation 734. Up to 141 conditions per place. [2021-11-22 14:31:36,860 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 16 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2021-11-22 14:31:36,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 271 flow [2021-11-22 14:31:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:31:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-22 14:31:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2021-11-22 14:31:36,912 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9269005847953217 [2021-11-22 14:31:36,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2021-11-22 14:31:36,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2021-11-22 14:31:36,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:36,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2021-11-22 14:31:36,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:31:36,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-11-22 14:31:36,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-11-22 14:31:36,945 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 317 transitions. [2021-11-22 14:31:36,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 271 flow [2021-11-22 14:31:36,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-22 14:31:36,956 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2021-11-22 14:31:36,958 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2021-11-22 14:31:36,964 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2021-11-22 14:31:36,965 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2021-11-22 14:31:36,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-11-22 14:31:36,965 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:36,966 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] [2021-11-22 14:31:36,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 14:31:36,967 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 84128766, now seen corresponding path program 1 times [2021-11-22 14:31:36,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:36,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455585921] [2021-11-22 14:31:36,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:36,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:37,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:37,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455585921] [2021-11-22 14:31:37,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455585921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:37,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:37,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:31:37,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205213295] [2021-11-22 14:31:37,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:37,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:31:37,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:37,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:31:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:31:37,297 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-11-22 14:31:37,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 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-11-22 14:31:37,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:37,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-11-22 14:31:37,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:38,399 INFO L129 PetriNetUnfolder]: 1152/3033 cut-off events. [2021-11-22 14:31:38,399 INFO L130 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2021-11-22 14:31:38,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 3033 events. 1152/3033 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 23845 event pairs, 256 based on Foata normal form. 0/2947 useless extension candidates. Maximal degree in co-relation 4895. Up to 988 conditions per place. [2021-11-22 14:31:38,423 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 63/167 dead transitions. [2021-11-22 14:31:38,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 167 transitions, 522 flow [2021-11-22 14:31:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:31:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-22 14:31:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2021-11-22 14:31:38,430 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8693957115009746 [2021-11-22 14:31:38,430 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2021-11-22 14:31:38,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2021-11-22 14:31:38,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:38,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2021-11-22 14:31:38,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 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-11-22 14:31:38,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-11-22 14:31:38,440 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-11-22 14:31:38,440 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 892 transitions. [2021-11-22 14:31:38,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 167 transitions, 522 flow [2021-11-22 14:31:38,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 167 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-22 14:31:38,446 INFO L242 Difference]: Finished difference. Result has 129 places, 97 transitions, 239 flow [2021-11-22 14:31:38,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2021-11-22 14:31:38,448 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2021-11-22 14:31:38,448 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 239 flow [2021-11-22 14:31:38,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 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-11-22 14:31:38,449 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:38,449 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] [2021-11-22 14:31:38,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 14:31:38,449 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash -158704489, now seen corresponding path program 1 times [2021-11-22 14:31:38,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:38,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709654899] [2021-11-22 14:31:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:38,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:38,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:38,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709654899] [2021-11-22 14:31:38,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709654899] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:38,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:38,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:31:38,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008826590] [2021-11-22 14:31:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:38,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:31:38,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:38,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:31:38,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:31:38,742 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2021-11-22 14:31:38,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 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-11-22 14:31:38,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:38,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2021-11-22 14:31:38,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:39,355 INFO L129 PetriNetUnfolder]: 536/1254 cut-off events. [2021-11-22 14:31:39,355 INFO L130 PetriNetUnfolder]: For 856/856 co-relation queries the response was YES. [2021-11-22 14:31:39,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 1254 events. 536/1254 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7468 event pairs, 190 based on Foata normal form. 40/1255 useless extension candidates. Maximal degree in co-relation 2657. Up to 325 conditions per place. [2021-11-22 14:31:39,368 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 20 selfloop transitions, 2 changer transitions 34/136 dead transitions. [2021-11-22 14:31:39,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 136 transitions, 449 flow [2021-11-22 14:31:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:31:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-22 14:31:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 886 transitions. [2021-11-22 14:31:39,371 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8635477582846004 [2021-11-22 14:31:39,372 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 886 transitions. [2021-11-22 14:31:39,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 886 transitions. [2021-11-22 14:31:39,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:39,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 886 transitions. [2021-11-22 14:31:39,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 0 states have call successors, (0), 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-11-22 14:31:39,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-11-22 14:31:39,380 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-11-22 14:31:39,380 INFO L186 Difference]: Start difference. First operand has 129 places, 97 transitions, 239 flow. Second operand 9 states and 886 transitions. [2021-11-22 14:31:39,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 136 transitions, 449 flow [2021-11-22 14:31:39,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 136 transitions, 432 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-11-22 14:31:39,396 INFO L242 Difference]: Finished difference. Result has 122 places, 97 transitions, 250 flow [2021-11-22 14:31:39,396 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=122, PETRI_TRANSITIONS=97} [2021-11-22 14:31:39,399 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2021-11-22 14:31:39,400 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 97 transitions, 250 flow [2021-11-22 14:31:39,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 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-11-22 14:31:39,400 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:39,401 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, 1, 1, 1] [2021-11-22 14:31:39,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 14:31:39,401 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1496000257, now seen corresponding path program 1 times [2021-11-22 14:31:39,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:39,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983498389] [2021-11-22 14:31:39,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:39,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:40,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:40,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983498389] [2021-11-22 14:31:40,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983498389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:40,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:40,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 14:31:40,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111369425] [2021-11-22 14:31:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:40,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 14:31:40,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 14:31:40,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-22 14:31:40,074 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-11-22 14:31:40,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 97 transitions, 250 flow. Second operand has 13 states, 13 states have (on average 87.46153846153847) internal successors, (1137), 13 states have internal predecessors, (1137), 0 states have call successors, (0), 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-11-22 14:31:40,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:40,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-11-22 14:31:40,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:40,748 INFO L129 PetriNetUnfolder]: 350/841 cut-off events. [2021-11-22 14:31:40,748 INFO L130 PetriNetUnfolder]: For 895/895 co-relation queries the response was YES. [2021-11-22 14:31:40,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 841 events. 350/841 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4260 event pairs, 57 based on Foata normal form. 16/823 useless extension candidates. Maximal degree in co-relation 1963. Up to 316 conditions per place. [2021-11-22 14:31:40,759 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 25 selfloop transitions, 8 changer transitions 25/132 dead transitions. [2021-11-22 14:31:40,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 132 transitions, 469 flow [2021-11-22 14:31:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 14:31:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-22 14:31:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1264 transitions. [2021-11-22 14:31:40,764 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7919799498746867 [2021-11-22 14:31:40,764 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1264 transitions. [2021-11-22 14:31:40,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1264 transitions. [2021-11-22 14:31:40,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:40,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1264 transitions. [2021-11-22 14:31:40,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.28571428571429) internal successors, (1264), 14 states have internal predecessors, (1264), 0 states have call successors, (0), 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-11-22 14:31:40,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-11-22 14:31:40,774 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-11-22 14:31:40,774 INFO L186 Difference]: Start difference. First operand has 122 places, 97 transitions, 250 flow. Second operand 14 states and 1264 transitions. [2021-11-22 14:31:40,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 132 transitions, 469 flow [2021-11-22 14:31:40,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 132 transitions, 435 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-11-22 14:31:40,784 INFO L242 Difference]: Finished difference. Result has 129 places, 99 transitions, 275 flow [2021-11-22 14:31:40,784 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=275, PETRI_PLACES=129, PETRI_TRANSITIONS=99} [2021-11-22 14:31:40,785 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2021-11-22 14:31:40,785 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 99 transitions, 275 flow [2021-11-22 14:31:40,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.46153846153847) internal successors, (1137), 13 states have internal predecessors, (1137), 0 states have call successors, (0), 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-11-22 14:31:40,786 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:40,787 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, 1, 1, 1, 1] [2021-11-22 14:31:40,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 14:31:40,787 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1862087746, now seen corresponding path program 1 times [2021-11-22 14:31:40,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:40,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916290039] [2021-11-22 14:31:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:40,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:40,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:40,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916290039] [2021-11-22 14:31:40,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916290039] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:40,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:40,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:31:40,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742501665] [2021-11-22 14:31:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:40,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:31:40,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:31:40,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:31:40,941 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-11-22 14:31:40,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 99 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 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-11-22 14:31:40,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:40,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-11-22 14:31:40,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:41,509 INFO L129 PetriNetUnfolder]: 521/1252 cut-off events. [2021-11-22 14:31:41,510 INFO L130 PetriNetUnfolder]: For 1213/1221 co-relation queries the response was YES. [2021-11-22 14:31:41,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2984 conditions, 1252 events. 521/1252 cut-off events. For 1213/1221 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7530 event pairs, 199 based on Foata normal form. 20/1202 useless extension candidates. Maximal degree in co-relation 2915. Up to 411 conditions per place. [2021-11-22 14:31:41,523 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 29 selfloop transitions, 3 changer transitions 28/137 dead transitions. [2021-11-22 14:31:41,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 137 transitions, 544 flow [2021-11-22 14:31:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 14:31:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-22 14:31:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2021-11-22 14:31:41,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-11-22 14:31:41,528 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 870 transitions. [2021-11-22 14:31:41,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions. [2021-11-22 14:31:41,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:41,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions. [2021-11-22 14:31:41,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 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-11-22 14:31:41,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-11-22 14:31:41,535 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-11-22 14:31:41,535 INFO L186 Difference]: Start difference. First operand has 129 places, 99 transitions, 275 flow. Second operand 9 states and 870 transitions. [2021-11-22 14:31:41,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 137 transitions, 544 flow [2021-11-22 14:31:41,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 137 transitions, 485 flow, removed 24 selfloop flow, removed 11 redundant places. [2021-11-22 14:31:41,547 INFO L242 Difference]: Finished difference. Result has 127 places, 99 transitions, 273 flow [2021-11-22 14:31:41,548 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=273, PETRI_PLACES=127, PETRI_TRANSITIONS=99} [2021-11-22 14:31:41,549 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 8 predicate places. [2021-11-22 14:31:41,549 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 99 transitions, 273 flow [2021-11-22 14:31:41,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 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-11-22 14:31:41,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:41,550 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, 1, 1, 1, 1, 1] [2021-11-22 14:31:41,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 14:31:41,550 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash -115533095, now seen corresponding path program 1 times [2021-11-22 14:31:41,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:41,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442835603] [2021-11-22 14:31:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:41,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:41,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:41,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442835603] [2021-11-22 14:31:41,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442835603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:41,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:41,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 14:31:41,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203708803] [2021-11-22 14:31:41,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:41,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 14:31:41,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:41,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 14:31:41,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-22 14:31:41,891 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-11-22 14:31:41,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 99 transitions, 273 flow. Second operand has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 0 states have call successors, (0), 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-11-22 14:31:41,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:41,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-11-22 14:31:41,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:42,967 INFO L129 PetriNetUnfolder]: 559/1352 cut-off events. [2021-11-22 14:31:42,968 INFO L130 PetriNetUnfolder]: For 1915/1938 co-relation queries the response was YES. [2021-11-22 14:31:42,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 1352 events. 559/1352 cut-off events. For 1915/1938 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8202 event pairs, 89 based on Foata normal form. 37/1277 useless extension candidates. Maximal degree in co-relation 3225. Up to 481 conditions per place. [2021-11-22 14:31:42,981 INFO L132 encePairwiseOnDemand]: 99/114 looper letters, 31 selfloop transitions, 23 changer transitions 38/166 dead transitions. [2021-11-22 14:31:42,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 166 transitions, 652 flow [2021-11-22 14:31:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 14:31:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-11-22 14:31:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1728 transitions. [2021-11-22 14:31:42,987 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7977839335180056 [2021-11-22 14:31:42,988 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1728 transitions. [2021-11-22 14:31:42,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1728 transitions. [2021-11-22 14:31:42,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:42,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1728 transitions. [2021-11-22 14:31:42,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 90.94736842105263) internal successors, (1728), 19 states have internal predecessors, (1728), 0 states have call successors, (0), 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-11-22 14:31:43,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 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-11-22 14:31:43,004 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 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-11-22 14:31:43,004 INFO L186 Difference]: Start difference. First operand has 127 places, 99 transitions, 273 flow. Second operand 19 states and 1728 transitions. [2021-11-22 14:31:43,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 166 transitions, 652 flow [2021-11-22 14:31:43,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 166 transitions, 607 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-11-22 14:31:43,020 INFO L242 Difference]: Finished difference. Result has 146 places, 115 transitions, 431 flow [2021-11-22 14:31:43,021 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=431, PETRI_PLACES=146, PETRI_TRANSITIONS=115} [2021-11-22 14:31:43,024 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 27 predicate places. [2021-11-22 14:31:43,024 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 115 transitions, 431 flow [2021-11-22 14:31:43,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 0 states have call successors, (0), 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-11-22 14:31:43,025 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:43,025 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, 1, 1, 1, 1, 1] [2021-11-22 14:31:43,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 14:31:43,026 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:43,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 333140155, now seen corresponding path program 2 times [2021-11-22 14:31:43,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:43,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111405397] [2021-11-22 14:31:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:43,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:43,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:43,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111405397] [2021-11-22 14:31:43,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111405397] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:43,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:43,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 14:31:43,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048423204] [2021-11-22 14:31:43,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:43,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 14:31:43,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:43,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 14:31:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-11-22 14:31:43,571 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-11-22 14:31:43,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 115 transitions, 431 flow. Second operand has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 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-11-22 14:31:43,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:43,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-11-22 14:31:43,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:44,561 INFO L129 PetriNetUnfolder]: 520/1305 cut-off events. [2021-11-22 14:31:44,561 INFO L130 PetriNetUnfolder]: For 10254/12021 co-relation queries the response was YES. [2021-11-22 14:31:44,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 1305 events. 520/1305 cut-off events. For 10254/12021 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8257 event pairs, 86 based on Foata normal form. 51/1259 useless extension candidates. Maximal degree in co-relation 5944. Up to 510 conditions per place. [2021-11-22 14:31:44,581 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 38 selfloop transitions, 15 changer transitions 26/153 dead transitions. [2021-11-22 14:31:44,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 1041 flow [2021-11-22 14:31:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 14:31:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-22 14:31:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1270 transitions. [2021-11-22 14:31:44,586 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7957393483709273 [2021-11-22 14:31:44,586 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1270 transitions. [2021-11-22 14:31:44,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1270 transitions. [2021-11-22 14:31:44,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:44,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1270 transitions. [2021-11-22 14:31:44,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.71428571428571) internal successors, (1270), 14 states have internal predecessors, (1270), 0 states have call successors, (0), 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-11-22 14:31:44,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-11-22 14:31:44,596 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 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-11-22 14:31:44,597 INFO L186 Difference]: Start difference. First operand has 146 places, 115 transitions, 431 flow. Second operand 14 states and 1270 transitions. [2021-11-22 14:31:44,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 1041 flow [2021-11-22 14:31:44,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 153 transitions, 891 flow, removed 72 selfloop flow, removed 9 redundant places. [2021-11-22 14:31:44,610 INFO L242 Difference]: Finished difference. Result has 148 places, 117 transitions, 486 flow [2021-11-22 14:31:44,611 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=486, PETRI_PLACES=148, PETRI_TRANSITIONS=117} [2021-11-22 14:31:44,612 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2021-11-22 14:31:44,612 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 117 transitions, 486 flow [2021-11-22 14:31:44,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 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-11-22 14:31:44,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:44,613 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, 1, 1, 1, 1, 1] [2021-11-22 14:31:44,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 14:31:44,613 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1276172185, now seen corresponding path program 3 times [2021-11-22 14:31:44,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:44,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844117815] [2021-11-22 14:31:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:44,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:44,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:44,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844117815] [2021-11-22 14:31:44,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844117815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:44,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:44,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 14:31:44,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490765088] [2021-11-22 14:31:44,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:44,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:31:44,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:31:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:31:44,861 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-11-22 14:31:44,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 117 transitions, 486 flow. Second operand has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 0 states have call successors, (0), 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-11-22 14:31:44,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:44,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-11-22 14:31:44,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:45,565 INFO L129 PetriNetUnfolder]: 516/1318 cut-off events. [2021-11-22 14:31:45,565 INFO L130 PetriNetUnfolder]: For 10637/12580 co-relation queries the response was YES. [2021-11-22 14:31:45,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6473 conditions, 1318 events. 516/1318 cut-off events. For 10637/12580 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8501 event pairs, 76 based on Foata normal form. 52/1272 useless extension candidates. Maximal degree in co-relation 6388. Up to 515 conditions per place. [2021-11-22 14:31:45,586 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 37 selfloop transitions, 21 changer transitions 25/157 dead transitions. [2021-11-22 14:31:45,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 157 transitions, 1144 flow [2021-11-22 14:31:45,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 14:31:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-22 14:31:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1093 transitions. [2021-11-22 14:31:45,591 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7989766081871345 [2021-11-22 14:31:45,591 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1093 transitions. [2021-11-22 14:31:45,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1093 transitions. [2021-11-22 14:31:45,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:45,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1093 transitions. [2021-11-22 14:31:45,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.08333333333333) internal successors, (1093), 12 states have internal predecessors, (1093), 0 states have call successors, (0), 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-11-22 14:31:45,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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-11-22 14:31:45,600 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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-11-22 14:31:45,600 INFO L186 Difference]: Start difference. First operand has 148 places, 117 transitions, 486 flow. Second operand 12 states and 1093 transitions. [2021-11-22 14:31:45,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 157 transitions, 1144 flow [2021-11-22 14:31:45,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 157 transitions, 1105 flow, removed 7 selfloop flow, removed 9 redundant places. [2021-11-22 14:31:45,622 INFO L242 Difference]: Finished difference. Result has 152 places, 127 transitions, 687 flow [2021-11-22 14:31:45,623 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=687, PETRI_PLACES=152, PETRI_TRANSITIONS=127} [2021-11-22 14:31:45,625 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 33 predicate places. [2021-11-22 14:31:45,626 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 127 transitions, 687 flow [2021-11-22 14:31:45,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 0 states have call successors, (0), 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-11-22 14:31:45,626 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:45,626 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:45,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 14:31:45,627 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash 132850238, now seen corresponding path program 1 times [2021-11-22 14:31:45,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:45,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220468050] [2021-11-22 14:31:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:45,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:45,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:45,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220468050] [2021-11-22 14:31:45,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220468050] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:45,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:45,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 14:31:45,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97322843] [2021-11-22 14:31:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:45,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 14:31:45,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 14:31:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-11-22 14:31:45,942 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-11-22 14:31:45,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 127 transitions, 687 flow. Second operand has 12 states, 12 states have (on average 87.75) internal successors, (1053), 12 states have internal predecessors, (1053), 0 states have call successors, (0), 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-11-22 14:31:45,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:45,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-11-22 14:31:45,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:46,820 INFO L129 PetriNetUnfolder]: 584/1575 cut-off events. [2021-11-22 14:31:46,820 INFO L130 PetriNetUnfolder]: For 19320/22048 co-relation queries the response was YES. [2021-11-22 14:31:46,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8940 conditions, 1575 events. 584/1575 cut-off events. For 19320/22048 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10994 event pairs, 101 based on Foata normal form. 62/1485 useless extension candidates. Maximal degree in co-relation 8852. Up to 672 conditions per place. [2021-11-22 14:31:46,845 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 54 selfloop transitions, 21 changer transitions 32/181 dead transitions. [2021-11-22 14:31:46,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 181 transitions, 1635 flow [2021-11-22 14:31:46,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 14:31:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-22 14:31:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1092 transitions. [2021-11-22 14:31:46,850 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7982456140350878 [2021-11-22 14:31:46,850 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1092 transitions. [2021-11-22 14:31:46,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1092 transitions. [2021-11-22 14:31:46,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:46,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1092 transitions. [2021-11-22 14:31:46,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.0) internal successors, (1092), 12 states have internal predecessors, (1092), 0 states have call successors, (0), 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-11-22 14:31:46,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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-11-22 14:31:46,860 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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-11-22 14:31:46,860 INFO L186 Difference]: Start difference. First operand has 152 places, 127 transitions, 687 flow. Second operand 12 states and 1092 transitions. [2021-11-22 14:31:46,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 181 transitions, 1635 flow [2021-11-22 14:31:46,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 181 transitions, 1496 flow, removed 65 selfloop flow, removed 6 redundant places. [2021-11-22 14:31:46,905 INFO L242 Difference]: Finished difference. Result has 158 places, 138 transitions, 874 flow [2021-11-22 14:31:46,905 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=874, PETRI_PLACES=158, PETRI_TRANSITIONS=138} [2021-11-22 14:31:46,906 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places. [2021-11-22 14:31:46,907 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 138 transitions, 874 flow [2021-11-22 14:31:46,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.75) internal successors, (1053), 12 states have internal predecessors, (1053), 0 states have call successors, (0), 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-11-22 14:31:46,907 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:46,908 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:46,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 14:31:46,908 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 71879264, now seen corresponding path program 2 times [2021-11-22 14:31:46,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:46,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735305683] [2021-11-22 14:31:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:46,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:47,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735305683] [2021-11-22 14:31:47,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735305683] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:47,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:47,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 14:31:47,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791656831] [2021-11-22 14:31:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:47,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 14:31:47,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:47,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 14:31:47,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-22 14:31:47,251 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-11-22 14:31:47,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 138 transitions, 874 flow. Second operand has 12 states, 12 states have (on average 87.75) internal successors, (1053), 12 states have internal predecessors, (1053), 0 states have call successors, (0), 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-11-22 14:31:47,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:47,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-11-22 14:31:47,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:48,159 INFO L129 PetriNetUnfolder]: 509/1463 cut-off events. [2021-11-22 14:31:48,159 INFO L130 PetriNetUnfolder]: For 20870/26927 co-relation queries the response was YES. [2021-11-22 14:31:48,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8693 conditions, 1463 events. 509/1463 cut-off events. For 20870/26927 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10387 event pairs, 56 based on Foata normal form. 155/1502 useless extension candidates. Maximal degree in co-relation 8600. Up to 646 conditions per place. [2021-11-22 14:31:48,186 INFO L132 encePairwiseOnDemand]: 99/114 looper letters, 48 selfloop transitions, 31 changer transitions 29/182 dead transitions. [2021-11-22 14:31:48,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 182 transitions, 1785 flow [2021-11-22 14:31:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 14:31:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-22 14:31:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1361 transitions. [2021-11-22 14:31:48,191 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.795906432748538 [2021-11-22 14:31:48,191 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1361 transitions. [2021-11-22 14:31:48,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1361 transitions. [2021-11-22 14:31:48,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:48,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1361 transitions. [2021-11-22 14:31:48,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 90.73333333333333) internal successors, (1361), 15 states have internal predecessors, (1361), 0 states have call successors, (0), 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-11-22 14:31:48,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11-22 14:31:48,206 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11-22 14:31:48,207 INFO L186 Difference]: Start difference. First operand has 158 places, 138 transitions, 874 flow. Second operand 15 states and 1361 transitions. [2021-11-22 14:31:48,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 182 transitions, 1785 flow [2021-11-22 14:31:48,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 182 transitions, 1622 flow, removed 79 selfloop flow, removed 11 redundant places. [2021-11-22 14:31:48,257 INFO L242 Difference]: Finished difference. Result has 165 places, 147 transitions, 1067 flow [2021-11-22 14:31:48,258 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1067, PETRI_PLACES=165, PETRI_TRANSITIONS=147} [2021-11-22 14:31:48,258 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2021-11-22 14:31:48,259 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 147 transitions, 1067 flow [2021-11-22 14:31:48,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.75) internal successors, (1053), 12 states have internal predecessors, (1053), 0 states have call successors, (0), 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-11-22 14:31:48,259 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:48,259 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:48,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 14:31:48,260 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash -843113900, now seen corresponding path program 3 times [2021-11-22 14:31:48,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:48,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113151069] [2021-11-22 14:31:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:48,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:48,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113151069] [2021-11-22 14:31:48,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113151069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:48,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:48,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 14:31:48,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103490409] [2021-11-22 14:31:48,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:48,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 14:31:48,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 14:31:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-22 14:31:48,708 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 114 [2021-11-22 14:31:48,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 147 transitions, 1067 flow. Second operand has 16 states, 16 states have (on average 82.625) internal successors, (1322), 16 states have internal predecessors, (1322), 0 states have call successors, (0), 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-11-22 14:31:48,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:48,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 114 [2021-11-22 14:31:48,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:50,132 INFO L129 PetriNetUnfolder]: 524/1677 cut-off events. [2021-11-22 14:31:50,132 INFO L130 PetriNetUnfolder]: For 23397/26860 co-relation queries the response was YES. [2021-11-22 14:31:50,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9966 conditions, 1677 events. 524/1677 cut-off events. For 23397/26860 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12965 event pairs, 36 based on Foata normal form. 156/1717 useless extension candidates. Maximal degree in co-relation 9866. Up to 557 conditions per place. [2021-11-22 14:31:50,167 INFO L132 encePairwiseOnDemand]: 98/114 looper letters, 102 selfloop transitions, 42 changer transitions 30/243 dead transitions. [2021-11-22 14:31:50,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 243 transitions, 2812 flow [2021-11-22 14:31:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 14:31:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-11-22 14:31:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1719 transitions. [2021-11-22 14:31:50,171 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7539473684210526 [2021-11-22 14:31:50,172 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1719 transitions. [2021-11-22 14:31:50,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1719 transitions. [2021-11-22 14:31:50,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:50,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1719 transitions. [2021-11-22 14:31:50,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 85.95) internal successors, (1719), 20 states have internal predecessors, (1719), 0 states have call successors, (0), 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-11-22 14:31:50,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 114.0) internal successors, (2394), 21 states have internal predecessors, (2394), 0 states have call successors, (0), 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-11-22 14:31:50,185 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 114.0) internal successors, (2394), 21 states have internal predecessors, (2394), 0 states have call successors, (0), 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-11-22 14:31:50,185 INFO L186 Difference]: Start difference. First operand has 165 places, 147 transitions, 1067 flow. Second operand 20 states and 1719 transitions. [2021-11-22 14:31:50,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 243 transitions, 2812 flow [2021-11-22 14:31:50,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 243 transitions, 2510 flow, removed 139 selfloop flow, removed 11 redundant places. [2021-11-22 14:31:50,252 INFO L242 Difference]: Finished difference. Result has 173 places, 164 transitions, 1359 flow [2021-11-22 14:31:50,253 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1359, PETRI_PLACES=173, PETRI_TRANSITIONS=164} [2021-11-22 14:31:50,253 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 54 predicate places. [2021-11-22 14:31:50,253 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 164 transitions, 1359 flow [2021-11-22 14:31:50,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 82.625) internal successors, (1322), 16 states have internal predecessors, (1322), 0 states have call successors, (0), 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-11-22 14:31:50,254 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:50,255 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:50,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 14:31:50,255 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash -701261096, now seen corresponding path program 1 times [2021-11-22 14:31:50,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:50,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557597823] [2021-11-22 14:31:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:50,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:50,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:50,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557597823] [2021-11-22 14:31:50,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557597823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:50,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:50,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 14:31:50,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042110364] [2021-11-22 14:31:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:50,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 14:31:50,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:50,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 14:31:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-22 14:31:50,774 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2021-11-22 14:31:50,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 164 transitions, 1359 flow. Second operand has 14 states, 14 states have (on average 83.78571428571429) internal successors, (1173), 14 states have internal predecessors, (1173), 0 states have call successors, (0), 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-11-22 14:31:50,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:50,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2021-11-22 14:31:50,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:51,738 INFO L129 PetriNetUnfolder]: 401/1409 cut-off events. [2021-11-22 14:31:51,738 INFO L130 PetriNetUnfolder]: For 18713/22980 co-relation queries the response was YES. [2021-11-22 14:31:51,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7781 conditions, 1409 events. 401/1409 cut-off events. For 18713/22980 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11124 event pairs, 89 based on Foata normal form. 84/1395 useless extension candidates. Maximal degree in co-relation 7678. Up to 555 conditions per place. [2021-11-22 14:31:51,756 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 78 selfloop transitions, 26 changer transitions 23/197 dead transitions. [2021-11-22 14:31:51,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 197 transitions, 2205 flow [2021-11-22 14:31:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 14:31:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-22 14:31:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1293 transitions. [2021-11-22 14:31:51,760 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.756140350877193 [2021-11-22 14:31:51,760 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1293 transitions. [2021-11-22 14:31:51,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1293 transitions. [2021-11-22 14:31:51,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:51,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1293 transitions. [2021-11-22 14:31:51,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 86.2) internal successors, (1293), 15 states have internal predecessors, (1293), 0 states have call successors, (0), 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-11-22 14:31:51,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11-22 14:31:51,768 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11-22 14:31:51,768 INFO L186 Difference]: Start difference. First operand has 173 places, 164 transitions, 1359 flow. Second operand 15 states and 1293 transitions. [2021-11-22 14:31:51,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 197 transitions, 2205 flow [2021-11-22 14:31:51,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 197 transitions, 2047 flow, removed 43 selfloop flow, removed 13 redundant places. [2021-11-22 14:31:51,813 INFO L242 Difference]: Finished difference. Result has 179 places, 169 transitions, 1419 flow [2021-11-22 14:31:51,814 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1419, PETRI_PLACES=179, PETRI_TRANSITIONS=169} [2021-11-22 14:31:51,815 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 60 predicate places. [2021-11-22 14:31:51,815 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 169 transitions, 1419 flow [2021-11-22 14:31:51,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 83.78571428571429) internal successors, (1173), 14 states have internal predecessors, (1173), 0 states have call successors, (0), 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-11-22 14:31:51,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:51,816 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:51,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 14:31:51,816 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1275359169, now seen corresponding path program 1 times [2021-11-22 14:31:51,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:51,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99572841] [2021-11-22 14:31:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:51,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:52,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:52,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99572841] [2021-11-22 14:31:52,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99572841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:52,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:52,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 14:31:52,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462760471] [2021-11-22 14:31:52,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:52,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 14:31:52,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:52,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 14:31:52,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 14:31:52,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2021-11-22 14:31:52,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 169 transitions, 1419 flow. Second operand has 9 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 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-11-22 14:31:52,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:52,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2021-11-22 14:31:52,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:52,847 INFO L129 PetriNetUnfolder]: 368/1465 cut-off events. [2021-11-22 14:31:52,847 INFO L130 PetriNetUnfolder]: For 16971/21795 co-relation queries the response was YES. [2021-11-22 14:31:52,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 1465 events. 368/1465 cut-off events. For 16971/21795 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12266 event pairs, 62 based on Foata normal form. 68/1443 useless extension candidates. Maximal degree in co-relation 7563. Up to 556 conditions per place. [2021-11-22 14:31:52,871 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 74 selfloop transitions, 35 changer transitions 14/196 dead transitions. [2021-11-22 14:31:52,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 196 transitions, 2064 flow [2021-11-22 14:31:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 14:31:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-22 14:31:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1075 transitions. [2021-11-22 14:31:52,874 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7858187134502924 [2021-11-22 14:31:52,874 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1075 transitions. [2021-11-22 14:31:52,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1075 transitions. [2021-11-22 14:31:52,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:52,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1075 transitions. [2021-11-22 14:31:52,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.58333333333333) internal successors, (1075), 12 states have internal predecessors, (1075), 0 states have call successors, (0), 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-11-22 14:31:52,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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-11-22 14:31:52,881 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 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-11-22 14:31:52,881 INFO L186 Difference]: Start difference. First operand has 179 places, 169 transitions, 1419 flow. Second operand 12 states and 1075 transitions. [2021-11-22 14:31:52,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 196 transitions, 2064 flow [2021-11-22 14:31:52,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 196 transitions, 1840 flow, removed 105 selfloop flow, removed 14 redundant places. [2021-11-22 14:31:52,942 INFO L242 Difference]: Finished difference. Result has 178 places, 174 transitions, 1514 flow [2021-11-22 14:31:52,943 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1514, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2021-11-22 14:31:52,944 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 59 predicate places. [2021-11-22 14:31:52,944 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 1514 flow [2021-11-22 14:31:52,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 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-11-22 14:31:52,944 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:52,945 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:52,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 14:31:52,945 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash 111133225, now seen corresponding path program 2 times [2021-11-22 14:31:52,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:52,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122388641] [2021-11-22 14:31:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:52,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:53,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:53,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122388641] [2021-11-22 14:31:53,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122388641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:53,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:53,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 14:31:53,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512023060] [2021-11-22 14:31:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:53,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 14:31:53,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:53,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 14:31:53,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-11-22 14:31:53,310 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2021-11-22 14:31:53,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 1514 flow. Second operand has 16 states, 16 states have (on average 85.5) internal successors, (1368), 16 states have internal predecessors, (1368), 0 states have call successors, (0), 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-11-22 14:31:53,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:53,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2021-11-22 14:31:53,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:54,064 INFO L129 PetriNetUnfolder]: 361/1463 cut-off events. [2021-11-22 14:31:54,064 INFO L130 PetriNetUnfolder]: For 17726/20515 co-relation queries the response was YES. [2021-11-22 14:31:54,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 1463 events. 361/1463 cut-off events. For 17726/20515 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12490 event pairs, 80 based on Foata normal form. 143/1502 useless extension candidates. Maximal degree in co-relation 7792. Up to 585 conditions per place. [2021-11-22 14:31:54,082 INFO L132 encePairwiseOnDemand]: 98/114 looper letters, 66 selfloop transitions, 33 changer transitions 26/197 dead transitions. [2021-11-22 14:31:54,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 197 transitions, 2161 flow [2021-11-22 14:31:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 14:31:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-22 14:31:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1322 transitions. [2021-11-22 14:31:54,086 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7730994152046784 [2021-11-22 14:31:54,086 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1322 transitions. [2021-11-22 14:31:54,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1322 transitions. [2021-11-22 14:31:54,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:54,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1322 transitions. [2021-11-22 14:31:54,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.13333333333334) internal successors, (1322), 15 states have internal predecessors, (1322), 0 states have call successors, (0), 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-11-22 14:31:54,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11-22 14:31:54,095 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11-22 14:31:54,095 INFO L186 Difference]: Start difference. First operand has 178 places, 174 transitions, 1514 flow. Second operand 15 states and 1322 transitions. [2021-11-22 14:31:54,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 197 transitions, 2161 flow [2021-11-22 14:31:54,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 197 transitions, 2009 flow, removed 68 selfloop flow, removed 10 redundant places. [2021-11-22 14:31:54,147 INFO L242 Difference]: Finished difference. Result has 180 places, 165 transitions, 1389 flow [2021-11-22 14:31:54,148 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1389, PETRI_PLACES=180, PETRI_TRANSITIONS=165} [2021-11-22 14:31:54,148 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2021-11-22 14:31:54,148 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 165 transitions, 1389 flow [2021-11-22 14:31:54,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 85.5) internal successors, (1368), 16 states have internal predecessors, (1368), 0 states have call successors, (0), 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-11-22 14:31:54,149 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:54,149 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:54,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 14:31:54,150 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1375873395, now seen corresponding path program 3 times [2021-11-22 14:31:54,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:54,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546685131] [2021-11-22 14:31:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:54,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:54,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:54,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546685131] [2021-11-22 14:31:54,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546685131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:54,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:54,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 14:31:54,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177105299] [2021-11-22 14:31:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:54,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 14:31:54,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 14:31:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-22 14:31:54,440 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2021-11-22 14:31:54,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 165 transitions, 1389 flow. Second operand has 13 states, 13 states have (on average 85.84615384615384) internal successors, (1116), 13 states have internal predecessors, (1116), 0 states have call successors, (0), 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-11-22 14:31:54,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:54,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2021-11-22 14:31:54,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:55,200 INFO L129 PetriNetUnfolder]: 328/1346 cut-off events. [2021-11-22 14:31:55,201 INFO L130 PetriNetUnfolder]: For 13104/18070 co-relation queries the response was YES. [2021-11-22 14:31:55,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6782 conditions, 1346 events. 328/1346 cut-off events. For 13104/18070 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11249 event pairs, 109 based on Foata normal form. 88/1344 useless extension candidates. Maximal degree in co-relation 6682. Up to 629 conditions per place. [2021-11-22 14:31:55,220 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 86 selfloop transitions, 20 changer transitions 23/201 dead transitions. [2021-11-22 14:31:55,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 201 transitions, 2151 flow [2021-11-22 14:31:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 14:31:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-22 14:31:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1318 transitions. [2021-11-22 14:31:55,223 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7707602339181286 [2021-11-22 14:31:55,224 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1318 transitions. [2021-11-22 14:31:55,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1318 transitions. [2021-11-22 14:31:55,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:55,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1318 transitions. [2021-11-22 14:31:55,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 87.86666666666666) internal successors, (1318), 15 states have internal predecessors, (1318), 0 states have call successors, (0), 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-11-22 14:31:55,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11-22 14:31:55,232 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11-22 14:31:55,232 INFO L186 Difference]: Start difference. First operand has 180 places, 165 transitions, 1389 flow. Second operand 15 states and 1318 transitions. [2021-11-22 14:31:55,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 201 transitions, 2151 flow [2021-11-22 14:31:55,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 201 transitions, 2085 flow, removed 14 selfloop flow, removed 12 redundant places. [2021-11-22 14:31:55,272 INFO L242 Difference]: Finished difference. Result has 186 places, 173 transitions, 1551 flow [2021-11-22 14:31:55,272 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1551, PETRI_PLACES=186, PETRI_TRANSITIONS=173} [2021-11-22 14:31:55,273 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 67 predicate places. [2021-11-22 14:31:55,273 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 173 transitions, 1551 flow [2021-11-22 14:31:55,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.84615384615384) internal successors, (1116), 13 states have internal predecessors, (1116), 0 states have call successors, (0), 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-11-22 14:31:55,274 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:55,274 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:55,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 14:31:55,275 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:55,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233573, now seen corresponding path program 4 times [2021-11-22 14:31:55,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:55,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534163941] [2021-11-22 14:31:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:55,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:55,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:55,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534163941] [2021-11-22 14:31:55,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534163941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:55,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:55,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 14:31:55,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11107625] [2021-11-22 14:31:55,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:55,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 14:31:55,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:55,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 14:31:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-11-22 14:31:55,659 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2021-11-22 14:31:55,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 173 transitions, 1551 flow. Second operand has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 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-11-22 14:31:55,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:55,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2021-11-22 14:31:55,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:56,476 INFO L129 PetriNetUnfolder]: 327/1314 cut-off events. [2021-11-22 14:31:56,476 INFO L130 PetriNetUnfolder]: For 14915/17787 co-relation queries the response was YES. [2021-11-22 14:31:56,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 1314 events. 327/1314 cut-off events. For 14915/17787 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10697 event pairs, 87 based on Foata normal form. 66/1277 useless extension candidates. Maximal degree in co-relation 6965. Up to 612 conditions per place. [2021-11-22 14:31:56,495 INFO L132 encePairwiseOnDemand]: 99/114 looper letters, 88 selfloop transitions, 27 changer transitions 23/208 dead transitions. [2021-11-22 14:31:56,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 208 transitions, 2347 flow [2021-11-22 14:31:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 14:31:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-22 14:31:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1538 transitions. [2021-11-22 14:31:56,499 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7495126705653021 [2021-11-22 14:31:56,499 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1538 transitions. [2021-11-22 14:31:56,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1538 transitions. [2021-11-22 14:31:56,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:56,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1538 transitions. [2021-11-22 14:31:56,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.44444444444444) internal successors, (1538), 18 states have internal predecessors, (1538), 0 states have call successors, (0), 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-11-22 14:31:56,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 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-11-22 14:31:56,509 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 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-11-22 14:31:56,510 INFO L186 Difference]: Start difference. First operand has 186 places, 173 transitions, 1551 flow. Second operand 18 states and 1538 transitions. [2021-11-22 14:31:56,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 208 transitions, 2347 flow [2021-11-22 14:31:56,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 208 transitions, 2231 flow, removed 47 selfloop flow, removed 12 redundant places. [2021-11-22 14:31:56,564 INFO L242 Difference]: Finished difference. Result has 193 places, 177 transitions, 1653 flow [2021-11-22 14:31:56,565 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1653, PETRI_PLACES=193, PETRI_TRANSITIONS=177} [2021-11-22 14:31:56,565 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 74 predicate places. [2021-11-22 14:31:56,566 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 177 transitions, 1653 flow [2021-11-22 14:31:56,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 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-11-22 14:31:56,568 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:56,569 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:56,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 14:31:56,569 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash 572080961, now seen corresponding path program 5 times [2021-11-22 14:31:56,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:56,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090308904] [2021-11-22 14:31:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:56,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:57,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:57,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090308904] [2021-11-22 14:31:57,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090308904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:57,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:57,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 14:31:57,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545749242] [2021-11-22 14:31:57,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:57,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 14:31:57,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:57,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 14:31:57,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-22 14:31:57,026 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2021-11-22 14:31:57,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 177 transitions, 1653 flow. Second operand has 11 states, 11 states have (on average 88.0) internal successors, (968), 11 states have internal predecessors, (968), 0 states have call successors, (0), 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-11-22 14:31:57,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:57,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2021-11-22 14:31:57,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:57,785 INFO L129 PetriNetUnfolder]: 313/1308 cut-off events. [2021-11-22 14:31:57,785 INFO L130 PetriNetUnfolder]: For 14964/21053 co-relation queries the response was YES. [2021-11-22 14:31:57,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 1308 events. 313/1308 cut-off events. For 14964/21053 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10911 event pairs, 49 based on Foata normal form. 141/1358 useless extension candidates. Maximal degree in co-relation 6777. Up to 438 conditions per place. [2021-11-22 14:31:57,797 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 56 selfloop transitions, 40 changer transitions 31/201 dead transitions. [2021-11-22 14:31:57,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 201 transitions, 2322 flow [2021-11-22 14:31:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 14:31:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-22 14:31:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1171 transitions. [2021-11-22 14:31:57,801 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7901484480431848 [2021-11-22 14:31:57,801 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1171 transitions. [2021-11-22 14:31:57,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1171 transitions. [2021-11-22 14:31:57,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:57,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1171 transitions. [2021-11-22 14:31:57,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 0 states have call successors, (0), 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-11-22 14:31:57,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-11-22 14:31:57,808 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-11-22 14:31:57,808 INFO L186 Difference]: Start difference. First operand has 193 places, 177 transitions, 1653 flow. Second operand 13 states and 1171 transitions. [2021-11-22 14:31:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 201 transitions, 2322 flow [2021-11-22 14:31:57,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 201 transitions, 2193 flow, removed 50 selfloop flow, removed 14 redundant places. [2021-11-22 14:31:57,861 INFO L242 Difference]: Finished difference. Result has 190 places, 165 transitions, 1501 flow [2021-11-22 14:31:57,862 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1501, PETRI_PLACES=190, PETRI_TRANSITIONS=165} [2021-11-22 14:31:57,862 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 71 predicate places. [2021-11-22 14:31:57,862 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 165 transitions, 1501 flow [2021-11-22 14:31:57,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.0) internal successors, (968), 11 states have internal predecessors, (968), 0 states have call successors, (0), 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-11-22 14:31:57,863 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:57,863 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:57,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 14:31:57,863 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:57,864 INFO L85 PathProgramCache]: Analyzing trace with hash 338387768, now seen corresponding path program 1 times [2021-11-22 14:31:57,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:57,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833762630] [2021-11-22 14:31:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:57,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:57,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:57,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833762630] [2021-11-22 14:31:57,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833762630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:57,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:57,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 14:31:57,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814611358] [2021-11-22 14:31:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:57,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 14:31:57,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:57,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 14:31:57,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 14:31:57,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-11-22 14:31:57,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 165 transitions, 1501 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:31:57,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:57,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-11-22 14:31:57,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:31:59,524 INFO L129 PetriNetUnfolder]: 3215/7112 cut-off events. [2021-11-22 14:31:59,525 INFO L130 PetriNetUnfolder]: For 66521/66810 co-relation queries the response was YES. [2021-11-22 14:31:59,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27219 conditions, 7112 events. 3215/7112 cut-off events. For 66521/66810 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 62882 event pairs, 123 based on Foata normal form. 156/7007 useless extension candidates. Maximal degree in co-relation 27121. Up to 2085 conditions per place. [2021-11-22 14:31:59,578 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 96 selfloop transitions, 6 changer transitions 160/338 dead transitions. [2021-11-22 14:31:59,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 338 transitions, 4633 flow [2021-11-22 14:31:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 14:31:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-22 14:31:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2021-11-22 14:31:59,581 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8570175438596491 [2021-11-22 14:31:59,582 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 977 transitions. [2021-11-22 14:31:59,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 977 transitions. [2021-11-22 14:31:59,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:31:59,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 977 transitions. [2021-11-22 14:31:59,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 0 states have call successors, (0), 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-11-22 14:31:59,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-11-22 14:31:59,587 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-11-22 14:31:59,587 INFO L186 Difference]: Start difference. First operand has 190 places, 165 transitions, 1501 flow. Second operand 10 states and 977 transitions. [2021-11-22 14:31:59,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 338 transitions, 4633 flow [2021-11-22 14:31:59,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 338 transitions, 4127 flow, removed 170 selfloop flow, removed 22 redundant places. [2021-11-22 14:31:59,683 INFO L242 Difference]: Finished difference. Result has 176 places, 142 transitions, 1037 flow [2021-11-22 14:31:59,683 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1037, PETRI_PLACES=176, PETRI_TRANSITIONS=142} [2021-11-22 14:31:59,684 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 57 predicate places. [2021-11-22 14:31:59,684 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 142 transitions, 1037 flow [2021-11-22 14:31:59,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 14:31:59,684 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:31:59,685 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:31:59,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 14:31:59,685 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:31:59,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:31:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1623894536, now seen corresponding path program 1 times [2021-11-22 14:31:59,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:31:59,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805885773] [2021-11-22 14:31:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:31:59,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:31:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:31:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:31:59,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:31:59,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805885773] [2021-11-22 14:31:59,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805885773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:31:59,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:31:59,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 14:31:59,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822145977] [2021-11-22 14:31:59,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:31:59,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:31:59,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:31:59,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:31:59,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:31:59,806 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-11-22 14:31:59,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 142 transitions, 1037 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 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-11-22 14:31:59,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:31:59,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-11-22 14:31:59,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:32:00,421 INFO L129 PetriNetUnfolder]: 473/1442 cut-off events. [2021-11-22 14:32:00,421 INFO L130 PetriNetUnfolder]: For 9606/9638 co-relation queries the response was YES. [2021-11-22 14:32:00,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6103 conditions, 1442 events. 473/1442 cut-off events. For 9606/9638 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10217 event pairs, 7 based on Foata normal form. 83/1519 useless extension candidates. Maximal degree in co-relation 6014. Up to 393 conditions per place. [2021-11-22 14:32:00,434 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 73 selfloop transitions, 9 changer transitions 72/230 dead transitions. [2021-11-22 14:32:00,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 230 transitions, 2520 flow [2021-11-22 14:32:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 14:32:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-22 14:32:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2021-11-22 14:32:00,437 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.843859649122807 [2021-11-22 14:32:00,437 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2021-11-22 14:32:00,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2021-11-22 14:32:00,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:32:00,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2021-11-22 14:32:00,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 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-11-22 14:32:00,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-11-22 14:32:00,442 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-11-22 14:32:00,442 INFO L186 Difference]: Start difference. First operand has 176 places, 142 transitions, 1037 flow. Second operand 10 states and 962 transitions. [2021-11-22 14:32:00,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 230 transitions, 2520 flow [2021-11-22 14:32:00,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 230 transitions, 2308 flow, removed 20 selfloop flow, removed 17 redundant places. [2021-11-22 14:32:00,465 INFO L242 Difference]: Finished difference. Result has 167 places, 132 transitions, 831 flow [2021-11-22 14:32:00,465 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=831, PETRI_PLACES=167, PETRI_TRANSITIONS=132} [2021-11-22 14:32:00,466 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 48 predicate places. [2021-11-22 14:32:00,466 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 132 transitions, 831 flow [2021-11-22 14:32:00,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 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-11-22 14:32:00,467 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:32:00,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:32:00,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 14:32:00,467 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:32:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:32:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1569767859, now seen corresponding path program 1 times [2021-11-22 14:32:00,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:32:00,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954610017] [2021-11-22 14:32:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:32:00,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:32:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:32:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:32:00,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:32:00,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954610017] [2021-11-22 14:32:00,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954610017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:32:00,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:32:00,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 14:32:00,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534441360] [2021-11-22 14:32:00,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:32:00,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 14:32:00,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:32:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 14:32:00,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:32:00,591 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2021-11-22 14:32:00,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 132 transitions, 831 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 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-11-22 14:32:00,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-22 14:32:00,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2021-11-22 14:32:00,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-22 14:32:00,890 INFO L129 PetriNetUnfolder]: 108/499 cut-off events. [2021-11-22 14:32:00,890 INFO L130 PetriNetUnfolder]: For 3230/3246 co-relation queries the response was YES. [2021-11-22 14:32:00,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 499 events. 108/499 cut-off events. For 3230/3246 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2704 event pairs, 4 based on Foata normal form. 19/514 useless extension candidates. Maximal degree in co-relation 2057. Up to 116 conditions per place. [2021-11-22 14:32:00,893 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 38 selfloop transitions, 12 changer transitions 49/173 dead transitions. [2021-11-22 14:32:00,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 173 transitions, 1570 flow [2021-11-22 14:32:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 14:32:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-22 14:32:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1026 transitions. [2021-11-22 14:32:00,896 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2021-11-22 14:32:00,896 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1026 transitions. [2021-11-22 14:32:00,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1026 transitions. [2021-11-22 14:32:00,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 14:32:00,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1026 transitions. [2021-11-22 14:32:00,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.27272727272727) internal successors, (1026), 11 states have internal predecessors, (1026), 0 states have call successors, (0), 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-11-22 14:32:00,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-11-22 14:32:00,901 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-11-22 14:32:00,901 INFO L186 Difference]: Start difference. First operand has 167 places, 132 transitions, 831 flow. Second operand 11 states and 1026 transitions. [2021-11-22 14:32:00,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 173 transitions, 1570 flow [2021-11-22 14:32:00,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 173 transitions, 1371 flow, removed 55 selfloop flow, removed 14 redundant places. [2021-11-22 14:32:00,917 INFO L242 Difference]: Finished difference. Result has 165 places, 110 transitions, 508 flow [2021-11-22 14:32:00,918 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=508, PETRI_PLACES=165, PETRI_TRANSITIONS=110} [2021-11-22 14:32:00,918 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2021-11-22 14:32:00,918 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 110 transitions, 508 flow [2021-11-22 14:32:00,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 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-11-22 14:32:00,919 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-22 14:32:00,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:32:00,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 14:32:00,920 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-22 14:32:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:32:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1969160916, now seen corresponding path program 1 times [2021-11-22 14:32:00,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:32:00,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232380629] [2021-11-22 14:32:00,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:32:00,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:32:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 14:32:01,024 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 14:32:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 14:32:01,205 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 14:32:01,205 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 14:32:01,206 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-22 14:32:01,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-22 14:32:01,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-11-22 14:32:01,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-11-22 14:32:01,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-11-22 14:32:01,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-22 14:32:01,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 14:32:01,217 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:32:01,223 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-22 14:32:01,223 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 14:32:01,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:32:01 BasicIcfg [2021-11-22 14:32:01,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 14:32:01,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 14:32:01,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 14:32:01,444 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 14:32:01,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:31:35" (3/4) ... [2021-11-22 14:32:01,446 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-22 14:32:01,656 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/witness.graphml [2021-11-22 14:32:01,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 14:32:01,657 INFO L158 Benchmark]: Toolchain (without parser) took 28672.00ms. Allocated memory was 88.1MB in the beginning and 669.0MB in the end (delta: 580.9MB). Free memory was 64.2MB in the beginning and 441.8MB in the end (delta: -377.6MB). Peak memory consumption was 204.0MB. Max. memory is 16.1GB. [2021-11-22 14:32:01,657 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 88.1MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 14:32:01,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 687.06ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 64.0MB in the beginning and 65.6MB in the end (delta: -1.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2021-11-22 14:32:01,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.67ms. Allocated memory is still 113.2MB. Free memory was 65.6MB in the beginning and 62.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-22 14:32:01,659 INFO L158 Benchmark]: Boogie Preprocessor took 61.57ms. Allocated memory is still 113.2MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 14:32:01,659 INFO L158 Benchmark]: RCFGBuilder took 1815.17ms. Allocated memory was 113.2MB in the beginning and 157.3MB in the end (delta: 44.0MB). Free memory was 59.6MB in the beginning and 103.2MB in the end (delta: -43.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2021-11-22 14:32:01,660 INFO L158 Benchmark]: TraceAbstraction took 25783.68ms. Allocated memory was 157.3MB in the beginning and 669.0MB in the end (delta: 511.7MB). Free memory was 103.2MB in the beginning and 482.7MB in the end (delta: -379.5MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2021-11-22 14:32:01,660 INFO L158 Benchmark]: Witness Printer took 212.92ms. Allocated memory is still 669.0MB. Free memory was 482.7MB in the beginning and 441.8MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-11-22 14:32:01,662 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 88.1MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 687.06ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 64.0MB in the beginning and 65.6MB in the end (delta: -1.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.67ms. Allocated memory is still 113.2MB. Free memory was 65.6MB in the beginning and 62.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.57ms. Allocated memory is still 113.2MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1815.17ms. Allocated memory was 113.2MB in the beginning and 157.3MB in the end (delta: 44.0MB). Free memory was 59.6MB in the beginning and 103.2MB in the end (delta: -43.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25783.68ms. Allocated memory was 157.3MB in the beginning and 669.0MB in the end (delta: 511.7MB). Free memory was 103.2MB in the beginning and 482.7MB in the end (delta: -379.5MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. * Witness Printer took 212.92ms. Allocated memory is still 669.0MB. Free memory was 482.7MB in the beginning and 441.8MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=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, 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_buff0_thd3=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, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L849] 0 pthread_t t2537; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L851] 0 pthread_t t2538; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L853] 0 pthread_t t2539; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L751] 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) [L752] 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)) [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_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] 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)) [L752] 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)) [L753] 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)) [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_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] 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)) [L753] 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)) [L754] 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)) [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_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] 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)) [L754] 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)) [L755] 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)) [L755] 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) [L755] 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)) [L755] 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)) [L756] 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)) [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_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] 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)) [L756] 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)) [L757] 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)) [L757] 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) [L757] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, 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_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 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) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] 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) [L775] 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) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 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 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 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 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L798] 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) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] 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) [L798] 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) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 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 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 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 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=67, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 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 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 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 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, 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: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 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: 25.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1015 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1015 mSDsluCounter, 1216 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1749 mSDsCounter, 707 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3869 IncrementalHoareTripleChecker+Invalid, 4576 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 707 mSolverCounterUnsat, 196 mSDtfsCounter, 3869 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1653occurred in iteration=16, InterpolantAutomatonStates: 255, 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.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1692 NumberOfCodeBlocks, 1692 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 11058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-11-22 14:32:01,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adffbbe9-dc63-4f09-8b3f-e2a4ef0b05b8/bin/uautomizer-w2VwFs6gM0/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