./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU --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 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 23:19:31,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 23:19:31,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 23:19:31,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 23:19:31,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 23:19:31,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 23:19:31,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 23:19:31,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 23:19:31,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 23:19:31,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 23:19:31,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 23:19:31,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 23:19:31,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 23:19:31,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 23:19:32,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 23:19:32,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 23:19:32,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 23:19:32,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 23:19:32,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 23:19:32,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 23:19:32,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 23:19:32,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 23:19:32,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 23:19:32,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 23:19:32,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 23:19:32,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 23:19:32,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 23:19:32,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 23:19:32,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 23:19:32,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 23:19:32,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 23:19:32,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 23:19:32,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 23:19:32,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 23:19:32,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 23:19:32,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 23:19:32,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 23:19:32,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 23:19:32,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 23:19:32,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 23:19:32,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 23:19:32,073 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 23:19:32,131 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 23:19:32,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 23:19:32,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 23:19:32,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 23:19:32,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 23:19:32,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 23:19:32,143 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 23:19:32,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 23:19:32,144 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 23:19:32,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 23:19:32,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 23:19:32,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 23:19:32,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 23:19:32,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 23:19:32,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 23:19:32,147 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 23:19:32,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 23:19:32,148 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 23:19:32,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 23:19:32,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 23:19:32,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 23:19:32,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 23:19:32,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:19:32,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 23:19:32,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 23:19:32,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 23:19:32,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 23:19:32,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 23:19:32,152 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 23:19:32,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 23:19:32,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 23:19:32,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 23:19:32,155 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_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/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_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU 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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2021-11-02 23:19:32,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 23:19:32,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 23:19:32,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 23:19:32,542 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 23:19:32,543 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 23:19:32,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-11-02 23:19:32,654 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/data/4336c437a/a64e952108fb4608a65e13c4082e03ba/FLAG4fe664180 [2021-11-02 23:19:33,456 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 23:19:33,456 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-11-02 23:19:33,478 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/data/4336c437a/a64e952108fb4608a65e13c4082e03ba/FLAG4fe664180 [2021-11-02 23:19:33,670 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/data/4336c437a/a64e952108fb4608a65e13c4082e03ba [2021-11-02 23:19:33,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 23:19:33,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 23:19:33,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 23:19:33,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 23:19:33,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 23:19:33,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:19:33" (1/1) ... [2021-11-02 23:19:33,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184e8746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:33, skipping insertion in model container [2021-11-02 23:19:33,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:19:33" (1/1) ... [2021-11-02 23:19:33,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 23:19:33,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 23:19:33,990 WARN L228 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_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-11-02 23:19:34,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:19:34,312 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 23:19:34,326 WARN L228 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_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-11-02 23:19:34,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:19:34,442 INFO L208 MainTranslator]: Completed translation [2021-11-02 23:19:34,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34 WrapperNode [2021-11-02 23:19:34,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 23:19:34,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 23:19:34,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 23:19:34,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 23:19:34,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 23:19:34,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 23:19:34,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 23:19:34,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 23:19:34,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 23:19:34,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 23:19:34,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 23:19:34,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 23:19:34,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (1/1) ... [2021-11-02 23:19:34,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:19:34,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:19:34,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 23:19:34,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 23:19:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 23:19:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-02 23:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 23:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 23:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-02 23:19:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-02 23:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-02 23:19:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-02 23:19:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-02 23:19:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-02 23:19:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 23:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-02 23:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 23:19:34,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 23:19:34,726 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-02 23:19:36,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 23:19:36,941 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-02 23:19:36,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:19:36 BoogieIcfgContainer [2021-11-02 23:19:36,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 23:19:36,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 23:19:36,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 23:19:36,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 23:19:36,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:19:33" (1/3) ... [2021-11-02 23:19:36,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c76d79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:19:36, skipping insertion in model container [2021-11-02 23:19:36,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:19:34" (2/3) ... [2021-11-02 23:19:36,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c76d79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:19:36, skipping insertion in model container [2021-11-02 23:19:36,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:19:36" (3/3) ... [2021-11-02 23:19:36,957 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-11-02 23:19:36,968 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-02 23:19:36,968 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 23:19:36,969 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-02 23:19:36,969 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-02 23:19:37,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,025 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,025 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,069 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,070 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,071 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,071 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,079 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,080 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,081 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,091 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,091 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,104 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,112 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,113 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,120 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,120 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,121 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:19:37,124 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-02 23:19:37,219 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 23:19:37,240 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-02 23:19:37,242 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-02 23:19:37,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-11-02 23:19:37,328 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-11-02 23:19:37,328 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-02 23:19:37,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-11-02 23:19:37,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-11-02 23:19:37,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-11-02 23:19:37,357 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-11-02 23:19:37,357 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-02 23:19:37,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:37,358 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] [2021-11-02 23:19:37,359 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash -742568189, now seen corresponding path program 1 times [2021-11-02 23:19:37,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:37,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799311408] [2021-11-02 23:19:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:37,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:37,872 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-02 23:19:37,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:37,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799311408] [2021-11-02 23:19:37,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799311408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:37,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:37,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 23:19:37,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674652745] [2021-11-02 23:19:37,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:19:37,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:37,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:19:37,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:19:37,908 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 106 [2021-11-02 23:19:37,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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-02 23:19:37,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:37,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 106 [2021-11-02 23:19:37,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:38,020 INFO L129 PetriNetUnfolder]: 29/224 cut-off events. [2021-11-02 23:19:38,023 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-02 23:19:38,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 224 events. 29/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 733 event pairs, 15 based on Foata normal form. 11/219 useless extension candidates. Maximal degree in co-relation 240. Up to 41 conditions per place. [2021-11-02 23:19:38,028 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 7 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2021-11-02 23:19:38,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 231 flow [2021-11-02 23:19:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:19:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-02 23:19:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2021-11-02 23:19:38,051 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.949685534591195 [2021-11-02 23:19:38,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2021-11-02 23:19:38,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2021-11-02 23:19:38,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:38,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2021-11-02 23:19:38,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-02 23:19:38,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-02 23:19:38,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-02 23:19:38,085 INFO L186 Difference]: Start difference. First operand has 111 places, 103 transitions, 215 flow. Second operand 3 states and 302 transitions. [2021-11-02 23:19:38,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 231 flow [2021-11-02 23:19:38,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 102 transitions, 228 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-02 23:19:38,098 INFO L242 Difference]: Finished difference. Result has 108 places, 99 transitions, 208 flow [2021-11-02 23:19:38,100 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2021-11-02 23:19:38,101 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2021-11-02 23:19:38,102 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 208 flow [2021-11-02 23:19:38,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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-02 23:19:38,103 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:38,103 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] [2021-11-02 23:19:38,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 23:19:38,104 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:38,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 204956710, now seen corresponding path program 1 times [2021-11-02 23:19:38,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:38,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578762815] [2021-11-02 23:19:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:38,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:38,580 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-02 23:19:38,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:38,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578762815] [2021-11-02 23:19:38,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578762815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:38,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:38,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:19:38,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945230649] [2021-11-02 23:19:38,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:19:38,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:19:38,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:19:38,590 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2021-11-02 23:19:38,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 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-02 23:19:38,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:38,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2021-11-02 23:19:38,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:39,357 INFO L129 PetriNetUnfolder]: 449/1440 cut-off events. [2021-11-02 23:19:39,357 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-02 23:19:39,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1440 events. 449/1440 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10829 event pairs, 66 based on Foata normal form. 0/1386 useless extension candidates. Maximal degree in co-relation 2153. Up to 229 conditions per place. [2021-11-02 23:19:39,376 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 17 selfloop transitions, 6 changer transitions 47/144 dead transitions. [2021-11-02 23:19:39,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 144 transitions, 420 flow [2021-11-02 23:19:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 23:19:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-02 23:19:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 846 transitions. [2021-11-02 23:19:39,384 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8867924528301887 [2021-11-02 23:19:39,384 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 846 transitions. [2021-11-02 23:19:39,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 846 transitions. [2021-11-02 23:19:39,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:39,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 846 transitions. [2021-11-02 23:19:39,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.0) internal successors, (846), 9 states have internal predecessors, (846), 0 states have call successors, (0), 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-02 23:19:39,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 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-02 23:19:39,397 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 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-02 23:19:39,397 INFO L186 Difference]: Start difference. First operand has 108 places, 99 transitions, 208 flow. Second operand 9 states and 846 transitions. [2021-11-02 23:19:39,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 144 transitions, 420 flow [2021-11-02 23:19:39,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 144 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-02 23:19:39,406 INFO L242 Difference]: Finished difference. Result has 122 places, 93 transitions, 262 flow [2021-11-02 23:19:39,407 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=122, PETRI_TRANSITIONS=93} [2021-11-02 23:19:39,407 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2021-11-02 23:19:39,408 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 93 transitions, 262 flow [2021-11-02 23:19:39,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 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-02 23:19:39,409 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:39,409 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] [2021-11-02 23:19:39,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 23:19:39,410 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash -486216505, now seen corresponding path program 1 times [2021-11-02 23:19:39,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:39,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562184441] [2021-11-02 23:19:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:39,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:39,750 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-02 23:19:39,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:39,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562184441] [2021-11-02 23:19:39,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562184441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:39,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:39,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:19:39,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728128221] [2021-11-02 23:19:39,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:19:39,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:19:39,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:19:39,763 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2021-11-02 23:19:39,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 93 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 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-02 23:19:39,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:39,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2021-11-02 23:19:39,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:40,219 INFO L129 PetriNetUnfolder]: 160/570 cut-off events. [2021-11-02 23:19:40,219 INFO L130 PetriNetUnfolder]: For 928/1293 co-relation queries the response was YES. [2021-11-02 23:19:40,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 570 events. 160/570 cut-off events. For 928/1293 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3106 event pairs, 3 based on Foata normal form. 21/574 useless extension candidates. Maximal degree in co-relation 1539. Up to 134 conditions per place. [2021-11-02 23:19:40,225 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 19 selfloop transitions, 7 changer transitions 45/145 dead transitions. [2021-11-02 23:19:40,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 145 transitions, 766 flow [2021-11-02 23:19:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 23:19:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-02 23:19:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1189 transitions. [2021-11-02 23:19:40,232 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.862844702467344 [2021-11-02 23:19:40,232 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1189 transitions. [2021-11-02 23:19:40,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1189 transitions. [2021-11-02 23:19:40,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:40,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1189 transitions. [2021-11-02 23:19:40,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.46153846153847) internal successors, (1189), 13 states have internal predecessors, (1189), 0 states have call successors, (0), 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-02 23:19:40,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 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-02 23:19:40,244 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 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-02 23:19:40,244 INFO L186 Difference]: Start difference. First operand has 122 places, 93 transitions, 262 flow. Second operand 13 states and 1189 transitions. [2021-11-02 23:19:40,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 145 transitions, 766 flow [2021-11-02 23:19:40,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 145 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-02 23:19:40,260 INFO L242 Difference]: Finished difference. Result has 128 places, 95 transitions, 316 flow [2021-11-02 23:19:40,260 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=316, PETRI_PLACES=128, PETRI_TRANSITIONS=95} [2021-11-02 23:19:40,261 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2021-11-02 23:19:40,261 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 95 transitions, 316 flow [2021-11-02 23:19:40,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 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-02 23:19:40,262 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:40,262 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-02 23:19:40,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 23:19:40,263 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1329584827, now seen corresponding path program 1 times [2021-11-02 23:19:40,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:40,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401740269] [2021-11-02 23:19:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:40,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:40,491 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-02 23:19:40,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:40,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401740269] [2021-11-02 23:19:40,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401740269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:40,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:40,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 23:19:40,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378487095] [2021-11-02 23:19:40,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 23:19:40,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:40,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 23:19:40,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:19:40,502 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2021-11-02 23:19:40,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 95 transitions, 316 flow. Second operand has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 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-02 23:19:40,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:40,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2021-11-02 23:19:40,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:40,696 INFO L129 PetriNetUnfolder]: 43/290 cut-off events. [2021-11-02 23:19:40,696 INFO L130 PetriNetUnfolder]: For 752/1275 co-relation queries the response was YES. [2021-11-02 23:19:40,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 290 events. 43/290 cut-off events. For 752/1275 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1223 event pairs, 0 based on Foata normal form. 11/291 useless extension candidates. Maximal degree in co-relation 796. Up to 46 conditions per place. [2021-11-02 23:19:40,702 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 19 selfloop transitions, 10 changer transitions 19/122 dead transitions. [2021-11-02 23:19:40,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 652 flow [2021-11-02 23:19:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:19:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-02 23:19:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 735 transitions. [2021-11-02 23:19:40,707 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8667452830188679 [2021-11-02 23:19:40,707 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 735 transitions. [2021-11-02 23:19:40,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 735 transitions. [2021-11-02 23:19:40,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:40,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 735 transitions. [2021-11-02 23:19:40,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 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-02 23:19:40,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 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-02 23:19:40,715 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 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-02 23:19:40,715 INFO L186 Difference]: Start difference. First operand has 128 places, 95 transitions, 316 flow. Second operand 8 states and 735 transitions. [2021-11-02 23:19:40,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 652 flow [2021-11-02 23:19:40,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 122 transitions, 584 flow, removed 32 selfloop flow, removed 7 redundant places. [2021-11-02 23:19:40,729 INFO L242 Difference]: Finished difference. Result has 124 places, 97 transitions, 346 flow [2021-11-02 23:19:40,729 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=124, PETRI_TRANSITIONS=97} [2021-11-02 23:19:40,730 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 13 predicate places. [2021-11-02 23:19:40,730 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 97 transitions, 346 flow [2021-11-02 23:19:40,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 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-02 23:19:40,731 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:40,731 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:19:40,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 23:19:40,732 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:40,732 INFO L85 PathProgramCache]: Analyzing trace with hash -610526112, now seen corresponding path program 1 times [2021-11-02 23:19:40,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:40,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546545636] [2021-11-02 23:19:40,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:40,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:41,005 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-02 23:19:41,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:41,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546545636] [2021-11-02 23:19:41,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546545636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:41,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:41,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 23:19:41,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265776008] [2021-11-02 23:19:41,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 23:19:41,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:41,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 23:19:41,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:19:41,012 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2021-11-02 23:19:41,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 97 transitions, 346 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 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-02 23:19:41,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:41,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2021-11-02 23:19:41,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:41,327 INFO L129 PetriNetUnfolder]: 22/324 cut-off events. [2021-11-02 23:19:41,327 INFO L130 PetriNetUnfolder]: For 550/1119 co-relation queries the response was YES. [2021-11-02 23:19:41,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 324 events. 22/324 cut-off events. For 550/1119 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1739 event pairs, 8 based on Foata normal form. 13/328 useless extension candidates. Maximal degree in co-relation 774. Up to 45 conditions per place. [2021-11-02 23:19:41,331 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 22 selfloop transitions, 10 changer transitions 18/124 dead transitions. [2021-11-02 23:19:41,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 124 transitions, 652 flow [2021-11-02 23:19:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 23:19:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-02 23:19:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1179 transitions. [2021-11-02 23:19:41,337 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8555878084179971 [2021-11-02 23:19:41,337 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1179 transitions. [2021-11-02 23:19:41,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1179 transitions. [2021-11-02 23:19:41,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:41,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1179 transitions. [2021-11-02 23:19:41,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.6923076923077) internal successors, (1179), 13 states have internal predecessors, (1179), 0 states have call successors, (0), 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-02 23:19:41,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 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-02 23:19:41,348 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 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-02 23:19:41,348 INFO L186 Difference]: Start difference. First operand has 124 places, 97 transitions, 346 flow. Second operand 13 states and 1179 transitions. [2021-11-02 23:19:41,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 124 transitions, 652 flow [2021-11-02 23:19:41,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 124 transitions, 533 flow, removed 42 selfloop flow, removed 12 redundant places. [2021-11-02 23:19:41,356 INFO L242 Difference]: Finished difference. Result has 129 places, 97 transitions, 329 flow [2021-11-02 23:19:41,356 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=329, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2021-11-02 23:19:41,357 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2021-11-02 23:19:41,357 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 329 flow [2021-11-02 23:19:41,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 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-02 23:19:41,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:41,358 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:19:41,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 23:19:41,358 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1162096510, now seen corresponding path program 2 times [2021-11-02 23:19:41,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:41,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464968354] [2021-11-02 23:19:41,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:41,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:41,584 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-02 23:19:41,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:41,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464968354] [2021-11-02 23:19:41,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464968354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:41,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:41,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 23:19:41,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623558796] [2021-11-02 23:19:41,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 23:19:41,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:41,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 23:19:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:19:41,588 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2021-11-02 23:19:41,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 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-02 23:19:41,590 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:41,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2021-11-02 23:19:41,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:41,803 INFO L129 PetriNetUnfolder]: 17/267 cut-off events. [2021-11-02 23:19:41,803 INFO L130 PetriNetUnfolder]: For 410/948 co-relation queries the response was YES. [2021-11-02 23:19:41,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 267 events. 17/267 cut-off events. For 410/948 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1312 event pairs, 0 based on Foata normal form. 9/271 useless extension candidates. Maximal degree in co-relation 639. Up to 36 conditions per place. [2021-11-02 23:19:41,807 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 11 selfloop transitions, 10 changer transitions 20/115 dead transitions. [2021-11-02 23:19:41,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 115 transitions, 571 flow [2021-11-02 23:19:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:19:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-02 23:19:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 730 transitions. [2021-11-02 23:19:41,811 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8608490566037735 [2021-11-02 23:19:41,812 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 730 transitions. [2021-11-02 23:19:41,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 730 transitions. [2021-11-02 23:19:41,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:41,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 730 transitions. [2021-11-02 23:19:41,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.25) internal successors, (730), 8 states have internal predecessors, (730), 0 states have call successors, (0), 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-02 23:19:41,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 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-02 23:19:41,820 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 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-02 23:19:41,820 INFO L186 Difference]: Start difference. First operand has 129 places, 97 transitions, 329 flow. Second operand 8 states and 730 transitions. [2021-11-02 23:19:41,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 115 transitions, 571 flow [2021-11-02 23:19:41,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 115 transitions, 536 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-11-02 23:19:41,828 INFO L242 Difference]: Finished difference. Result has 123 places, 95 transitions, 326 flow [2021-11-02 23:19:41,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=123, PETRI_TRANSITIONS=95} [2021-11-02 23:19:41,829 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2021-11-02 23:19:41,829 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 95 transitions, 326 flow [2021-11-02 23:19:41,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 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-02 23:19:41,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:41,830 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:19:41,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 23:19:41,831 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1941559543, now seen corresponding path program 1 times [2021-11-02 23:19:41,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:41,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674232362] [2021-11-02 23:19:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:41,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:41,964 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-02 23:19:41,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:41,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674232362] [2021-11-02 23:19:41,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674232362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:41,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:41,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:19:41,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980999280] [2021-11-02 23:19:41,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:19:41,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:19:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:19:41,969 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-11-02 23:19:41,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 95 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 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-02 23:19:41,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:41,970 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-11-02 23:19:41,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:42,349 INFO L129 PetriNetUnfolder]: 486/1212 cut-off events. [2021-11-02 23:19:42,349 INFO L130 PetriNetUnfolder]: For 270/288 co-relation queries the response was YES. [2021-11-02 23:19:42,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 1212 events. 486/1212 cut-off events. For 270/288 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 9183 event pairs, 20 based on Foata normal form. 3/1105 useless extension candidates. Maximal degree in co-relation 2277. Up to 339 conditions per place. [2021-11-02 23:19:42,362 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 21 selfloop transitions, 15 changer transitions 5/125 dead transitions. [2021-11-02 23:19:42,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 125 transitions, 468 flow [2021-11-02 23:19:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 23:19:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-02 23:19:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2021-11-02 23:19:42,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9084905660377358 [2021-11-02 23:19:42,367 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2021-11-02 23:19:42,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2021-11-02 23:19:42,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:42,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2021-11-02 23:19:42,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 0 states have call successors, (0), 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-02 23:19:42,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 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-02 23:19:42,376 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 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-02 23:19:42,376 INFO L186 Difference]: Start difference. First operand has 123 places, 95 transitions, 326 flow. Second operand 10 states and 963 transitions. [2021-11-02 23:19:42,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 125 transitions, 468 flow [2021-11-02 23:19:42,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 436 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-11-02 23:19:42,384 INFO L242 Difference]: Finished difference. Result has 127 places, 108 transitions, 403 flow [2021-11-02 23:19:42,385 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=127, PETRI_TRANSITIONS=108} [2021-11-02 23:19:42,385 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2021-11-02 23:19:42,385 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 108 transitions, 403 flow [2021-11-02 23:19:42,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 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-02 23:19:42,386 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:42,386 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] [2021-11-02 23:19:42,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 23:19:42,387 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash -467758016, now seen corresponding path program 1 times [2021-11-02 23:19:42,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:42,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543052107] [2021-11-02 23:19:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:42,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:42,606 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-02 23:19:42,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:42,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543052107] [2021-11-02 23:19:42,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543052107] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:42,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:42,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:19:42,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984891664] [2021-11-02 23:19:42,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:19:42,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:42,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:19:42,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:19:42,611 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2021-11-02 23:19:42,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 108 transitions, 403 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 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-02 23:19:42,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:42,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2021-11-02 23:19:42,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:42,868 INFO L129 PetriNetUnfolder]: 117/703 cut-off events. [2021-11-02 23:19:42,868 INFO L130 PetriNetUnfolder]: For 581/705 co-relation queries the response was YES. [2021-11-02 23:19:42,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 703 events. 117/703 cut-off events. For 581/705 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5534 event pairs, 48 based on Foata normal form. 26/682 useless extension candidates. Maximal degree in co-relation 1599. Up to 191 conditions per place. [2021-11-02 23:19:42,877 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 12 selfloop transitions, 6 changer transitions 7/112 dead transitions. [2021-11-02 23:19:42,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 112 transitions, 471 flow [2021-11-02 23:19:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 23:19:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-02 23:19:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 634 transitions. [2021-11-02 23:19:42,880 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8544474393530997 [2021-11-02 23:19:42,881 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 634 transitions. [2021-11-02 23:19:42,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 634 transitions. [2021-11-02 23:19:42,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:42,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 634 transitions. [2021-11-02 23:19:42,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 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-02 23:19:42,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 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-02 23:19:42,887 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 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-02 23:19:42,888 INFO L186 Difference]: Start difference. First operand has 127 places, 108 transitions, 403 flow. Second operand 7 states and 634 transitions. [2021-11-02 23:19:42,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 112 transitions, 471 flow [2021-11-02 23:19:42,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 112 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-02 23:19:42,896 INFO L242 Difference]: Finished difference. Result has 136 places, 105 transitions, 400 flow [2021-11-02 23:19:42,896 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=400, PETRI_PLACES=136, PETRI_TRANSITIONS=105} [2021-11-02 23:19:42,897 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2021-11-02 23:19:42,897 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 105 transitions, 400 flow [2021-11-02 23:19:42,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 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-02 23:19:42,898 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:42,898 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] [2021-11-02 23:19:42,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 23:19:42,899 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:42,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 652707800, now seen corresponding path program 2 times [2021-11-02 23:19:42,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:42,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861128261] [2021-11-02 23:19:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:42,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:43,056 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-02 23:19:43,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:43,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861128261] [2021-11-02 23:19:43,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861128261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:43,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:43,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:19:43,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602179387] [2021-11-02 23:19:43,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:19:43,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:43,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:19:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:19:43,061 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-11-02 23:19:43,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 105 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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-02 23:19:43,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:43,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-11-02 23:19:43,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:43,403 INFO L129 PetriNetUnfolder]: 251/705 cut-off events. [2021-11-02 23:19:43,404 INFO L130 PetriNetUnfolder]: For 1626/1924 co-relation queries the response was YES. [2021-11-02 23:19:43,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 705 events. 251/705 cut-off events. For 1626/1924 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4673 event pairs, 4 based on Foata normal form. 69/732 useless extension candidates. Maximal degree in co-relation 2316. Up to 275 conditions per place. [2021-11-02 23:19:43,414 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 20 selfloop transitions, 28 changer transitions 11/140 dead transitions. [2021-11-02 23:19:43,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 140 transitions, 742 flow [2021-11-02 23:19:43,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 23:19:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-02 23:19:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1251 transitions. [2021-11-02 23:19:43,420 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9078374455732946 [2021-11-02 23:19:43,420 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1251 transitions. [2021-11-02 23:19:43,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1251 transitions. [2021-11-02 23:19:43,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:43,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1251 transitions. [2021-11-02 23:19:43,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.23076923076923) internal successors, (1251), 13 states have internal predecessors, (1251), 0 states have call successors, (0), 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-02 23:19:43,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 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-02 23:19:43,432 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 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-02 23:19:43,432 INFO L186 Difference]: Start difference. First operand has 136 places, 105 transitions, 400 flow. Second operand 13 states and 1251 transitions. [2021-11-02 23:19:43,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 140 transitions, 742 flow [2021-11-02 23:19:43,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 140 transitions, 704 flow, removed 6 selfloop flow, removed 10 redundant places. [2021-11-02 23:19:43,441 INFO L242 Difference]: Finished difference. Result has 141 places, 122 transitions, 588 flow [2021-11-02 23:19:43,441 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=588, PETRI_PLACES=141, PETRI_TRANSITIONS=122} [2021-11-02 23:19:43,442 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 30 predicate places. [2021-11-02 23:19:43,442 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 122 transitions, 588 flow [2021-11-02 23:19:43,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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-02 23:19:43,443 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:43,443 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-02 23:19:43,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 23:19:43,444 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1895177497, now seen corresponding path program 1 times [2021-11-02 23:19:43,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:43,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229286744] [2021-11-02 23:19:43,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:43,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:43,610 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-02 23:19:43,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:43,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229286744] [2021-11-02 23:19:43,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229286744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:43,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:43,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 23:19:43,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707600025] [2021-11-02 23:19:43,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 23:19:43,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:43,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 23:19:43,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:19:43,615 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-11-02 23:19:43,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 122 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 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-02 23:19:43,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:43,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-11-02 23:19:43,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:44,008 INFO L129 PetriNetUnfolder]: 170/584 cut-off events. [2021-11-02 23:19:44,008 INFO L130 PetriNetUnfolder]: For 2538/2823 co-relation queries the response was YES. [2021-11-02 23:19:44,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 584 events. 170/584 cut-off events. For 2538/2823 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4035 event pairs, 0 based on Foata normal form. 75/627 useless extension candidates. Maximal degree in co-relation 2375. Up to 196 conditions per place. [2021-11-02 23:19:44,017 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 16 selfloop transitions, 32 changer transitions 19/148 dead transitions. [2021-11-02 23:19:44,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 148 transitions, 904 flow [2021-11-02 23:19:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 23:19:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-02 23:19:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1524 transitions. [2021-11-02 23:19:44,024 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8985849056603774 [2021-11-02 23:19:44,024 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1524 transitions. [2021-11-02 23:19:44,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1524 transitions. [2021-11-02 23:19:44,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:44,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1524 transitions. [2021-11-02 23:19:44,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.25) internal successors, (1524), 16 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:19:44,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 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-02 23:19:44,039 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 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-02 23:19:44,040 INFO L186 Difference]: Start difference. First operand has 141 places, 122 transitions, 588 flow. Second operand 16 states and 1524 transitions. [2021-11-02 23:19:44,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 148 transitions, 904 flow [2021-11-02 23:19:44,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 148 transitions, 819 flow, removed 34 selfloop flow, removed 8 redundant places. [2021-11-02 23:19:44,060 INFO L242 Difference]: Finished difference. Result has 155 places, 123 transitions, 617 flow [2021-11-02 23:19:44,061 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=617, PETRI_PLACES=155, PETRI_TRANSITIONS=123} [2021-11-02 23:19:44,061 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 44 predicate places. [2021-11-02 23:19:44,061 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 123 transitions, 617 flow [2021-11-02 23:19:44,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 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-02 23:19:44,062 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:44,063 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-02 23:19:44,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 23:19:44,063 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1860213728, now seen corresponding path program 1 times [2021-11-02 23:19:44,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:44,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835323903] [2021-11-02 23:19:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:44,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:44,496 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-02 23:19:44,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:44,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835323903] [2021-11-02 23:19:44,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835323903] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:44,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:44,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 23:19:44,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624941674] [2021-11-02 23:19:44,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 23:19:44,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:44,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 23:19:44,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:19:44,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2021-11-02 23:19:44,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 123 transitions, 617 flow. Second operand has 10 states, 10 states have (on average 85.7) internal successors, (857), 10 states have internal predecessors, (857), 0 states have call successors, (0), 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-02 23:19:44,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:44,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2021-11-02 23:19:44,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:44,905 INFO L129 PetriNetUnfolder]: 208/1087 cut-off events. [2021-11-02 23:19:44,905 INFO L130 PetriNetUnfolder]: For 2977/3043 co-relation queries the response was YES. [2021-11-02 23:19:44,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3587 conditions, 1087 events. 208/1087 cut-off events. For 2977/3043 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10574 event pairs, 2 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 3507. Up to 163 conditions per place. [2021-11-02 23:19:44,919 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 16 selfloop transitions, 5 changer transitions 10/136 dead transitions. [2021-11-02 23:19:44,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 136 transitions, 725 flow [2021-11-02 23:19:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 23:19:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-02 23:19:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 785 transitions. [2021-11-02 23:19:44,923 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8228511530398323 [2021-11-02 23:19:44,924 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 785 transitions. [2021-11-02 23:19:44,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 785 transitions. [2021-11-02 23:19:44,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:44,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 785 transitions. [2021-11-02 23:19:44,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 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-02 23:19:44,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 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-02 23:19:44,932 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 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-02 23:19:44,933 INFO L186 Difference]: Start difference. First operand has 155 places, 123 transitions, 617 flow. Second operand 9 states and 785 transitions. [2021-11-02 23:19:44,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 136 transitions, 725 flow [2021-11-02 23:19:45,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 136 transitions, 628 flow, removed 15 selfloop flow, removed 15 redundant places. [2021-11-02 23:19:45,003 INFO L242 Difference]: Finished difference. Result has 151 places, 126 transitions, 569 flow [2021-11-02 23:19:45,004 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=569, PETRI_PLACES=151, PETRI_TRANSITIONS=126} [2021-11-02 23:19:45,004 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 40 predicate places. [2021-11-02 23:19:45,004 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 126 transitions, 569 flow [2021-11-02 23:19:45,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.7) internal successors, (857), 10 states have internal predecessors, (857), 0 states have call successors, (0), 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-02 23:19:45,005 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:45,005 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-02 23:19:45,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 23:19:45,006 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:45,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash -225248134, now seen corresponding path program 2 times [2021-11-02 23:19:45,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:45,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388421973] [2021-11-02 23:19:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:45,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:45,209 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-02 23:19:45,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:45,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388421973] [2021-11-02 23:19:45,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388421973] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:45,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:45,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 23:19:45,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817432820] [2021-11-02 23:19:45,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 23:19:45,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 23:19:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:19:45,214 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2021-11-02 23:19:45,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 126 transitions, 569 flow. Second operand has 8 states, 8 states have (on average 88.875) internal successors, (711), 8 states have internal predecessors, (711), 0 states have call successors, (0), 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-02 23:19:45,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:45,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2021-11-02 23:19:45,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:45,493 INFO L129 PetriNetUnfolder]: 153/877 cut-off events. [2021-11-02 23:19:45,494 INFO L130 PetriNetUnfolder]: For 1221/1223 co-relation queries the response was YES. [2021-11-02 23:19:45,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 877 events. 153/877 cut-off events. For 1221/1223 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7985 event pairs, 3 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 2351. Up to 102 conditions per place. [2021-11-02 23:19:45,506 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 14 selfloop transitions, 2 changer transitions 8/130 dead transitions. [2021-11-02 23:19:45,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 130 transitions, 633 flow [2021-11-02 23:19:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 23:19:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-02 23:19:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 718 transitions. [2021-11-02 23:19:45,511 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8466981132075472 [2021-11-02 23:19:45,511 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 718 transitions. [2021-11-02 23:19:45,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 718 transitions. [2021-11-02 23:19:45,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:45,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 718 transitions. [2021-11-02 23:19:45,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 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-02 23:19:45,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 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-02 23:19:45,519 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 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-02 23:19:45,519 INFO L186 Difference]: Start difference. First operand has 151 places, 126 transitions, 569 flow. Second operand 8 states and 718 transitions. [2021-11-02 23:19:45,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 130 transitions, 633 flow [2021-11-02 23:19:45,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 130 transitions, 609 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-11-02 23:19:45,557 INFO L242 Difference]: Finished difference. Result has 150 places, 122 transitions, 523 flow [2021-11-02 23:19:45,558 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=523, PETRI_PLACES=150, PETRI_TRANSITIONS=122} [2021-11-02 23:19:45,558 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 39 predicate places. [2021-11-02 23:19:45,559 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 122 transitions, 523 flow [2021-11-02 23:19:45,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.875) internal successors, (711), 8 states have internal predecessors, (711), 0 states have call successors, (0), 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-02 23:19:45,560 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:45,560 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-02 23:19:45,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 23:19:45,560 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:45,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:45,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1800969320, now seen corresponding path program 3 times [2021-11-02 23:19:45,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:45,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939473443] [2021-11-02 23:19:45,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:45,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:19:45,899 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-02 23:19:45,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:19:45,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939473443] [2021-11-02 23:19:45,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939473443] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:19:45,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:19:45,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 23:19:45,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011944924] [2021-11-02 23:19:45,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 23:19:45,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:19:45,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 23:19:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:19:45,903 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 106 [2021-11-02 23:19:45,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 122 transitions, 523 flow. Second operand has 10 states, 10 states have (on average 79.4) internal successors, (794), 10 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-02 23:19:45,905 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:19:45,905 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 106 [2021-11-02 23:19:45,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:19:46,332 INFO L129 PetriNetUnfolder]: 94/530 cut-off events. [2021-11-02 23:19:46,334 INFO L130 PetriNetUnfolder]: For 698/700 co-relation queries the response was YES. [2021-11-02 23:19:46,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 530 events. 94/530 cut-off events. For 698/700 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3867 event pairs, 0 based on Foata normal form. 2/509 useless extension candidates. Maximal degree in co-relation 1400. Up to 64 conditions per place. [2021-11-02 23:19:46,341 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 21 selfloop transitions, 6 changer transitions 13/132 dead transitions. [2021-11-02 23:19:46,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 132 transitions, 642 flow [2021-11-02 23:19:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 23:19:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-02 23:19:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 960 transitions. [2021-11-02 23:19:46,345 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2021-11-02 23:19:46,345 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 960 transitions. [2021-11-02 23:19:46,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 960 transitions. [2021-11-02 23:19:46,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:19:46,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 960 transitions. [2021-11-02 23:19:46,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 0 states have call successors, (0), 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-02 23:19:46,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 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-02 23:19:46,358 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 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-02 23:19:46,358 INFO L186 Difference]: Start difference. First operand has 150 places, 122 transitions, 523 flow. Second operand 12 states and 960 transitions. [2021-11-02 23:19:46,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 132 transitions, 642 flow [2021-11-02 23:19:46,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 132 transitions, 598 flow, removed 13 selfloop flow, removed 10 redundant places. [2021-11-02 23:19:46,374 INFO L242 Difference]: Finished difference. Result has 153 places, 118 transitions, 501 flow [2021-11-02 23:19:46,374 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=501, PETRI_PLACES=153, PETRI_TRANSITIONS=118} [2021-11-02 23:19:46,375 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 42 predicate places. [2021-11-02 23:19:46,375 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 118 transitions, 501 flow [2021-11-02 23:19:46,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 79.4) internal successors, (794), 10 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-02 23:19:46,376 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:19:46,376 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-02 23:19:46,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 23:19:46,377 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-02 23:19:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:19:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1620536968, now seen corresponding path program 4 times [2021-11-02 23:19:46,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:19:46,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149159078] [2021-11-02 23:19:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:19:46,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:19:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 23:19:46,460 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 23:19:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 23:19:46,609 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 23:19:46,609 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 23:19:46,610 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:19:46,613 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:19:46,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-02 23:19:46,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-02 23:19:46,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-11-02 23:19:46,615 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:19:46,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 23:19:46,620 INFO L731 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-02 23:19:46,627 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-02 23:19:46,627 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 23:19:46,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:19:46 BasicIcfg [2021-11-02 23:19:46,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 23:19:46,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 23:19:46,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 23:19:46,895 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 23:19:46,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:19:36" (3/4) ... [2021-11-02 23:19:46,899 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-02 23:19:47,100 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 23:19:47,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 23:19:47,102 INFO L168 Benchmark]: Toolchain (without parser) took 13425.81 ms. Allocated memory was 90.2 MB in the beginning and 197.1 MB in the end (delta: 107.0 MB). Free memory was 54.8 MB in the beginning and 116.5 MB in the end (delta: -61.7 MB). Peak memory consumption was 44.9 MB. Max. memory is 16.1 GB. [2021-11-02 23:19:47,102 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 90.2 MB. Free memory was 62.2 MB in the beginning and 62.2 MB in the end (delta: 31.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 23:19:47,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.07 ms. Allocated memory is still 90.2 MB. Free memory was 54.5 MB in the beginning and 53.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-02 23:19:47,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.65 ms. Allocated memory is still 90.2 MB. Free memory was 53.1 MB in the beginning and 50.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:19:47,104 INFO L168 Benchmark]: Boogie Preprocessor took 54.74 ms. Allocated memory is still 90.2 MB. Free memory was 50.6 MB in the beginning and 48.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:19:47,105 INFO L168 Benchmark]: RCFGBuilder took 2374.39 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 48.5 MB in the beginning and 52.2 MB in the end (delta: -3.7 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. [2021-11-02 23:19:47,106 INFO L168 Benchmark]: TraceAbstraction took 9946.43 ms. Allocated memory was 109.1 MB in the beginning and 197.1 MB in the end (delta: 88.1 MB). Free memory was 52.2 MB in the beginning and 153.2 MB in the end (delta: -101.0 MB). Peak memory consumption was 90.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:19:47,106 INFO L168 Benchmark]: Witness Printer took 206.08 ms. Allocated memory is still 197.1 MB. Free memory was 153.2 MB in the beginning and 116.5 MB in the end (delta: 36.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2021-11-02 23:19:47,108 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.35 ms. Allocated memory is still 90.2 MB. Free memory was 62.2 MB in the beginning and 62.2 MB in the end (delta: 31.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 766.07 ms. Allocated memory is still 90.2 MB. Free memory was 54.5 MB in the beginning and 53.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.65 ms. Allocated memory is still 90.2 MB. Free memory was 53.1 MB in the beginning and 50.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.74 ms. Allocated memory is still 90.2 MB. Free memory was 50.6 MB in the beginning and 48.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2374.39 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 48.5 MB in the beginning and 52.2 MB in the end (delta: -3.7 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9946.43 ms. Allocated memory was 109.1 MB in the beginning and 197.1 MB in the end (delta: 88.1 MB). Free memory was 52.2 MB in the beginning and 153.2 MB in the end (delta: -101.0 MB). Peak memory consumption was 90.1 MB. Max. memory is 16.1 GB. * Witness Printer took 206.08 ms. Allocated memory is still 197.1 MB. Free memory was 153.2 MB in the beginning and 116.5 MB in the end (delta: 36.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L831] 0 pthread_t t1897; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L833] 0 pthread_t t1898; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L835] 0 pthread_t t1899; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] 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) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 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 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 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 [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 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) [L753] 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) [L754] 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)) [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 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] 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)) [L754] 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)) [L755] 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)) [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 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] 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)) [L755] 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)) [L756] 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)) [L756] 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) [L756] 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)) [L756] 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)) [L757] 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)) [L757] 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) [L757] 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)) [L757] 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)) [L758] 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)) [L758] 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) [L758] 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)) [L758] 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)) [L759] 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)) [L759] 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) [L759] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 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) [L789] 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) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 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 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 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 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L842] 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) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] 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) [L842] 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) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 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 [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 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 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: 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, 132 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: 9.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 170 SDtfs, 395 SDslu, 638 SDs, 0 SdLazy, 628 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=617occurred in iteration=10, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1048 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 953 ConstructedInterpolants, 0 QuantifiedInterpolants, 4128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-02 23:19:47,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea008dd3-30d9-4d71-9004-0a3cd4ac616a/bin/uautomizer-tBqnrhUYjU/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