./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --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 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:38:48,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:38:48,634 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:38:48,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:38:48,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:38:48,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:38:48,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:38:48,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:38:48,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:38:48,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:38:48,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:38:48,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:38:48,671 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:38:48,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:38:48,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:38:48,673 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:38:48,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:38:48,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:38:48,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:38:48,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:38:48,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:38:48,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:38:48,677 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:38:48,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:38:48,677 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:38:48,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:38:48,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:38:48,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:38:48,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:48,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:38:48,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:38:48,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:38:48,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:38:48,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:38:48,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:38:48,682 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:38:48,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:38:48,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:38:48,684 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:38:48,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/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_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2023-11-19 07:38:48,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:38:48,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:38:48,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:38:48,951 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:38:48,951 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:38:48,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2023-11-19 07:38:52,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:38:52,449 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:38:52,450 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2023-11-19 07:38:52,472 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/data/8e428519a/db6e74bb0edc41caae55c63e90e56e85/FLAGac9d2dffa [2023-11-19 07:38:52,492 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/data/8e428519a/db6e74bb0edc41caae55c63e90e56e85 [2023-11-19 07:38:52,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:38:52,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:38:52,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:52,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:38:52,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:38:52,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:52" (1/1) ... [2023-11-19 07:38:52,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbb770c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:52, skipping insertion in model container [2023-11-19 07:38:52,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:52" (1/1) ... [2023-11-19 07:38:52,572 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:38:52,772 WARN L240 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_a2dc3009-6e8d-47e9-bea2-62c662ec3083/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2023-11-19 07:38:53,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:53,104 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:38:53,117 WARN L240 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_a2dc3009-6e8d-47e9-bea2-62c662ec3083/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2023-11-19 07:38:53,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:53,207 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:38:53,207 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:38:53,216 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:38:53,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53 WrapperNode [2023-11-19 07:38:53,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:53,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:53,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:38:53,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:38:53,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,332 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2023-11-19 07:38:53,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:53,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:38:53,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:38:53,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:38:53,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:38:53,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:38:53,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:38:53,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:38:53,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (1/1) ... [2023-11-19 07:38:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:53,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:38:53,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:38:53,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:38:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:38:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:38:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:38:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:38:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:38:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:38:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:38:53,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:38:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:38:53,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:38:53,511 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:38:53,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:38:53,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:38:53,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:38:53,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:38:53,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:38:53,544 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:38:53,771 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:38:53,773 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:38:54,301 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:38:54,779 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:38:54,780 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:38:54,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:54 BoogieIcfgContainer [2023-11-19 07:38:54,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:38:54,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:38:54,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:38:54,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:38:54,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:52" (1/3) ... [2023-11-19 07:38:54,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6522cfdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:54, skipping insertion in model container [2023-11-19 07:38:54,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:53" (2/3) ... [2023-11-19 07:38:54,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6522cfdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:54, skipping insertion in model container [2023-11-19 07:38:54,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:54" (3/3) ... [2023-11-19 07:38:54,801 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2023-11-19 07:38:54,810 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:38:54,821 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:38:54,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:38:54,821 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:38:54,908 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:38:54,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 132 transitions, 276 flow [2023-11-19 07:38:55,046 INFO L124 PetriNetUnfolderBase]: 3/129 cut-off events. [2023-11-19 07:38:55,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:38:55,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 3/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-19 07:38:55,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 132 transitions, 276 flow [2023-11-19 07:38:55,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 129 transitions, 267 flow [2023-11-19 07:38:55,069 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:38:55,083 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 129 transitions, 267 flow [2023-11-19 07:38:55,085 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 129 transitions, 267 flow [2023-11-19 07:38:55,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 129 transitions, 267 flow [2023-11-19 07:38:55,137 INFO L124 PetriNetUnfolderBase]: 3/129 cut-off events. [2023-11-19 07:38:55,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:38:55,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 3/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-19 07:38:55,145 INFO L119 LiptonReduction]: Number of co-enabled transitions 2190 [2023-11-19 07:39:03,972 INFO L134 LiptonReduction]: Checked pairs total: 5168 [2023-11-19 07:39:03,973 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-11-19 07:39:03,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:03,996 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79f47aa9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:03,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:39:04,001 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:39:04,002 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-11-19 07:39:04,002 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:39:04,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:04,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:39:04,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:04,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:04,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1736501850, now seen corresponding path program 1 times [2023-11-19 07:39:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:04,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263954060] [2023-11-19 07:39:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263954060] [2023-11-19 07:39:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263954060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:04,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:04,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:39:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829331169] [2023-11-19 07:39:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:04,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:04,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:04,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 247 [2023-11-19 07:39:04,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:04,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:04,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 247 [2023-11-19 07:39:04,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:05,320 INFO L124 PetriNetUnfolderBase]: 1277/1894 cut-off events. [2023-11-19 07:39:05,320 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-19 07:39:05,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3835 conditions, 1894 events. 1277/1894 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8733 event pairs, 443 based on Foata normal form. 80/1798 useless extension candidates. Maximal degree in co-relation 3824. Up to 1195 conditions per place. [2023-11-19 07:39:05,337 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 30 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-11-19 07:39:05,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 158 flow [2023-11-19 07:39:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:39:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-11-19 07:39:05,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2023-11-19 07:39:05,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-11-19 07:39:05,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-11-19 07:39:05,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:05,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-11-19 07:39:05,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:05,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:05,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:05,374 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 390 transitions. [2023-11-19 07:39:05,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 158 flow [2023-11-19 07:39:05,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:39:05,380 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-11-19 07:39:05,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-19 07:39:05,385 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-19 07:39:05,386 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-11-19 07:39:05,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:05,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:05,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:05,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:39:05,387 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:05,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash -882780173, now seen corresponding path program 1 times [2023-11-19 07:39:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113200670] [2023-11-19 07:39:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:05,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113200670] [2023-11-19 07:39:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113200670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900930182] [2023-11-19 07:39:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:05,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:05,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 247 [2023-11-19 07:39:05,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:05,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:05,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 247 [2023-11-19 07:39:05,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:06,230 INFO L124 PetriNetUnfolderBase]: 931/1423 cut-off events. [2023-11-19 07:39:06,230 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-19 07:39:06,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 1423 events. 931/1423 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6371 event pairs, 282 based on Foata normal form. 80/1499 useless extension candidates. Maximal degree in co-relation 2983. Up to 1062 conditions per place. [2023-11-19 07:39:06,241 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 31 selfloop transitions, 2 changer transitions 18/52 dead transitions. [2023-11-19 07:39:06,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 52 transitions, 226 flow [2023-11-19 07:39:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:39:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-11-19 07:39:06,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5044534412955466 [2023-11-19 07:39:06,247 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-11-19 07:39:06,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-11-19 07:39:06,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:06,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-11-19 07:39:06,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:06,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:06,256 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:06,256 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 623 transitions. [2023-11-19 07:39:06,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 52 transitions, 226 flow [2023-11-19 07:39:06,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:06,259 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 60 flow [2023-11-19 07:39:06,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2023-11-19 07:39:06,260 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-11-19 07:39:06,260 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 60 flow [2023-11-19 07:39:06,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:06,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:06,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:06,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:39:06,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:06,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1596354028, now seen corresponding path program 1 times [2023-11-19 07:39:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:06,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423550858] [2023-11-19 07:39:06,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:06,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423550858] [2023-11-19 07:39:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423550858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:06,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:06,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046149040] [2023-11-19 07:39:06,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:06,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:06,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:06,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:06,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 247 [2023-11-19 07:39:06,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:06,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:06,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 247 [2023-11-19 07:39:06,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:07,042 INFO L124 PetriNetUnfolderBase]: 1279/1928 cut-off events. [2023-11-19 07:39:07,043 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2023-11-19 07:39:07,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 1928 events. 1279/1928 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8162 event pairs, 335 based on Foata normal form. 75/2003 useless extension candidates. Maximal degree in co-relation 4284. Up to 706 conditions per place. [2023-11-19 07:39:07,055 INFO L140 encePairwiseOnDemand]: 242/247 looper letters, 32 selfloop transitions, 3 changer transitions 23/58 dead transitions. [2023-11-19 07:39:07,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 257 flow [2023-11-19 07:39:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:39:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2023-11-19 07:39:07,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4939271255060729 [2023-11-19 07:39:07,059 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 732 transitions. [2023-11-19 07:39:07,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 732 transitions. [2023-11-19 07:39:07,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:07,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 732 transitions. [2023-11-19 07:39:07,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:07,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:07,068 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:07,069 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 60 flow. Second operand 6 states and 732 transitions. [2023-11-19 07:39:07,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 257 flow [2023-11-19 07:39:07,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 58 transitions, 247 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-19 07:39:07,084 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 70 flow [2023-11-19 07:39:07,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2023-11-19 07:39:07,086 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-11-19 07:39:07,090 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 70 flow [2023-11-19 07:39:07,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:07,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:07,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:07,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:39:07,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:07,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1976727133, now seen corresponding path program 1 times [2023-11-19 07:39:07,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239114827] [2023-11-19 07:39:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:08,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239114827] [2023-11-19 07:39:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239114827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:39:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79096434] [2023-11-19 07:39:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:08,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:08,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 247 [2023-11-19 07:39:08,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 70 flow. Second operand has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:09,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 247 [2023-11-19 07:39:09,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:09,543 INFO L124 PetriNetUnfolderBase]: 619/977 cut-off events. [2023-11-19 07:39:09,543 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2023-11-19 07:39:09,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2358 conditions, 977 events. 619/977 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3883 event pairs, 256 based on Foata normal form. 45/1022 useless extension candidates. Maximal degree in co-relation 2343. Up to 760 conditions per place. [2023-11-19 07:39:09,552 INFO L140 encePairwiseOnDemand]: 240/247 looper letters, 35 selfloop transitions, 7 changer transitions 19/62 dead transitions. [2023-11-19 07:39:09,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 296 flow [2023-11-19 07:39:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:39:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:39:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 920 transitions. [2023-11-19 07:39:09,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46558704453441296 [2023-11-19 07:39:09,556 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 920 transitions. [2023-11-19 07:39:09,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 920 transitions. [2023-11-19 07:39:09,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:09,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 920 transitions. [2023-11-19 07:39:09,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,568 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,568 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 70 flow. Second operand 8 states and 920 transitions. [2023-11-19 07:39:09,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 296 flow [2023-11-19 07:39:09,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 264 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-11-19 07:39:09,574 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 107 flow [2023-11-19 07:39:09,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-11-19 07:39:09,577 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-11-19 07:39:09,577 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 107 flow [2023-11-19 07:39:09,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:09,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:09,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:09,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:39:09,579 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:09,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1201641523, now seen corresponding path program 1 times [2023-11-19 07:39:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125371461] [2023-11-19 07:39:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125371461] [2023-11-19 07:39:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125371461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:12,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:39:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062247781] [2023-11-19 07:39:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:12,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:39:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:12,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:39:12,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:39:12,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 247 [2023-11-19 07:39:12,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 107 flow. Second operand has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:12,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 247 [2023-11-19 07:39:12,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:12,778 INFO L124 PetriNetUnfolderBase]: 607/954 cut-off events. [2023-11-19 07:39:12,778 INFO L125 PetriNetUnfolderBase]: For 762/762 co-relation queries the response was YES. [2023-11-19 07:39:12,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 954 events. 607/954 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3712 event pairs, 274 based on Foata normal form. 30/984 useless extension candidates. Maximal degree in co-relation 2616. Up to 567 conditions per place. [2023-11-19 07:39:12,786 INFO L140 encePairwiseOnDemand]: 239/247 looper letters, 37 selfloop transitions, 9 changer transitions 15/62 dead transitions. [2023-11-19 07:39:12,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 331 flow [2023-11-19 07:39:12,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:39:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:39:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 908 transitions. [2023-11-19 07:39:12,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45951417004048584 [2023-11-19 07:39:12,791 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 908 transitions. [2023-11-19 07:39:12,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 908 transitions. [2023-11-19 07:39:12,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:12,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 908 transitions. [2023-11-19 07:39:12,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,800 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,800 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 107 flow. Second operand 8 states and 908 transitions. [2023-11-19 07:39:12,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 331 flow [2023-11-19 07:39:12,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 327 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:12,807 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 168 flow [2023-11-19 07:39:12,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2023-11-19 07:39:12,810 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-19 07:39:12,811 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 168 flow [2023-11-19 07:39:12,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:12,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:12,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:12,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:39:12,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:12,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash 568114620, now seen corresponding path program 1 times [2023-11-19 07:39:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494533293] [2023-11-19 07:39:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494533293] [2023-11-19 07:39:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494533293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721656812] [2023-11-19 07:39:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:13,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:13,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:13,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 247 [2023-11-19 07:39:13,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:13,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 247 [2023-11-19 07:39:13,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:13,192 INFO L124 PetriNetUnfolderBase]: 310/529 cut-off events. [2023-11-19 07:39:13,192 INFO L125 PetriNetUnfolderBase]: For 872/872 co-relation queries the response was YES. [2023-11-19 07:39:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 529 events. 310/529 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1969 event pairs, 71 based on Foata normal form. 34/563 useless extension candidates. Maximal degree in co-relation 1750. Up to 442 conditions per place. [2023-11-19 07:39:13,198 INFO L140 encePairwiseOnDemand]: 242/247 looper letters, 43 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-11-19 07:39:13,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 347 flow [2023-11-19 07:39:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:39:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-11-19 07:39:13,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060728744939271 [2023-11-19 07:39:13,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-11-19 07:39:13,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-11-19 07:39:13,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:13,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-11-19 07:39:13,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,206 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 168 flow. Second operand 3 states and 375 transitions. [2023-11-19 07:39:13,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 347 flow [2023-11-19 07:39:13,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 314 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-19 07:39:13,211 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 170 flow [2023-11-19 07:39:13,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-11-19 07:39:13,212 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-11-19 07:39:13,212 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 170 flow [2023-11-19 07:39:13,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:13,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:13,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:39:13,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:13,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1864399105, now seen corresponding path program 1 times [2023-11-19 07:39:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134081323] [2023-11-19 07:39:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:13,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:13,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134081323] [2023-11-19 07:39:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134081323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:13,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:13,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238582394] [2023-11-19 07:39:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:13,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:13,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:13,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:13,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 247 [2023-11-19 07:39:13,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:13,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 247 [2023-11-19 07:39:13,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:13,639 INFO L124 PetriNetUnfolderBase]: 135/265 cut-off events. [2023-11-19 07:39:13,639 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2023-11-19 07:39:13,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 265 events. 135/265 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 866 event pairs, 34 based on Foata normal form. 32/297 useless extension candidates. Maximal degree in co-relation 900. Up to 99 conditions per place. [2023-11-19 07:39:13,642 INFO L140 encePairwiseOnDemand]: 242/247 looper letters, 48 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-11-19 07:39:13,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 381 flow [2023-11-19 07:39:13,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:39:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2023-11-19 07:39:13,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040485829959515 [2023-11-19 07:39:13,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 498 transitions. [2023-11-19 07:39:13,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 498 transitions. [2023-11-19 07:39:13,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:13,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 498 transitions. [2023-11-19 07:39:13,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,652 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 170 flow. Second operand 4 states and 498 transitions. [2023-11-19 07:39:13,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 381 flow [2023-11-19 07:39:13,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 369 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-19 07:39:13,655 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 188 flow [2023-11-19 07:39:13,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-11-19 07:39:13,656 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-11-19 07:39:13,657 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 188 flow [2023-11-19 07:39:13,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:13,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:13,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:39:13,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:13,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1962762311, now seen corresponding path program 1 times [2023-11-19 07:39:13,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:13,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879338822] [2023-11-19 07:39:13,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:13,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:13,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879338822] [2023-11-19 07:39:13,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879338822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:13,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:13,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:13,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027529816] [2023-11-19 07:39:13,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:13,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:13,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:13,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:13,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 247 [2023-11-19 07:39:13,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:13,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:13,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 247 [2023-11-19 07:39:13,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:14,121 INFO L124 PetriNetUnfolderBase]: 180/364 cut-off events. [2023-11-19 07:39:14,122 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2023-11-19 07:39:14,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 364 events. 180/364 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1431 event pairs, 33 based on Foata normal form. 6/370 useless extension candidates. Maximal degree in co-relation 1349. Up to 211 conditions per place. [2023-11-19 07:39:14,125 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 46 selfloop transitions, 2 changer transitions 25/74 dead transitions. [2023-11-19 07:39:14,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 559 flow [2023-11-19 07:39:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:39:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2023-11-19 07:39:14,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49068825910931174 [2023-11-19 07:39:14,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2023-11-19 07:39:14,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2023-11-19 07:39:14,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:14,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2023-11-19 07:39:14,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,136 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 188 flow. Second operand 5 states and 606 transitions. [2023-11-19 07:39:14,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 559 flow [2023-11-19 07:39:14,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 525 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:14,141 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 189 flow [2023-11-19 07:39:14,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-11-19 07:39:14,142 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-11-19 07:39:14,142 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 189 flow [2023-11-19 07:39:14,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:14,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:14,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:39:14,143 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:14,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2090783099, now seen corresponding path program 1 times [2023-11-19 07:39:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22453613] [2023-11-19 07:39:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:14,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:14,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22453613] [2023-11-19 07:39:14,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22453613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:14,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:14,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131951122] [2023-11-19 07:39:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:14,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:14,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:14,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:14,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 247 [2023-11-19 07:39:14,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:14,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 247 [2023-11-19 07:39:14,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:14,658 INFO L124 PetriNetUnfolderBase]: 129/257 cut-off events. [2023-11-19 07:39:14,658 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2023-11-19 07:39:14,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 257 events. 129/257 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 925 event pairs, 29 based on Foata normal form. 17/274 useless extension candidates. Maximal degree in co-relation 936. Up to 104 conditions per place. [2023-11-19 07:39:14,661 INFO L140 encePairwiseOnDemand]: 242/247 looper letters, 37 selfloop transitions, 10 changer transitions 9/57 dead transitions. [2023-11-19 07:39:14,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 414 flow [2023-11-19 07:39:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:39:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-11-19 07:39:14,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49554655870445347 [2023-11-19 07:39:14,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-11-19 07:39:14,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-11-19 07:39:14,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:14,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-11-19 07:39:14,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,673 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,673 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 189 flow. Second operand 5 states and 612 transitions. [2023-11-19 07:39:14,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 414 flow [2023-11-19 07:39:14,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 383 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-19 07:39:14,677 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 178 flow [2023-11-19 07:39:14,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2023-11-19 07:39:14,678 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-11-19 07:39:14,679 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 178 flow [2023-11-19 07:39:14,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:14,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:14,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:14,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:39:14,680 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:14,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:14,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1907744561, now seen corresponding path program 1 times [2023-11-19 07:39:14,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440441949] [2023-11-19 07:39:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:14,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:39:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:14,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:39:14,912 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:39:14,913 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:39:14,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:39:14,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:39:14,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:39:14,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:39:14,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:39:14,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:39:14,917 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:14,924 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:39:14,924 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:39:14,989 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-19 07:39:14,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-19 07:39:14,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-19 07:39:15,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:39:15 BasicIcfg [2023-11-19 07:39:15,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:39:15,047 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:39:15,047 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:39:15,047 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:39:15,048 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:54" (3/4) ... [2023-11-19 07:39:15,049 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:39:15,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-19 07:39:15,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-19 07:39:15,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-19 07:39:15,190 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:39:15,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:39:15,191 INFO L158 Benchmark]: Toolchain (without parser) took 22689.93ms. Allocated memory was 169.9MB in the beginning and 450.9MB in the end (delta: 281.0MB). Free memory was 124.2MB in the beginning and 294.5MB in the end (delta: -170.3MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,191 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:15,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 714.51ms. Allocated memory is still 169.9MB. Free memory was 123.9MB in the beginning and 99.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.74ms. Allocated memory is still 169.9MB. Free memory was 99.6MB in the beginning and 96.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,192 INFO L158 Benchmark]: Boogie Preprocessor took 87.29ms. Allocated memory is still 169.9MB. Free memory was 96.6MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,193 INFO L158 Benchmark]: RCFGBuilder took 1365.62ms. Allocated memory is still 169.9MB. Free memory was 94.5MB in the beginning and 129.1MB in the end (delta: -34.6MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,193 INFO L158 Benchmark]: TraceAbstraction took 20254.17ms. Allocated memory was 169.9MB in the beginning and 450.9MB in the end (delta: 281.0MB). Free memory was 128.2MB in the beginning and 310.2MB in the end (delta: -182.0MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,194 INFO L158 Benchmark]: Witness Printer took 143.30ms. Allocated memory is still 450.9MB. Free memory was 310.2MB in the beginning and 294.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:39:15,196 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 714.51ms. Allocated memory is still 169.9MB. Free memory was 123.9MB in the beginning and 99.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.74ms. Allocated memory is still 169.9MB. Free memory was 99.6MB in the beginning and 96.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.29ms. Allocated memory is still 169.9MB. Free memory was 96.6MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1365.62ms. Allocated memory is still 169.9MB. Free memory was 94.5MB in the beginning and 129.1MB in the end (delta: -34.6MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20254.17ms. Allocated memory was 169.9MB in the beginning and 450.9MB in the end (delta: 281.0MB). Free memory was 128.2MB in the beginning and 310.2MB in the end (delta: -182.0MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. * Witness Printer took 143.30ms. Allocated memory is still 450.9MB. Free memory was 310.2MB in the beginning and 294.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 136 PlacesBefore, 34 PlacesAfterwards, 129 TransitionsBefore, 25 TransitionsAfterwards, 2190 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 5168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2188, independent: 2001, independent conditional: 0, independent unconditional: 2001, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1126, independent: 1094, independent conditional: 0, independent unconditional: 1094, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2188, independent: 907, independent conditional: 0, independent unconditional: 907, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 1126, unknown conditional: 0, unknown unconditional: 1126] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y={3:0}, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={7:0}, t2053={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y={3:0}, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y={3:0}, z=0] [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y={3:0}, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y={3:0}, z=1] [L777] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] 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) [L792] 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) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 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 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 405 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 318 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1254 IncrementalHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 51 mSDtfsCounter, 1254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=8, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2023-11-19 07:39:15,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2dc3009-6e8d-47e9-bea2-62c662ec3083/bin/uautomizer-verify-uCwYo4JHxu/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