./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be --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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:20:04,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:20:04,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:20:04,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:20:04,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:20:04,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:20:04,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:20:04,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:20:04,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:20:04,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:20:04,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:20:04,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:20:04,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:20:04,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:20:04,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:20:04,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:20:04,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:20:04,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:20:04,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:20:04,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:20:04,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:20:04,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:20:04,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:20:04,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:20:04,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:20:04,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:20:04,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:20:04,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:20:04,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:20:04,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:20:04,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:20:04,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:20:04,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:20:04,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:20:04,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:20:04,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:20:04,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:20:04,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:20:04,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:20:04,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:20:04,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:20:04,796 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 19:20:04,848 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:20:04,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:20:04,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:20:04,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:20:04,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:20:04,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:20:04,862 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:20:04,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:20:04,862 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:20:04,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:20:04,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:20:04,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:20:04,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 19:20:04,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:20:04,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 19:20:04,865 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:20:04,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:20:04,866 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:20:04,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 19:20:04,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:20:04,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:20:04,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:20:04,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:20:04,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:20:04,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:20:04,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 19:20:04,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:20:04,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:20:04,868 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 19:20:04,870 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 19:20:04,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 19:20:04,870 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:20:04,871 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_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/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_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be 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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2021-10-21 19:20:05,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:20:05,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:20:05,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:20:05,260 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:20:05,261 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:20:05,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-10-21 19:20:05,355 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/data/c947b44ef/d9225b928aa7438181281a3ec0407ee2/FLAG8a187fe96 [2021-10-21 19:20:06,100 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:20:06,101 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-10-21 19:20:06,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/data/c947b44ef/d9225b928aa7438181281a3ec0407ee2/FLAG8a187fe96 [2021-10-21 19:20:06,345 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/data/c947b44ef/d9225b928aa7438181281a3ec0407ee2 [2021-10-21 19:20:06,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:20:06,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:20:06,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:20:06,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:20:06,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:20:06,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:20:06" (1/1) ... [2021-10-21 19:20:06,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375f72ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:06, skipping insertion in model container [2021-10-21 19:20:06,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:20:06" (1/1) ... [2021-10-21 19:20:06,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:20:06,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:20:06,662 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_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2021-10-21 19:20:06,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:20:06,903 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:20:06,917 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_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2021-10-21 19:20:07,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:20:07,102 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:20:07,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07 WrapperNode [2021-10-21 19:20:07,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:20:07,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:20:07,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:20:07,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:20:07,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:20:07,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:20:07,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:20:07,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:20:07,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:20:07,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:20:07,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:20:07,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:20:07,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (1/1) ... [2021-10-21 19:20:07,352 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:20:07,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:20:07,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:20:07,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:20:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:20:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-21 19:20:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:20:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:20:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-21 19:20:07,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-21 19:20:07,458 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-21 19:20:07,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-21 19:20:07,458 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-21 19:20:07,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-21 19:20:07,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:20:07,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-21 19:20:07,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:20:07,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:20:07,462 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-21 19:20:09,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:20:09,893 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-21 19:20:09,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:20:09 BoogieIcfgContainer [2021-10-21 19:20:09,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:20:09,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:20:09,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:20:09,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:20:09,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:20:06" (1/3) ... [2021-10-21 19:20:09,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f74dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:20:09, skipping insertion in model container [2021-10-21 19:20:09,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:20:07" (2/3) ... [2021-10-21 19:20:09,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f74dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:20:09, skipping insertion in model container [2021-10-21 19:20:09,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:20:09" (3/3) ... [2021-10-21 19:20:09,909 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-10-21 19:20:09,916 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-21 19:20:09,916 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:20:09,916 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-21 19:20:09,917 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-21 19:20:09,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,966 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,966 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,974 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,975 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,975 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,976 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,976 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,983 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,984 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,984 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,984 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:09,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,003 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,003 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,012 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,012 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,013 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-21 19:20:10,052 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-21 19:20:10,117 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:20:10,133 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-10-21 19:20:10,134 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-21 19:20:10,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-10-21 19:20:10,216 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-10-21 19:20:10,217 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 19:20:10,221 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 68. Up to 2 conditions per place. [2021-10-21 19:20:10,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-10-21 19:20:10,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-10-21 19:20:10,245 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-10-21 19:20:10,246 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 19:20:10,246 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:10,247 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] [2021-10-21 19:20:10,247 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash -83043767, now seen corresponding path program 1 times [2021-10-21 19:20:10,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:10,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415110418] [2021-10-21 19:20:10,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:10,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:10,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-10-21 19:20:10,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:10,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415110418] [2021-10-21 19:20:10,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415110418] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:10,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:10,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:20:10,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339171323] [2021-10-21 19:20:10,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:20:10,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:10,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:20:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:20:10,647 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 106 [2021-10-21 19:20:10,652 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-10-21 19:20:10,652 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:10,652 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 106 [2021-10-21 19:20:10,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:10,861 INFO L129 PetriNetUnfolder]: 49/388 cut-off events. [2021-10-21 19:20:10,862 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 19:20:10,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 388 events. 49/388 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1956 event pairs, 27 based on Foata normal form. 18/382 useless extension candidates. Maximal degree in co-relation 437. Up to 65 conditions per place. [2021-10-21 19:20:10,870 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 9 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2021-10-21 19:20:10,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 103 transitions, 237 flow [2021-10-21 19:20:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:20:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-21 19:20:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2021-10-21 19:20:10,888 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2021-10-21 19:20:10,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2021-10-21 19:20:10,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2021-10-21 19:20:10,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:10,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2021-10-21 19:20:10,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-10-21 19:20:10,909 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-10-21 19:20:10,910 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-10-21 19:20:10,913 INFO L186 Difference]: Start difference. First operand has 111 places, 103 transitions, 215 flow. Second operand 3 states and 301 transitions. [2021-10-21 19:20:10,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 103 transitions, 237 flow [2021-10-21 19:20:10,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 103 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-21 19:20:10,924 INFO L242 Difference]: Finished difference. Result has 108 places, 99 transitions, 208 flow [2021-10-21 19:20:10,927 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-10-21 19:20:10,928 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2021-10-21 19:20:10,928 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 208 flow [2021-10-21 19:20:10,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-10-21 19:20:10,929 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:10,929 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] [2021-10-21 19:20:10,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:20:10,930 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:10,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash 907583695, now seen corresponding path program 1 times [2021-10-21 19:20:10,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:10,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123456045] [2021-10-21 19:20:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:10,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:11,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:11,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123456045] [2021-10-21 19:20:11,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123456045] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:11,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:11,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:20:11,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196034424] [2021-10-21 19:20:11,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:20:11,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:11,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:20:11,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:11,292 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-10-21 19:20:11,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 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-10-21 19:20:11,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:11,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-10-21 19:20:11,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:11,471 INFO L129 PetriNetUnfolder]: 4/146 cut-off events. [2021-10-21 19:20:11,471 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-21 19:20:11,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 146 events. 4/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 243 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 140. Up to 8 conditions per place. [2021-10-21 19:20:11,473 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 6 selfloop transitions, 2 changer transitions 23/111 dead transitions. [2021-10-21 19:20:11,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 274 flow [2021-10-21 19:20:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:20:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 19:20:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2021-10-21 19:20:11,486 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2021-10-21 19:20:11,486 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2021-10-21 19:20:11,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2021-10-21 19:20:11,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:11,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2021-10-21 19:20:11,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 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-10-21 19:20:11,511 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-10-21 19:20:11,513 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-10-21 19:20:11,514 INFO L186 Difference]: Start difference. First operand has 108 places, 99 transitions, 208 flow. Second operand 9 states and 869 transitions. [2021-10-21 19:20:11,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 274 flow [2021-10-21 19:20:11,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-21 19:20:11,520 INFO L242 Difference]: Finished difference. Result has 121 places, 88 transitions, 202 flow [2021-10-21 19:20:11,521 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=9, PETRI_FLOW=202, PETRI_PLACES=121, PETRI_TRANSITIONS=88} [2021-10-21 19:20:11,521 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2021-10-21 19:20:11,521 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 88 transitions, 202 flow [2021-10-21 19:20:11,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 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-10-21 19:20:11,522 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:11,522 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] [2021-10-21 19:20:11,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:20:11,523 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash -220260368, now seen corresponding path program 1 times [2021-10-21 19:20:11,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:11,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312557105] [2021-10-21 19:20:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:11,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:11,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:11,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312557105] [2021-10-21 19:20:11,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312557105] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:11,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:11,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:20:11,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319850108] [2021-10-21 19:20:11,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:20:11,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:20:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:11,780 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 106 [2021-10-21 19:20:11,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 88 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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-10-21 19:20:11,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:11,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 106 [2021-10-21 19:20:11,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:12,046 INFO L129 PetriNetUnfolder]: 48/270 cut-off events. [2021-10-21 19:20:12,047 INFO L130 PetriNetUnfolder]: For 63/81 co-relation queries the response was YES. [2021-10-21 19:20:12,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 270 events. 48/270 cut-off events. For 63/81 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1102 event pairs, 6 based on Foata normal form. 6/269 useless extension candidates. Maximal degree in co-relation 422. Up to 53 conditions per place. [2021-10-21 19:20:12,054 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 12 selfloop transitions, 3 changer transitions 25/117 dead transitions. [2021-10-21 19:20:12,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 117 transitions, 361 flow [2021-10-21 19:20:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:20:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 19:20:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 861 transitions. [2021-10-21 19:20:12,060 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9025157232704403 [2021-10-21 19:20:12,061 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 861 transitions. [2021-10-21 19:20:12,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 861 transitions. [2021-10-21 19:20:12,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:12,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 861 transitions. [2021-10-21 19:20:12,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 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-10-21 19:20:12,071 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-10-21 19:20:12,073 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-10-21 19:20:12,073 INFO L186 Difference]: Start difference. First operand has 121 places, 88 transitions, 202 flow. Second operand 9 states and 861 transitions. [2021-10-21 19:20:12,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 117 transitions, 361 flow [2021-10-21 19:20:12,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 327 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-10-21 19:20:12,089 INFO L242 Difference]: Finished difference. Result has 111 places, 90 transitions, 229 flow [2021-10-21 19:20:12,090 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=229, PETRI_PLACES=111, PETRI_TRANSITIONS=90} [2021-10-21 19:20:12,090 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2021-10-21 19:20:12,090 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 90 transitions, 229 flow [2021-10-21 19:20:12,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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-10-21 19:20:12,091 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:12,092 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:12,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:20:12,092 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2105890403, now seen corresponding path program 1 times [2021-10-21 19:20:12,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:12,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361499057] [2021-10-21 19:20:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:12,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:12,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:12,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361499057] [2021-10-21 19:20:12,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361499057] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:12,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:12,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:20:12,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230262657] [2021-10-21 19:20:12,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:20:12,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:20:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:12,408 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 106 [2021-10-21 19:20:12,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 90 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:20:12,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:12,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 106 [2021-10-21 19:20:12,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:12,622 INFO L129 PetriNetUnfolder]: 19/209 cut-off events. [2021-10-21 19:20:12,622 INFO L130 PetriNetUnfolder]: For 132/211 co-relation queries the response was YES. [2021-10-21 19:20:12,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 209 events. 19/209 cut-off events. For 132/211 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 683 event pairs, 3 based on Foata normal form. 4/207 useless extension candidates. Maximal degree in co-relation 372. Up to 25 conditions per place. [2021-10-21 19:20:12,625 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 16 selfloop transitions, 3 changer transitions 13/109 dead transitions. [2021-10-21 19:20:12,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 388 flow [2021-10-21 19:20:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:20:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 19:20:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 852 transitions. [2021-10-21 19:20:12,629 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8930817610062893 [2021-10-21 19:20:12,629 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 852 transitions. [2021-10-21 19:20:12,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 852 transitions. [2021-10-21 19:20:12,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:12,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 852 transitions. [2021-10-21 19:20:12,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.66666666666667) internal successors, (852), 9 states have internal predecessors, (852), 0 states have call successors, (0), 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-10-21 19:20:12,638 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-10-21 19:20:12,639 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-10-21 19:20:12,639 INFO L186 Difference]: Start difference. First operand has 111 places, 90 transitions, 229 flow. Second operand 9 states and 852 transitions. [2021-10-21 19:20:12,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 388 flow [2021-10-21 19:20:12,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 357 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-10-21 19:20:12,646 INFO L242 Difference]: Finished difference. Result has 116 places, 90 transitions, 241 flow [2021-10-21 19:20:12,646 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=241, PETRI_PLACES=116, PETRI_TRANSITIONS=90} [2021-10-21 19:20:12,647 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2021-10-21 19:20:12,647 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 90 transitions, 241 flow [2021-10-21 19:20:12,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:20:12,648 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:12,648 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:12,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:20:12,648 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1409392181, now seen corresponding path program 1 times [2021-10-21 19:20:12,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:12,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493432326] [2021-10-21 19:20:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:12,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:12,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:12,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493432326] [2021-10-21 19:20:12,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493432326] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:12,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:12,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:20:12,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362625515] [2021-10-21 19:20:12,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:20:12,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:12,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:20:12,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:20:12,890 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-10-21 19:20:12,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 90 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 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-10-21 19:20:12,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:12,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-10-21 19:20:12,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:13,059 INFO L129 PetriNetUnfolder]: 11/173 cut-off events. [2021-10-21 19:20:13,060 INFO L130 PetriNetUnfolder]: For 199/323 co-relation queries the response was YES. [2021-10-21 19:20:13,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 173 events. 11/173 cut-off events. For 199/323 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 537 event pairs, 1 based on Foata normal form. 4/173 useless extension candidates. Maximal degree in co-relation 327. Up to 20 conditions per place. [2021-10-21 19:20:13,062 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 10 selfloop transitions, 4 changer transitions 11/101 dead transitions. [2021-10-21 19:20:13,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 101 transitions, 375 flow [2021-10-21 19:20:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:20:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-21 19:20:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 656 transitions. [2021-10-21 19:20:13,066 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8840970350404312 [2021-10-21 19:20:13,067 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 656 transitions. [2021-10-21 19:20:13,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 656 transitions. [2021-10-21 19:20:13,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:13,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 656 transitions. [2021-10-21 19:20:13,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 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-10-21 19:20:13,073 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-10-21 19:20:13,076 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-10-21 19:20:13,077 INFO L186 Difference]: Start difference. First operand has 116 places, 90 transitions, 241 flow. Second operand 7 states and 656 transitions. [2021-10-21 19:20:13,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 101 transitions, 375 flow [2021-10-21 19:20:13,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 101 transitions, 328 flow, removed 20 selfloop flow, removed 7 redundant places. [2021-10-21 19:20:13,094 INFO L242 Difference]: Finished difference. Result has 113 places, 88 transitions, 224 flow [2021-10-21 19:20:13,095 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=113, PETRI_TRANSITIONS=88} [2021-10-21 19:20:13,095 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 2 predicate places. [2021-10-21 19:20:13,095 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 88 transitions, 224 flow [2021-10-21 19:20:13,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 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-10-21 19:20:13,095 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:13,096 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:13,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:20:13,096 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:13,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:13,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1283337912, now seen corresponding path program 1 times [2021-10-21 19:20:13,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:13,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687980440] [2021-10-21 19:20:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:13,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:13,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:13,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687980440] [2021-10-21 19:20:13,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687980440] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:13,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:13,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:20:13,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400233707] [2021-10-21 19:20:13,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:20:13,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:13,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:20:13,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:20:13,386 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-10-21 19:20:13,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 88 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 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-10-21 19:20:13,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:13,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-10-21 19:20:13,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:13,540 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-10-21 19:20:13,541 INFO L130 PetriNetUnfolder]: For 64/124 co-relation queries the response was YES. [2021-10-21 19:20:13,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 117 events. 2/117 cut-off events. For 64/124 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 193 event pairs, 0 based on Foata normal form. 3/118 useless extension candidates. Maximal degree in co-relation 183. Up to 11 conditions per place. [2021-10-21 19:20:13,542 INFO L132 encePairwiseOnDemand]: 98/106 looper letters, 10 selfloop transitions, 4 changer transitions 5/95 dead transitions. [2021-10-21 19:20:13,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 95 transitions, 298 flow [2021-10-21 19:20:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:20:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-21 19:20:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 650 transitions. [2021-10-21 19:20:13,547 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.876010781671159 [2021-10-21 19:20:13,547 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 650 transitions. [2021-10-21 19:20:13,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 650 transitions. [2021-10-21 19:20:13,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:13,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 650 transitions. [2021-10-21 19:20:13,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 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-10-21 19:20:13,554 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-10-21 19:20:13,555 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-10-21 19:20:13,555 INFO L186 Difference]: Start difference. First operand has 113 places, 88 transitions, 224 flow. Second operand 7 states and 650 transitions. [2021-10-21 19:20:13,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 95 transitions, 298 flow [2021-10-21 19:20:13,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 95 transitions, 268 flow, removed 10 selfloop flow, removed 10 redundant places. [2021-10-21 19:20:13,560 INFO L242 Difference]: Finished difference. Result has 110 places, 88 transitions, 224 flow [2021-10-21 19:20:13,560 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2021-10-21 19:20:13,561 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -1 predicate places. [2021-10-21 19:20:13,561 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 224 flow [2021-10-21 19:20:13,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 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-10-21 19:20:13,562 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:13,562 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:13,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:20:13,563 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:13,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1300174262, now seen corresponding path program 2 times [2021-10-21 19:20:13,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:13,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843097129] [2021-10-21 19:20:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:13,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:13,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:13,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843097129] [2021-10-21 19:20:13,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843097129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:13,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:13,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:20:13,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451248694] [2021-10-21 19:20:13,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:20:13,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:13,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:20:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:20:13,762 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-10-21 19:20:13,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 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-10-21 19:20:13,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:13,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-10-21 19:20:13,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:13,935 INFO L129 PetriNetUnfolder]: 1/110 cut-off events. [2021-10-21 19:20:13,935 INFO L130 PetriNetUnfolder]: For 58/97 co-relation queries the response was YES. [2021-10-21 19:20:13,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 110 events. 1/110 cut-off events. For 58/97 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 158 event pairs, 0 based on Foata normal form. 4/114 useless extension candidates. Maximal degree in co-relation 168. Up to 11 conditions per place. [2021-10-21 19:20:13,936 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 10 selfloop transitions, 2 changer transitions 7/95 dead transitions. [2021-10-21 19:20:13,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 95 transitions, 297 flow [2021-10-21 19:20:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:20:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-10-21 19:20:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 740 transitions. [2021-10-21 19:20:13,940 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8726415094339622 [2021-10-21 19:20:13,941 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 740 transitions. [2021-10-21 19:20:13,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 740 transitions. [2021-10-21 19:20:13,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:13,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 740 transitions. [2021-10-21 19:20:13,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.5) internal successors, (740), 8 states have internal predecessors, (740), 0 states have call successors, (0), 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-10-21 19:20:13,948 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-10-21 19:20:13,949 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-10-21 19:20:13,949 INFO L186 Difference]: Start difference. First operand has 110 places, 88 transitions, 224 flow. Second operand 8 states and 740 transitions. [2021-10-21 19:20:13,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 95 transitions, 297 flow [2021-10-21 19:20:13,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 95 transitions, 267 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-10-21 19:20:13,953 INFO L242 Difference]: Finished difference. Result has 112 places, 88 transitions, 220 flow [2021-10-21 19:20:13,953 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=112, PETRI_TRANSITIONS=88} [2021-10-21 19:20:13,954 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2021-10-21 19:20:13,954 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 220 flow [2021-10-21 19:20:13,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 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-10-21 19:20:13,954 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:13,955 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:13,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:20:13,955 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:13,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:13,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1729621578, now seen corresponding path program 3 times [2021-10-21 19:20:13,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:13,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612558124] [2021-10-21 19:20:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:13,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:14,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:14,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612558124] [2021-10-21 19:20:14,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612558124] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:14,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:14,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:20:14,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474971316] [2021-10-21 19:20:14,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:20:14,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:14,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:20:14,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:20:14,313 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2021-10-21 19:20:14,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 88 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 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-10-21 19:20:14,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:14,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2021-10-21 19:20:14,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:14,739 INFO L129 PetriNetUnfolder]: 184/487 cut-off events. [2021-10-21 19:20:14,739 INFO L130 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2021-10-21 19:20:14,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 487 events. 184/487 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2164 event pairs, 66 based on Foata normal form. 12/495 useless extension candidates. Maximal degree in co-relation 887. Up to 193 conditions per place. [2021-10-21 19:20:14,777 INFO L132 encePairwiseOnDemand]: 94/106 looper letters, 13 selfloop transitions, 8 changer transitions 28/121 dead transitions. [2021-10-21 19:20:14,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 121 transitions, 400 flow [2021-10-21 19:20:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:20:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-21 19:20:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1071 transitions. [2021-10-21 19:20:14,787 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8419811320754716 [2021-10-21 19:20:14,787 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1071 transitions. [2021-10-21 19:20:14,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1071 transitions. [2021-10-21 19:20:14,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:14,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1071 transitions. [2021-10-21 19:20:14,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.25) internal successors, (1071), 12 states have internal predecessors, (1071), 0 states have call successors, (0), 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-10-21 19:20:14,798 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-10-21 19:20:14,799 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-10-21 19:20:14,800 INFO L186 Difference]: Start difference. First operand has 112 places, 88 transitions, 220 flow. Second operand 12 states and 1071 transitions. [2021-10-21 19:20:14,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 121 transitions, 400 flow [2021-10-21 19:20:14,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 121 transitions, 364 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-10-21 19:20:14,807 INFO L242 Difference]: Finished difference. Result has 117 places, 91 transitions, 264 flow [2021-10-21 19:20:14,807 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=264, PETRI_PLACES=117, PETRI_TRANSITIONS=91} [2021-10-21 19:20:14,808 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places. [2021-10-21 19:20:14,808 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 91 transitions, 264 flow [2021-10-21 19:20:14,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 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-10-21 19:20:14,809 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:14,809 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-10-21 19:20:14,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:20:14,810 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash 320122464, now seen corresponding path program 1 times [2021-10-21 19:20:14,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:14,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697116935] [2021-10-21 19:20:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:14,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:15,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:15,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697116935] [2021-10-21 19:20:15,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697116935] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:15,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:15,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:20:15,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650438925] [2021-10-21 19:20:15,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:20:15,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:20:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:20:15,030 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-21 19:20:15,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 91 transitions, 264 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-10-21 19:20:15,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:15,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-21 19:20:15,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:15,294 INFO L129 PetriNetUnfolder]: 210/678 cut-off events. [2021-10-21 19:20:15,294 INFO L130 PetriNetUnfolder]: For 455/455 co-relation queries the response was YES. [2021-10-21 19:20:15,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 678 events. 210/678 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4108 event pairs, 74 based on Foata normal form. 14/661 useless extension candidates. Maximal degree in co-relation 1356. Up to 137 conditions per place. [2021-10-21 19:20:15,307 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 19 selfloop transitions, 16 changer transitions 0/116 dead transitions. [2021-10-21 19:20:15,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 384 flow [2021-10-21 19:20:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:20:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-21 19:20:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 865 transitions. [2021-10-21 19:20:15,312 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9067085953878407 [2021-10-21 19:20:15,312 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 865 transitions. [2021-10-21 19:20:15,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 865 transitions. [2021-10-21 19:20:15,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:15,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 865 transitions. [2021-10-21 19:20:15,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.11111111111111) internal successors, (865), 9 states have internal predecessors, (865), 0 states have call successors, (0), 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-10-21 19:20:15,320 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-10-21 19:20:15,321 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-10-21 19:20:15,321 INFO L186 Difference]: Start difference. First operand has 117 places, 91 transitions, 264 flow. Second operand 9 states and 865 transitions. [2021-10-21 19:20:15,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 384 flow [2021-10-21 19:20:15,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 116 transitions, 368 flow, removed 3 selfloop flow, removed 7 redundant places. [2021-10-21 19:20:15,327 INFO L242 Difference]: Finished difference. Result has 117 places, 105 transitions, 359 flow [2021-10-21 19:20:15,328 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2021-10-21 19:20:15,328 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places. [2021-10-21 19:20:15,328 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 359 flow [2021-10-21 19:20:15,329 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-10-21 19:20:15,329 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:15,329 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] [2021-10-21 19:20:15,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:20:15,330 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash 589292275, now seen corresponding path program 1 times [2021-10-21 19:20:15,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:15,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595258723] [2021-10-21 19:20:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:15,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:15,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:15,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595258723] [2021-10-21 19:20:15,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595258723] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:15,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:15,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:20:15,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169671135] [2021-10-21 19:20:15,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:20:15,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:15,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:20:15,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:20:15,497 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-21 19:20:15,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 359 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-10-21 19:20:15,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:15,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-21 19:20:15,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:15,805 INFO L129 PetriNetUnfolder]: 153/584 cut-off events. [2021-10-21 19:20:15,806 INFO L130 PetriNetUnfolder]: For 905/1244 co-relation queries the response was YES. [2021-10-21 19:20:15,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 584 events. 153/584 cut-off events. For 905/1244 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3624 event pairs, 9 based on Foata normal form. 84/640 useless extension candidates. Maximal degree in co-relation 1553. Up to 149 conditions per place. [2021-10-21 19:20:15,815 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 15 selfloop transitions, 31 changer transitions 6/133 dead transitions. [2021-10-21 19:20:15,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 133 transitions, 644 flow [2021-10-21 19:20:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:20:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-21 19:20:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1154 transitions. [2021-10-21 19:20:15,821 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9072327044025157 [2021-10-21 19:20:15,821 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1154 transitions. [2021-10-21 19:20:15,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1154 transitions. [2021-10-21 19:20:15,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:15,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1154 transitions. [2021-10-21 19:20:15,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.16666666666667) internal successors, (1154), 12 states have internal predecessors, (1154), 0 states have call successors, (0), 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-10-21 19:20:15,832 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-10-21 19:20:15,833 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-10-21 19:20:15,833 INFO L186 Difference]: Start difference. First operand has 117 places, 105 transitions, 359 flow. Second operand 12 states and 1154 transitions. [2021-10-21 19:20:15,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 133 transitions, 644 flow [2021-10-21 19:20:15,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 133 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-21 19:20:15,842 INFO L242 Difference]: Finished difference. Result has 130 places, 124 transitions, 587 flow [2021-10-21 19:20:15,842 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=587, PETRI_PLACES=130, PETRI_TRANSITIONS=124} [2021-10-21 19:20:15,843 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 19 predicate places. [2021-10-21 19:20:15,843 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 124 transitions, 587 flow [2021-10-21 19:20:15,844 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-10-21 19:20:15,844 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:15,844 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:20:15,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:20:15,845 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:15,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:15,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1477841066, now seen corresponding path program 1 times [2021-10-21 19:20:15,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:15,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337561102] [2021-10-21 19:20:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:15,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:16,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:16,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337561102] [2021-10-21 19:20:16,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337561102] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:16,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:16,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:20:16,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371767285] [2021-10-21 19:20:16,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:20:16,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:16,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:20:16,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:20:16,020 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-21 19:20:16,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 124 transitions, 587 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-10-21 19:20:16,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:16,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-21 19:20:16,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:16,375 INFO L129 PetriNetUnfolder]: 118/507 cut-off events. [2021-10-21 19:20:16,376 INFO L130 PetriNetUnfolder]: For 1307/1623 co-relation queries the response was YES. [2021-10-21 19:20:16,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 507 events. 118/507 cut-off events. For 1307/1623 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3293 event pairs, 1 based on Foata normal form. 78/558 useless extension candidates. Maximal degree in co-relation 1567. Up to 127 conditions per place. [2021-10-21 19:20:16,384 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 10 selfloop transitions, 36 changer transitions 16/143 dead transitions. [2021-10-21 19:20:16,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 143 transitions, 841 flow [2021-10-21 19:20:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:20:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-21 19:20:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1431 transitions. [2021-10-21 19:20:16,392 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-10-21 19:20:16,392 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1431 transitions. [2021-10-21 19:20:16,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1431 transitions. [2021-10-21 19:20:16,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:16,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1431 transitions. [2021-10-21 19:20:16,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.4) internal successors, (1431), 15 states have internal predecessors, (1431), 0 states have call successors, (0), 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-10-21 19:20:16,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 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-10-21 19:20:16,407 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 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-10-21 19:20:16,407 INFO L186 Difference]: Start difference. First operand has 130 places, 124 transitions, 587 flow. Second operand 15 states and 1431 transitions. [2021-10-21 19:20:16,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 143 transitions, 841 flow [2021-10-21 19:20:16,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 143 transitions, 683 flow, removed 65 selfloop flow, removed 7 redundant places. [2021-10-21 19:20:16,424 INFO L242 Difference]: Finished difference. Result has 143 places, 124 transitions, 573 flow [2021-10-21 19:20:16,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=573, PETRI_PLACES=143, PETRI_TRANSITIONS=124} [2021-10-21 19:20:16,425 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 32 predicate places. [2021-10-21 19:20:16,426 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 124 transitions, 573 flow [2021-10-21 19:20:16,426 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-10-21 19:20:16,426 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:16,427 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-10-21 19:20:16,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:20:16,427 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1692684556, now seen corresponding path program 1 times [2021-10-21 19:20:16,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:16,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095037019] [2021-10-21 19:20:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:16,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:20:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:20:16,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:20:16,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095037019] [2021-10-21 19:20:16,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095037019] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:20:16,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:20:16,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:20:16,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949126411] [2021-10-21 19:20:16,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:20:16,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:20:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:20:16,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:20:16,968 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2021-10-21 19:20:16,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 124 transitions, 573 flow. Second operand has 14 states, 14 states have (on average 81.5) internal successors, (1141), 14 states have internal predecessors, (1141), 0 states have call successors, (0), 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-10-21 19:20:16,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-21 19:20:16,970 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2021-10-21 19:20:16,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-21 19:20:17,417 INFO L129 PetriNetUnfolder]: 142/644 cut-off events. [2021-10-21 19:20:17,418 INFO L130 PetriNetUnfolder]: For 1102/1137 co-relation queries the response was YES. [2021-10-21 19:20:17,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 644 events. 142/644 cut-off events. For 1102/1137 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4851 event pairs, 0 based on Foata normal form. 4/627 useless extension candidates. Maximal degree in co-relation 1706. Up to 72 conditions per place. [2021-10-21 19:20:17,426 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 20 selfloop transitions, 5 changer transitions 9/134 dead transitions. [2021-10-21 19:20:17,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 134 transitions, 685 flow [2021-10-21 19:20:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:20:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-21 19:20:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 912 transitions. [2021-10-21 19:20:17,432 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7821612349914236 [2021-10-21 19:20:17,432 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 912 transitions. [2021-10-21 19:20:17,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 912 transitions. [2021-10-21 19:20:17,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:20:17,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 912 transitions. [2021-10-21 19:20:17,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 82.9090909090909) internal successors, (912), 11 states have internal predecessors, (912), 0 states have call successors, (0), 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-10-21 19:20:17,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 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-10-21 19:20:17,442 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 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-10-21 19:20:17,442 INFO L186 Difference]: Start difference. First operand has 143 places, 124 transitions, 573 flow. Second operand 11 states and 912 transitions. [2021-10-21 19:20:17,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 134 transitions, 685 flow [2021-10-21 19:20:17,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 592 flow, removed 22 selfloop flow, removed 14 redundant places. [2021-10-21 19:20:17,469 INFO L242 Difference]: Finished difference. Result has 142 places, 123 transitions, 515 flow [2021-10-21 19:20:17,469 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=515, PETRI_PLACES=142, PETRI_TRANSITIONS=123} [2021-10-21 19:20:17,470 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 31 predicate places. [2021-10-21 19:20:17,470 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 123 transitions, 515 flow [2021-10-21 19:20:17,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.5) internal successors, (1141), 14 states have internal predecessors, (1141), 0 states have call successors, (0), 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-10-21 19:20:17,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-21 19:20:17,472 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-10-21 19:20:17,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:20:17,472 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-21 19:20:17,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:20:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1003966024, now seen corresponding path program 2 times [2021-10-21 19:20:17,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:20:17,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145202944] [2021-10-21 19:20:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:20:17,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:20:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:20:17,551 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:20:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:20:17,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:20:17,737 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 19:20:17,738 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:20:17,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:20:17,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-21 19:20:17,741 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-21 19:20:17,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-21 19:20:17,742 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:20:17,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:20:17,756 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-21 19:20:17,756 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:20:18,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:20:18 BasicIcfg [2021-10-21 19:20:18,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:20:18,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:20:18,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:20:18,004 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:20:18,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:20:09" (3/4) ... [2021-10-21 19:20:18,009 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 19:20:18,209 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:20:18,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:20:18,211 INFO L168 Benchmark]: Toolchain (without parser) took 11860.11 ms. Allocated memory was 86.0 MB in the beginning and 186.6 MB in the end (delta: 100.7 MB). Free memory was 48.2 MB in the beginning and 72.0 MB in the end (delta: -23.7 MB). Peak memory consumption was 76.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:20:18,212 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 86.0 MB. Free memory was 65.9 MB in the beginning and 65.8 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:20:18,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.85 ms. Allocated memory was 86.0 MB in the beginning and 109.1 MB in the end (delta: 23.1 MB). Free memory was 48.0 MB in the beginning and 71.8 MB in the end (delta: -23.7 MB). Peak memory consumption was 4.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:20:18,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.86 ms. Allocated memory is still 109.1 MB. Free memory was 71.8 MB in the beginning and 69.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:20:18,214 INFO L168 Benchmark]: Boogie Preprocessor took 107.69 ms. Allocated memory is still 109.1 MB. Free memory was 69.1 MB in the beginning and 66.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:20:18,215 INFO L168 Benchmark]: RCFGBuilder took 2555.08 ms. Allocated memory is still 109.1 MB. Free memory was 66.5 MB in the beginning and 45.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 33.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:20:18,217 INFO L168 Benchmark]: TraceAbstraction took 8103.00 ms. Allocated memory was 109.1 MB in the beginning and 186.6 MB in the end (delta: 77.6 MB). Free memory was 44.8 MB in the beginning and 101.3 MB in the end (delta: -56.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:20:18,217 INFO L168 Benchmark]: Witness Printer took 205.70 ms. Allocated memory is still 186.6 MB. Free memory was 101.3 MB in the beginning and 72.0 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:20:18,220 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.28 ms. Allocated memory is still 86.0 MB. Free memory was 65.9 MB in the beginning and 65.8 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 751.85 ms. Allocated memory was 86.0 MB in the beginning and 109.1 MB in the end (delta: 23.1 MB). Free memory was 48.0 MB in the beginning and 71.8 MB in the end (delta: -23.7 MB). Peak memory consumption was 4.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 127.86 ms. Allocated memory is still 109.1 MB. Free memory was 71.8 MB in the beginning and 69.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 107.69 ms. Allocated memory is still 109.1 MB. Free memory was 69.1 MB in the beginning and 66.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2555.08 ms. Allocated memory is still 109.1 MB. Free memory was 66.5 MB in the beginning and 45.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 33.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8103.00 ms. Allocated memory was 109.1 MB in the beginning and 186.6 MB in the end (delta: 77.6 MB). Free memory was 44.8 MB in the beginning and 101.3 MB in the end (delta: -56.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.1 GB. * Witness Printer took 205.70 ms. Allocated memory is still 186.6 MB. Free memory was 101.3 MB in the beginning and 72.0 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1804; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L820] 0 pthread_t t1805; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1806; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L796] 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) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] 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) [L796] 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) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 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 [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 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) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] 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) [L829] 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) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 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 [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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: 819]: 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: 823]: 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: 821]: 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, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 17.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7639.8ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3724.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 94.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 109 SDtfs, 280 SDslu, 360 SDs, 0 SdLazy, 565 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 797.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1518.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=587occurred in iteration=10, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 89.4ms SsaConstructionTime, 956.1ms SatisfiabilityAnalysisTime, 2190.3ms InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 3295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-10-21 19:20:18,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d25e155f-6ab3-43c7-bba2-4b2190c1ef6b/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...