./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX --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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:49:13,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:49:13,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:49:13,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:49:13,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:49:13,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:49:13,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:49:13,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:49:13,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:49:14,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:49:14,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:49:14,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:49:14,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:49:14,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:49:14,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:49:14,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:49:14,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:49:14,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:49:14,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:49:14,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:49:14,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:49:14,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:49:14,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:49:14,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:49:14,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:49:14,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:49:14,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:49:14,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:49:14,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:49:14,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:49:14,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:49:14,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:49:14,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:49:14,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:49:14,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:49:14,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:49:14,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:49:14,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:49:14,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:49:14,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:49:14,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:49:14,077 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 09:49:14,127 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:49:14,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:49:14,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:49:14,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:49:14,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:49:14,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:49:14,133 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:49:14,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:49:14,134 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:49:14,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:49:14,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:49:14,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:49:14,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:49:14,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:49:14,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:49:14,135 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:49:14,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:49:14,135 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:49:14,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:49:14,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:49:14,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:49:14,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:49:14,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:49:14,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:49:14,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:49:14,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:49:14,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:49:14,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 09:49:14,137 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:49:14,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:49:14,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:49:14,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:49:14,137 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_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/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_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2021-11-09 09:49:14,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:49:14,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:49:14,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:49:14,529 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:49:14,529 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:49:14,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-11-09 09:49:14,604 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/data/6a62aaa4e/18b73d73b98a44ecba2f9929c97045fb/FLAG72109a975 [2021-11-09 09:49:15,281 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:49:15,282 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-11-09 09:49:15,311 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/data/6a62aaa4e/18b73d73b98a44ecba2f9929c97045fb/FLAG72109a975 [2021-11-09 09:49:15,533 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/data/6a62aaa4e/18b73d73b98a44ecba2f9929c97045fb [2021-11-09 09:49:15,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:49:15,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:49:15,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:49:15,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:49:15,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:49:15,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:49:15" (1/1) ... [2021-11-09 09:49:15,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22844b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:15, skipping insertion in model container [2021-11-09 09:49:15,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:49:15" (1/1) ... [2021-11-09 09:49:15,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:49:15,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:49:15,896 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_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-11-09 09:49:16,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:49:16,176 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:49:16,191 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_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-11-09 09:49:16,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:49:16,320 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:49:16,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16 WrapperNode [2021-11-09 09:49:16,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:49:16,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:49:16,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:49:16,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:49:16,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:49:16,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:49:16,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:49:16,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:49:16,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:49:16,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:49:16,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:49:16,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:49:16,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (1/1) ... [2021-11-09 09:49:16,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:49:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:49:16,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:49:16,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:49:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 09:49:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-09 09:49:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:49:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 09:49:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-09 09:49:16,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-09 09:49:16,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-09 09:49:16,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-09 09:49:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:49:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-09 09:49:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:49:16,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:49:16,658 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-09 09:49:18,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:49:18,837 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-09 09:49:18,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:49:18 BoogieIcfgContainer [2021-11-09 09:49:18,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:49:18,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:49:18,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:49:18,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:49:18,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:49:15" (1/3) ... [2021-11-09 09:49:18,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13422ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:49:18, skipping insertion in model container [2021-11-09 09:49:18,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:49:16" (2/3) ... [2021-11-09 09:49:18,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13422ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:49:18, skipping insertion in model container [2021-11-09 09:49:18,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:49:18" (3/3) ... [2021-11-09 09:49:18,852 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-11-09 09:49:18,858 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-09 09:49:18,858 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:49:18,859 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-09 09:49:18,859 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-09 09:49:18,905 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,905 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,905 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,905 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,906 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,906 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,906 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,906 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,906 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,907 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,907 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,907 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,908 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,908 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,909 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,909 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,910 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,910 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,911 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,911 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,912 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,912 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,912 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,912 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,913 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,913 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,914 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,915 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,916 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,916 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,917 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,917 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,917 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,917 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,917 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,918 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,918 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,918 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,918 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,918 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,919 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,919 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,919 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,919 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,919 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,920 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,921 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,929 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,929 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,929 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,930 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,931 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,931 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,933 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,933 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,934 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,934 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,934 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,934 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,935 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,935 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,935 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,936 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,936 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,936 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:49:18,938 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-09 09:49:19,007 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:49:19,024 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 09:49:19,024 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-09 09:49:19,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-11-09 09:49:19,101 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-11-09 09:49:19,102 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:49:19,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-11-09 09:49:19,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 85 transitions, 180 flow [2021-11-09 09:49:19,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 83 transitions, 172 flow [2021-11-09 09:49:19,135 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-11-09 09:49:19,136 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:49:19,136 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:19,137 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] [2021-11-09 09:49:19,138 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1706053472, now seen corresponding path program 1 times [2021-11-09 09:49:19,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:19,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426542656] [2021-11-09 09:49:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:19,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:19,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:19,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426542656] [2021-11-09 09:49:19,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426542656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:19,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:19,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:49:19,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348901116] [2021-11-09 09:49:19,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:49:19,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:19,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:49:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:49:19,465 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 85 [2021-11-09 09:49:19,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:19,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:19,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 85 [2021-11-09 09:49:19,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:19,623 INFO L129 PetriNetUnfolder]: 16/190 cut-off events. [2021-11-09 09:49:19,623 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:49:19,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 190 events. 16/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 640 event pairs, 11 based on Foata normal form. 9/188 useless extension candidates. Maximal degree in co-relation 190. Up to 27 conditions per place. [2021-11-09 09:49:19,627 INFO L132 encePairwiseOnDemand]: 80/85 looper letters, 7 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2021-11-09 09:49:19,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 188 flow [2021-11-09 09:49:19,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:49:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-09 09:49:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2021-11-09 09:49:19,647 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2021-11-09 09:49:19,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2021-11-09 09:49:19,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2021-11-09 09:49:19,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:19,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2021-11-09 09:49:19,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:19,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:19,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:19,675 INFO L186 Difference]: Start difference. First operand has 88 places, 83 transitions, 172 flow. Second operand 3 states and 239 transitions. [2021-11-09 09:49:19,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 188 flow [2021-11-09 09:49:19,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-09 09:49:19,689 INFO L242 Difference]: Finished difference. Result has 86 places, 79 transitions, 166 flow [2021-11-09 09:49:19,692 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2021-11-09 09:49:19,693 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, -2 predicate places. [2021-11-09 09:49:19,694 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 166 flow [2021-11-09 09:49:19,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:19,695 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:19,695 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] [2021-11-09 09:49:19,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 09:49:19,697 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2072796695, now seen corresponding path program 1 times [2021-11-09 09:49:19,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:19,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013927981] [2021-11-09 09:49:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:19,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:20,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:20,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013927981] [2021-11-09 09:49:20,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013927981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:20,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:20,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:49:20,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755455855] [2021-11-09 09:49:20,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:49:20,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:49:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:49:20,106 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-11-09 09:49:20,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:20,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:20,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-11-09 09:49:20,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:20,371 INFO L129 PetriNetUnfolder]: 30/238 cut-off events. [2021-11-09 09:49:20,372 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:49:20,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 238 events. 30/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1009 event pairs, 6 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 277. Up to 36 conditions per place. [2021-11-09 09:49:20,379 INFO L132 encePairwiseOnDemand]: 78/85 looper letters, 8 selfloop transitions, 3 changer transitions 29/102 dead transitions. [2021-11-09 09:49:20,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 278 flow [2021-11-09 09:49:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:49:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-09 09:49:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2021-11-09 09:49:20,389 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8928104575163399 [2021-11-09 09:49:20,389 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2021-11-09 09:49:20,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2021-11-09 09:49:20,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:20,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2021-11-09 09:49:20,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:20,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:20,402 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:20,403 INFO L186 Difference]: Start difference. First operand has 86 places, 79 transitions, 166 flow. Second operand 9 states and 683 transitions. [2021-11-09 09:49:20,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 278 flow [2021-11-09 09:49:20,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 102 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-09 09:49:20,410 INFO L242 Difference]: Finished difference. Result has 99 places, 73 transitions, 189 flow [2021-11-09 09:49:20,410 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=99, PETRI_TRANSITIONS=73} [2021-11-09 09:49:20,411 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 11 predicate places. [2021-11-09 09:49:20,411 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 73 transitions, 189 flow [2021-11-09 09:49:20,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:20,412 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:20,412 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:49:20,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 09:49:20,413 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash -271021832, now seen corresponding path program 1 times [2021-11-09 09:49:20,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:20,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663679005] [2021-11-09 09:49:20,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:20,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:20,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:20,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663679005] [2021-11-09 09:49:20,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663679005] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:20,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:20,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 09:49:20,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115337539] [2021-11-09 09:49:20,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 09:49:20,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:20,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 09:49:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:49:20,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-11-09 09:49:20,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 73 transitions, 189 flow. Second operand has 10 states, 10 states have (on average 66.1) internal successors, (661), 10 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:20,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:20,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-11-09 09:49:20,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:21,379 INFO L129 PetriNetUnfolder]: 157/431 cut-off events. [2021-11-09 09:49:21,379 INFO L130 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2021-11-09 09:49:21,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 431 events. 157/431 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1983 event pairs, 42 based on Foata normal form. 12/432 useless extension candidates. Maximal degree in co-relation 949. Up to 173 conditions per place. [2021-11-09 09:49:21,388 INFO L132 encePairwiseOnDemand]: 73/85 looper letters, 12 selfloop transitions, 10 changer transitions 34/114 dead transitions. [2021-11-09 09:49:21,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 114 transitions, 411 flow [2021-11-09 09:49:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-09 09:49:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-09 09:49:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1034 transitions. [2021-11-09 09:49:21,395 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8109803921568628 [2021-11-09 09:49:21,395 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1034 transitions. [2021-11-09 09:49:21,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1034 transitions. [2021-11-09 09:49:21,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:21,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1034 transitions. [2021-11-09 09:49:21,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 68.93333333333334) internal successors, (1034), 15 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 85.0) internal successors, (1360), 16 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,408 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 85.0) internal successors, (1360), 16 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,409 INFO L186 Difference]: Start difference. First operand has 99 places, 73 transitions, 189 flow. Second operand 15 states and 1034 transitions. [2021-11-09 09:49:21,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 114 transitions, 411 flow [2021-11-09 09:49:21,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 114 transitions, 390 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-11-09 09:49:21,456 INFO L242 Difference]: Finished difference. Result has 106 places, 79 transitions, 266 flow [2021-11-09 09:49:21,456 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=266, PETRI_PLACES=106, PETRI_TRANSITIONS=79} [2021-11-09 09:49:21,457 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 18 predicate places. [2021-11-09 09:49:21,457 INFO L470 AbstractCegarLoop]: Abstraction has has 106 places, 79 transitions, 266 flow [2021-11-09 09:49:21,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.1) internal successors, (661), 10 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,458 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:21,458 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] [2021-11-09 09:49:21,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 09:49:21,459 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:21,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1821353691, now seen corresponding path program 1 times [2021-11-09 09:49:21,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:21,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192740657] [2021-11-09 09:49:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:21,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:21,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:21,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192740657] [2021-11-09 09:49:21,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192740657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:21,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:21,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:49:21,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776488334] [2021-11-09 09:49:21,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:49:21,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:21,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:49:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:49:21,667 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-11-09 09:49:21,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 79 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:21,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-11-09 09:49:21,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:21,935 INFO L129 PetriNetUnfolder]: 60/344 cut-off events. [2021-11-09 09:49:21,936 INFO L130 PetriNetUnfolder]: For 829/851 co-relation queries the response was YES. [2021-11-09 09:49:21,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 344 events. 60/344 cut-off events. For 829/851 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1885 event pairs, 9 based on Foata normal form. 10/345 useless extension candidates. Maximal degree in co-relation 949. Up to 65 conditions per place. [2021-11-09 09:49:21,942 INFO L132 encePairwiseOnDemand]: 79/85 looper letters, 13 selfloop transitions, 4 changer transitions 10/94 dead transitions. [2021-11-09 09:49:21,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 94 transitions, 441 flow [2021-11-09 09:49:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:49:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-09 09:49:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 674 transitions. [2021-11-09 09:49:21,947 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810457516339869 [2021-11-09 09:49:21,947 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 674 transitions. [2021-11-09 09:49:21,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 674 transitions. [2021-11-09 09:49:21,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:21,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 674 transitions. [2021-11-09 09:49:21,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 74.88888888888889) internal successors, (674), 9 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,955 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,955 INFO L186 Difference]: Start difference. First operand has 106 places, 79 transitions, 266 flow. Second operand 9 states and 674 transitions. [2021-11-09 09:49:21,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 94 transitions, 441 flow [2021-11-09 09:49:21,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 94 transitions, 409 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-11-09 09:49:21,974 INFO L242 Difference]: Finished difference. Result has 107 places, 80 transitions, 291 flow [2021-11-09 09:49:21,974 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=291, PETRI_PLACES=107, PETRI_TRANSITIONS=80} [2021-11-09 09:49:21,975 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 19 predicate places. [2021-11-09 09:49:21,975 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 80 transitions, 291 flow [2021-11-09 09:49:21,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:21,977 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:21,977 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] [2021-11-09 09:49:21,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 09:49:21,978 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash 681644667, now seen corresponding path program 1 times [2021-11-09 09:49:21,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:21,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408917900] [2021-11-09 09:49:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:21,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:22,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:22,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408917900] [2021-11-09 09:49:22,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408917900] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:22,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:22,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:49:22,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587893049] [2021-11-09 09:49:22,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:49:22,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:49:22,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:49:22,283 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 85 [2021-11-09 09:49:22,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 80 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 68.42857142857143) internal successors, (479), 7 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:22,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:22,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 85 [2021-11-09 09:49:22,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:22,743 INFO L129 PetriNetUnfolder]: 168/452 cut-off events. [2021-11-09 09:49:22,743 INFO L130 PetriNetUnfolder]: For 1895/1979 co-relation queries the response was YES. [2021-11-09 09:49:22,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 452 events. 168/452 cut-off events. For 1895/1979 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2092 event pairs, 64 based on Foata normal form. 12/451 useless extension candidates. Maximal degree in co-relation 1640. Up to 228 conditions per place. [2021-11-09 09:49:22,753 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 22 selfloop transitions, 7 changer transitions 26/115 dead transitions. [2021-11-09 09:49:22,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 661 flow [2021-11-09 09:49:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:49:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-09 09:49:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 923 transitions. [2021-11-09 09:49:22,758 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2021-11-09 09:49:22,758 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 923 transitions. [2021-11-09 09:49:22,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 923 transitions. [2021-11-09 09:49:22,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:22,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 923 transitions. [2021-11-09 09:49:22,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.0) internal successors, (923), 13 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:22,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:22,770 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:22,770 INFO L186 Difference]: Start difference. First operand has 107 places, 80 transitions, 291 flow. Second operand 13 states and 923 transitions. [2021-11-09 09:49:22,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 661 flow [2021-11-09 09:49:22,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 115 transitions, 610 flow, removed 24 selfloop flow, removed 6 redundant places. [2021-11-09 09:49:22,784 INFO L242 Difference]: Finished difference. Result has 118 places, 82 transitions, 324 flow [2021-11-09 09:49:22,785 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=324, PETRI_PLACES=118, PETRI_TRANSITIONS=82} [2021-11-09 09:49:22,786 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 30 predicate places. [2021-11-09 09:49:22,786 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 82 transitions, 324 flow [2021-11-09 09:49:22,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.42857142857143) internal successors, (479), 7 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:22,786 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:22,787 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:49:22,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 09:49:22,787 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -132268815, now seen corresponding path program 2 times [2021-11-09 09:49:22,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:22,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62166945] [2021-11-09 09:49:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:22,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:23,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:23,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62166945] [2021-11-09 09:49:23,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62166945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:23,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:23,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:49:23,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921202880] [2021-11-09 09:49:23,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:49:23,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:49:23,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:49:23,049 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 85 [2021-11-09 09:49:23,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 82 transitions, 324 flow. Second operand has 9 states, 9 states have (on average 67.22222222222223) internal successors, (605), 9 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:23,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:23,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 85 [2021-11-09 09:49:23,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:23,455 INFO L129 PetriNetUnfolder]: 144/423 cut-off events. [2021-11-09 09:49:23,455 INFO L130 PetriNetUnfolder]: For 2492/2659 co-relation queries the response was YES. [2021-11-09 09:49:23,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 423 events. 144/423 cut-off events. For 2492/2659 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1976 event pairs, 52 based on Foata normal form. 14/426 useless extension candidates. Maximal degree in co-relation 1753. Up to 202 conditions per place. [2021-11-09 09:49:23,463 INFO L132 encePairwiseOnDemand]: 77/85 looper letters, 20 selfloop transitions, 6 changer transitions 19/104 dead transitions. [2021-11-09 09:49:23,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 104 transitions, 638 flow [2021-11-09 09:49:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:49:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-09 09:49:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 766 transitions. [2021-11-09 09:49:23,468 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8192513368983957 [2021-11-09 09:49:23,469 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 766 transitions. [2021-11-09 09:49:23,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 766 transitions. [2021-11-09 09:49:23,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:23,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 766 transitions. [2021-11-09 09:49:23,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 69.63636363636364) internal successors, (766), 11 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:23,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:23,479 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:23,479 INFO L186 Difference]: Start difference. First operand has 118 places, 82 transitions, 324 flow. Second operand 11 states and 766 transitions. [2021-11-09 09:49:23,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 104 transitions, 638 flow [2021-11-09 09:49:23,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 104 transitions, 579 flow, removed 26 selfloop flow, removed 8 redundant places. [2021-11-09 09:49:23,499 INFO L242 Difference]: Finished difference. Result has 117 places, 82 transitions, 323 flow [2021-11-09 09:49:23,500 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=323, PETRI_PLACES=117, PETRI_TRANSITIONS=82} [2021-11-09 09:49:23,500 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 29 predicate places. [2021-11-09 09:49:23,500 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 82 transitions, 323 flow [2021-11-09 09:49:23,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.22222222222223) internal successors, (605), 9 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:23,501 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:23,502 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] [2021-11-09 09:49:23,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 09:49:23,503 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:23,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2080328038, now seen corresponding path program 1 times [2021-11-09 09:49:23,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:23,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733876925] [2021-11-09 09:49:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:23,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:23,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:23,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733876925] [2021-11-09 09:49:23,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733876925] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:23,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:23,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:49:23,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832463897] [2021-11-09 09:49:23,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:49:23,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:23,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:49:23,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:49:23,842 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-11-09 09:49:23,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 82 transitions, 323 flow. Second operand has 9 states, 9 states have (on average 66.33333333333333) internal successors, (597), 9 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:23,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:23,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-11-09 09:49:23,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:24,238 INFO L129 PetriNetUnfolder]: 142/432 cut-off events. [2021-11-09 09:49:24,238 INFO L130 PetriNetUnfolder]: For 2486/2601 co-relation queries the response was YES. [2021-11-09 09:49:24,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 432 events. 142/432 cut-off events. For 2486/2601 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2134 event pairs, 57 based on Foata normal form. 24/440 useless extension candidates. Maximal degree in co-relation 1749. Up to 156 conditions per place. [2021-11-09 09:49:24,245 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 16 selfloop transitions, 10 changer transitions 23/107 dead transitions. [2021-11-09 09:49:24,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 107 transitions, 629 flow [2021-11-09 09:49:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:49:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-09 09:49:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 825 transitions. [2021-11-09 09:49:24,250 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2021-11-09 09:49:24,250 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 825 transitions. [2021-11-09 09:49:24,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 825 transitions. [2021-11-09 09:49:24,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:24,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 825 transitions. [2021-11-09 09:49:24,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 68.75) internal successors, (825), 12 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:24,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:24,258 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:24,258 INFO L186 Difference]: Start difference. First operand has 117 places, 82 transitions, 323 flow. Second operand 12 states and 825 transitions. [2021-11-09 09:49:24,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 107 transitions, 629 flow [2021-11-09 09:49:24,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 107 transitions, 572 flow, removed 24 selfloop flow, removed 12 redundant places. [2021-11-09 09:49:24,272 INFO L242 Difference]: Finished difference. Result has 117 places, 83 transitions, 352 flow [2021-11-09 09:49:24,272 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=352, PETRI_PLACES=117, PETRI_TRANSITIONS=83} [2021-11-09 09:49:24,273 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 29 predicate places. [2021-11-09 09:49:24,273 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 83 transitions, 352 flow [2021-11-09 09:49:24,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 66.33333333333333) internal successors, (597), 9 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:24,274 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:24,274 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:49:24,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 09:49:24,275 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2046881589, now seen corresponding path program 1 times [2021-11-09 09:49:24,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:24,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319193118] [2021-11-09 09:49:24,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:24,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:24,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:24,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319193118] [2021-11-09 09:49:24,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319193118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:24,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:24,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:49:24,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379742891] [2021-11-09 09:49:24,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:49:24,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:49:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:49:24,539 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 85 [2021-11-09 09:49:24,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 83 transitions, 352 flow. Second operand has 9 states, 9 states have (on average 66.44444444444444) internal successors, (598), 9 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:24,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:24,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 85 [2021-11-09 09:49:24,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:25,002 INFO L129 PetriNetUnfolder]: 102/379 cut-off events. [2021-11-09 09:49:25,002 INFO L130 PetriNetUnfolder]: For 2706/2877 co-relation queries the response was YES. [2021-11-09 09:49:25,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 379 events. 102/379 cut-off events. For 2706/2877 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1902 event pairs, 13 based on Foata normal form. 22/387 useless extension candidates. Maximal degree in co-relation 1630. Up to 92 conditions per place. [2021-11-09 09:49:25,009 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 20 selfloop transitions, 12 changer transitions 22/112 dead transitions. [2021-11-09 09:49:25,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 112 transitions, 790 flow [2021-11-09 09:49:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-09 09:49:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-09 09:49:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 958 transitions. [2021-11-09 09:49:25,014 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8050420168067227 [2021-11-09 09:49:25,015 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 958 transitions. [2021-11-09 09:49:25,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 958 transitions. [2021-11-09 09:49:25,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:25,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 958 transitions. [2021-11-09 09:49:25,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 68.42857142857143) internal successors, (958), 14 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,025 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,025 INFO L186 Difference]: Start difference. First operand has 117 places, 83 transitions, 352 flow. Second operand 14 states and 958 transitions. [2021-11-09 09:49:25,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 112 transitions, 790 flow [2021-11-09 09:49:25,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 112 transitions, 751 flow, removed 13 selfloop flow, removed 7 redundant places. [2021-11-09 09:49:25,041 INFO L242 Difference]: Finished difference. Result has 124 places, 84 transitions, 411 flow [2021-11-09 09:49:25,041 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=411, PETRI_PLACES=124, PETRI_TRANSITIONS=84} [2021-11-09 09:49:25,042 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 36 predicate places. [2021-11-09 09:49:25,042 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 84 transitions, 411 flow [2021-11-09 09:49:25,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 66.44444444444444) internal successors, (598), 9 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,043 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:25,043 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] [2021-11-09 09:49:25,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 09:49:25,044 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -615167435, now seen corresponding path program 1 times [2021-11-09 09:49:25,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:25,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438930559] [2021-11-09 09:49:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:25,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:25,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:25,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438930559] [2021-11-09 09:49:25,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438930559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:25,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:25,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:49:25,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132317572] [2021-11-09 09:49:25,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:49:25,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:25,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:49:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:49:25,186 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-11-09 09:49:25,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 84 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:25,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-11-09 09:49:25,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:25,401 INFO L129 PetriNetUnfolder]: 111/447 cut-off events. [2021-11-09 09:49:25,401 INFO L130 PetriNetUnfolder]: For 1787/1792 co-relation queries the response was YES. [2021-11-09 09:49:25,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 447 events. 111/447 cut-off events. For 1787/1792 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2717 event pairs, 15 based on Foata normal form. 3/416 useless extension candidates. Maximal degree in co-relation 1258. Up to 75 conditions per place. [2021-11-09 09:49:25,408 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 13 selfloop transitions, 14 changer transitions 6/102 dead transitions. [2021-11-09 09:49:25,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 490 flow [2021-11-09 09:49:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:49:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-09 09:49:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 755 transitions. [2021-11-09 09:49:25,412 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.888235294117647 [2021-11-09 09:49:25,412 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 755 transitions. [2021-11-09 09:49:25,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 755 transitions. [2021-11-09 09:49:25,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:25,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 755 transitions. [2021-11-09 09:49:25,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.5) internal successors, (755), 10 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,420 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,420 INFO L186 Difference]: Start difference. First operand has 124 places, 84 transitions, 411 flow. Second operand 10 states and 755 transitions. [2021-11-09 09:49:25,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 490 flow [2021-11-09 09:49:25,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 102 transitions, 440 flow, removed 15 selfloop flow, removed 15 redundant places. [2021-11-09 09:49:25,432 INFO L242 Difference]: Finished difference. Result has 116 places, 93 transitions, 417 flow [2021-11-09 09:49:25,433 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=417, PETRI_PLACES=116, PETRI_TRANSITIONS=93} [2021-11-09 09:49:25,433 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2021-11-09 09:49:25,433 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 93 transitions, 417 flow [2021-11-09 09:49:25,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,434 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:25,434 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] [2021-11-09 09:49:25,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 09:49:25,435 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:25,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1906205189, now seen corresponding path program 1 times [2021-11-09 09:49:25,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:25,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231128716] [2021-11-09 09:49:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:25,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:25,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:25,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231128716] [2021-11-09 09:49:25,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231128716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:25,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:25,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:49:25,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723043528] [2021-11-09 09:49:25,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:49:25,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:25,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:49:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:49:25,580 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-11-09 09:49:25,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 93 transitions, 417 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:25,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-11-09 09:49:25,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:25,822 INFO L129 PetriNetUnfolder]: 55/338 cut-off events. [2021-11-09 09:49:25,823 INFO L130 PetriNetUnfolder]: For 430/552 co-relation queries the response was YES. [2021-11-09 09:49:25,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 338 events. 55/338 cut-off events. For 430/552 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2179 event pairs, 0 based on Foata normal form. 61/377 useless extension candidates. Maximal degree in co-relation 824. Up to 51 conditions per place. [2021-11-09 09:49:25,827 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 11 selfloop transitions, 17 changer transitions 18/111 dead transitions. [2021-11-09 09:49:25,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 573 flow [2021-11-09 09:49:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:49:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-09 09:49:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 972 transitions. [2021-11-09 09:49:25,832 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8796380090497737 [2021-11-09 09:49:25,832 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 972 transitions. [2021-11-09 09:49:25,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 972 transitions. [2021-11-09 09:49:25,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:25,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 972 transitions. [2021-11-09 09:49:25,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.76923076923077) internal successors, (972), 13 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,841 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,842 INFO L186 Difference]: Start difference. First operand has 116 places, 93 transitions, 417 flow. Second operand 13 states and 972 transitions. [2021-11-09 09:49:25,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 573 flow [2021-11-09 09:49:25,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 111 transitions, 481 flow, removed 45 selfloop flow, removed 13 redundant places. [2021-11-09 09:49:25,849 INFO L242 Difference]: Finished difference. Result has 122 places, 90 transitions, 380 flow [2021-11-09 09:49:25,850 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=380, PETRI_PLACES=122, PETRI_TRANSITIONS=90} [2021-11-09 09:49:25,850 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 34 predicate places. [2021-11-09 09:49:25,850 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 90 transitions, 380 flow [2021-11-09 09:49:25,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:25,851 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:25,851 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] [2021-11-09 09:49:25,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 09:49:25,852 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1936755363, now seen corresponding path program 1 times [2021-11-09 09:49:25,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:25,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803393312] [2021-11-09 09:49:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:25,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:49:26,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:26,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803393312] [2021-11-09 09:49:26,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803393312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:49:26,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:49:26,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-09 09:49:26,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893398343] [2021-11-09 09:49:26,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 09:49:26,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:26,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 09:49:26,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:49:26,227 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 85 [2021-11-09 09:49:26,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 90 transitions, 380 flow. Second operand has 13 states, 13 states have (on average 63.38461538461539) internal successors, (824), 13 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:26,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:49:26,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 85 [2021-11-09 09:49:26,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:49:26,542 INFO L129 PetriNetUnfolder]: 15/189 cut-off events. [2021-11-09 09:49:26,543 INFO L130 PetriNetUnfolder]: For 234/241 co-relation queries the response was YES. [2021-11-09 09:49:26,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 189 events. 15/189 cut-off events. For 234/241 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 833 event pairs, 0 based on Foata normal form. 3/187 useless extension candidates. Maximal degree in co-relation 458. Up to 22 conditions per place. [2021-11-09 09:49:26,545 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 14 selfloop transitions, 6 changer transitions 10/96 dead transitions. [2021-11-09 09:49:26,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 96 transitions, 453 flow [2021-11-09 09:49:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:49:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-09 09:49:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 771 transitions. [2021-11-09 09:49:26,549 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7558823529411764 [2021-11-09 09:49:26,549 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 771 transitions. [2021-11-09 09:49:26,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 771 transitions. [2021-11-09 09:49:26,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:26,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 771 transitions. [2021-11-09 09:49:26,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 64.25) internal successors, (771), 12 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:26,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:26,562 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 85.0) internal successors, (1105), 13 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:26,562 INFO L186 Difference]: Start difference. First operand has 122 places, 90 transitions, 380 flow. Second operand 12 states and 771 transitions. [2021-11-09 09:49:26,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 96 transitions, 453 flow [2021-11-09 09:49:26,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 96 transitions, 407 flow, removed 7 selfloop flow, removed 14 redundant places. [2021-11-09 09:49:26,575 INFO L242 Difference]: Finished difference. Result has 120 places, 86 transitions, 331 flow [2021-11-09 09:49:26,576 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=331, PETRI_PLACES=120, PETRI_TRANSITIONS=86} [2021-11-09 09:49:26,576 INFO L334 CegarLoopForPetriNet]: 88 programPoint places, 32 predicate places. [2021-11-09 09:49:26,576 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 86 transitions, 331 flow [2021-11-09 09:49:26,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 63.38461538461539) internal successors, (824), 13 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:49:26,577 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:49:26,578 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] [2021-11-09 09:49:26,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 09:49:26,578 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-11-09 09:49:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash 520013583, now seen corresponding path program 2 times [2021-11-09 09:49:26,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:26,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11664103] [2021-11-09 09:49:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:26,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:49:26,665 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:49:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:49:26,804 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:49:26,804 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-09 09:49:26,806 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:49:26,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:49:26,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-09 09:49:26,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-09 09:49:26,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:49:26,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 09:49:26,814 INFO L731 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:49:26,822 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-09 09:49:26,822 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:49:26,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:49:26 BasicIcfg [2021-11-09 09:49:26,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:49:26,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:49:26,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:49:26,990 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:49:26,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:49:18" (3/4) ... [2021-11-09 09:49:26,993 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-09 09:49:27,189 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 09:49:27,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:49:27,190 INFO L168 Benchmark]: Toolchain (without parser) took 11652.46 ms. Allocated memory was 100.7 MB in the beginning and 182.5 MB in the end (delta: 81.8 MB). Free memory was 59.2 MB in the beginning and 59.7 MB in the end (delta: -450.0 kB). Peak memory consumption was 81.9 MB. Max. memory is 16.1 GB. [2021-11-09 09:49:27,191 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 100.7 MB. Free memory was 76.9 MB in the beginning and 76.9 MB in the end (delta: 56.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:49:27,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.94 ms. Allocated memory is still 100.7 MB. Free memory was 59.0 MB in the beginning and 62.9 MB in the end (delta: -4.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:49:27,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.98 ms. Allocated memory is still 100.7 MB. Free memory was 62.9 MB in the beginning and 60.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 09:49:27,192 INFO L168 Benchmark]: Boogie Preprocessor took 63.65 ms. Allocated memory is still 100.7 MB. Free memory was 60.0 MB in the beginning and 57.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:49:27,192 INFO L168 Benchmark]: RCFGBuilder took 2333.89 ms. Allocated memory was 100.7 MB in the beginning and 134.2 MB in the end (delta: 33.6 MB). Free memory was 57.9 MB in the beginning and 85.5 MB in the end (delta: -27.6 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. [2021-11-09 09:49:27,192 INFO L168 Benchmark]: TraceAbstraction took 8146.94 ms. Allocated memory was 134.2 MB in the beginning and 182.5 MB in the end (delta: 48.2 MB). Free memory was 85.1 MB in the beginning and 78.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 55.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:49:27,193 INFO L168 Benchmark]: Witness Printer took 199.42 ms. Allocated memory is still 182.5 MB. Free memory was 78.5 MB in the beginning and 59.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-09 09:49:27,195 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.20 ms. Allocated memory is still 100.7 MB. Free memory was 76.9 MB in the beginning and 76.9 MB in the end (delta: 56.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 776.94 ms. Allocated memory is still 100.7 MB. Free memory was 59.0 MB in the beginning and 62.9 MB in the end (delta: -4.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 117.98 ms. Allocated memory is still 100.7 MB. Free memory was 62.9 MB in the beginning and 60.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.65 ms. Allocated memory is still 100.7 MB. Free memory was 60.0 MB in the beginning and 57.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2333.89 ms. Allocated memory was 100.7 MB in the beginning and 134.2 MB in the end (delta: 33.6 MB). Free memory was 57.9 MB in the beginning and 85.5 MB in the end (delta: -27.6 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8146.94 ms. Allocated memory was 134.2 MB in the beginning and 182.5 MB in the end (delta: 48.2 MB). Free memory was 85.1 MB in the beginning and 78.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 55.8 MB. Max. memory is 16.1 GB. * Witness Printer took 199.42 ms. Allocated memory is still 182.5 MB. Free memory was 78.5 MB in the beginning and 59.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 793]: 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: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 116 SDtfs, 278 SDslu, 419 SDs, 0 SdLazy, 676 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=9, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 706 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 2994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-09 09:49:27,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a5385c6-7977-4739-a7c0-d3c994a6c1cf/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE