./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:30:00,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:30:00,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:30:00,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:30:00,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:30:00,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:30:00,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:30:00,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:30:00,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:30:00,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:30:00,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:30:00,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:30:00,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:30:00,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:30:00,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:30:00,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:30:00,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:30:00,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:30:00,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:30:00,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:30:00,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:30:00,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:30:00,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:30:00,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:30:00,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:30:00,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:30:00,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:30:00,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:30:00,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:30:00,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:30:00,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:30:00,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:30:00,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:30:00,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:30:00,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:30:00,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:30:00,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:30:00,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:30:00,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:30:00,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:30:00,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:30:00,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:30:00,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:30:00,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:30:00,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:30:00,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:30:00,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:30:00,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:30:00,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:30:00,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:30:00,841 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:30:00,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:30:00,842 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:30:00,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:30:00,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:30:00,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:30:00,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:30:00,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:30:00,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:30:00,844 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:30:00,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:30:00,844 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:30:00,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:30:00,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:30:00,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:30:00,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:30:00,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:00,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:30:00,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:30:00,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:30:00,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:30:00,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:30:00,848 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:30:00,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:30:00,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:30:00,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/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_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2022-11-20 10:30:01,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:30:01,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:30:01,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:30:01,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:30:01,182 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:30:01,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-11-20 10:30:04,236 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:30:04,569 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:30:04,569 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-11-20 10:30:04,584 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/data/8ed47a470/6f7be05ca7af4a0081ddc7765bcdbeac/FLAG62ec0e4eb [2022-11-20 10:30:04,600 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/data/8ed47a470/6f7be05ca7af4a0081ddc7765bcdbeac [2022-11-20 10:30:04,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:30:04,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:30:04,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:04,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:30:04,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:30:04,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:04" (1/1) ... [2022-11-20 10:30:04,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc08b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:04, skipping insertion in model container [2022-11-20 10:30:04,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:04" (1/1) ... [2022-11-20 10:30:04,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:30:04,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:30:04,851 WARN L237 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_23a28c80-cbf4-424e-927e-4ad614c9cc12/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2022-11-20 10:30:05,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:05,209 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:30:05,226 WARN L237 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_23a28c80-cbf4-424e-927e-4ad614c9cc12/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2022-11-20 10:30:05,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:05,349 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:30:05,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05 WrapperNode [2022-11-20 10:30:05,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:05,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:05,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:30:05,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:30:05,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,438 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-11-20 10:30:05,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:05,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:30:05,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:30:05,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:30:05,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,515 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:30:05,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:30:05,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:30:05,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:30:05,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:05,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:05,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:30:05,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:30:05,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:30:05,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:30:05,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:30:05,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:30:05,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:30:05,614 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:30:05,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:30:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:30:05,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:30:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:30:05,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:30:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 10:30:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 10:30:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:30:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:30:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:30:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:30:05,619 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:30:05,847 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:30:05,849 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:30:06,235 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:30:06,592 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:30:06,598 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:30:06,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:06 BoogieIcfgContainer [2022-11-20 10:30:06,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:30:06,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:30:06,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:30:06,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:30:06,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:30:04" (1/3) ... [2022-11-20 10:30:06,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc87c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:06, skipping insertion in model container [2022-11-20 10:30:06,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (2/3) ... [2022-11-20 10:30:06,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc87c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:06, skipping insertion in model container [2022-11-20 10:30:06,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:06" (3/3) ... [2022-11-20 10:30:06,614 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2022-11-20 10:30:06,624 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:30:06,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:30:06,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 10:30:06,635 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:30:06,742 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:30:06,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-20 10:30:06,904 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-20 10:30:06,904 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:30:06,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-20 10:30:06,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-20 10:30:06,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-20 10:30:06,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:30:06,946 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b20b565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:30:06,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-20 10:30:06,975 INFO L130 PetriNetUnfolder]: 0/91 cut-off events. [2022-11-20 10:30:06,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:30:06,976 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:06,976 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:06,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1688984883, now seen corresponding path program 1 times [2022-11-20 10:30:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:06,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203999481] [2022-11-20 10:30:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:07,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:07,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203999481] [2022-11-20 10:30:07,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203999481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:07,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:07,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:30:07,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000666191] [2022-11-20 10:30:07,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:07,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:30:07,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:07,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:07,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:07,809 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 136 [2022-11-20 10:30:07,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:07,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:07,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 136 [2022-11-20 10:30:07,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:07,917 INFO L130 PetriNetUnfolder]: 14/171 cut-off events. [2022-11-20 10:30:07,917 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-20 10:30:07,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 171 events. 14/171 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 270 event pairs, 2 based on Foata normal form. 5/167 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2022-11-20 10:30:07,920 INFO L137 encePairwiseOnDemand]: 131/136 looper letters, 10 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2022-11-20 10:30:07,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 130 transitions, 296 flow [2022-11-20 10:30:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:30:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-11-20 10:30:07,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9387254901960784 [2022-11-20 10:30:07,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2022-11-20 10:30:07,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2022-11-20 10:30:07,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:07,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2022-11-20 10:30:07,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:07,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:07,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:07,954 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 383 transitions. [2022-11-20 10:30:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 130 transitions, 296 flow [2022-11-20 10:30:07,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 130 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:30:07,962 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-11-20 10:30:07,964 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-11-20 10:30:07,968 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-11-20 10:30:07,968 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-11-20 10:30:07,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:07,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:07,969 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:07,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:30:07,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1006109590, now seen corresponding path program 1 times [2022-11-20 10:30:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:07,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844020819] [2022-11-20 10:30:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:07,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:08,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:08,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844020819] [2022-11-20 10:30:08,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844020819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:08,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:08,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:30:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801869379] [2022-11-20 10:30:08,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:08,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:30:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:08,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:30:08,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:08,609 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2022-11-20 10:30:08,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:08,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:08,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2022-11-20 10:30:08,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:09,595 INFO L130 PetriNetUnfolder]: 910/2279 cut-off events. [2022-11-20 10:30:09,595 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-20 10:30:09,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3723 conditions, 2279 events. 910/2279 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16279 event pairs, 178 based on Foata normal form. 0/2216 useless extension candidates. Maximal degree in co-relation 3661. Up to 604 conditions per place. [2022-11-20 10:30:09,621 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 25 selfloop transitions, 2 changer transitions 53/171 dead transitions. [2022-11-20 10:30:09,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 171 transitions, 494 flow [2022-11-20 10:30:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:30:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1041 transitions. [2022-11-20 10:30:09,629 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8504901960784313 [2022-11-20 10:30:09,630 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1041 transitions. [2022-11-20 10:30:09,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1041 transitions. [2022-11-20 10:30:09,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:09,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1041 transitions. [2022-11-20 10:30:09,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,641 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,642 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1041 transitions. [2022-11-20 10:30:09,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 171 transitions, 494 flow [2022-11-20 10:30:09,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 171 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:30:09,649 INFO L231 Difference]: Finished difference. Result has 152 places, 114 transitions, 256 flow [2022-11-20 10:30:09,650 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=152, PETRI_TRANSITIONS=114} [2022-11-20 10:30:09,651 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-11-20 10:30:09,652 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 114 transitions, 256 flow [2022-11-20 10:30:09,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,653 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:09,653 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:09,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:30:09,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:09,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash -333329413, now seen corresponding path program 1 times [2022-11-20 10:30:09,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505911848] [2022-11-20 10:30:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:10,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:10,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505911848] [2022-11-20 10:30:10,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505911848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:10,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:10,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:30:10,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908841687] [2022-11-20 10:30:10,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:10,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:10,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:10,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:10,086 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-20 10:30:10,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 114 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:10,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-20 10:30:10,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:10,928 INFO L130 PetriNetUnfolder]: 1614/2988 cut-off events. [2022-11-20 10:30:10,929 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2022-11-20 10:30:10,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2988 events. 1614/2988 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 20383 event pairs, 72 based on Foata normal form. 0/2925 useless extension candidates. Maximal degree in co-relation 5838. Up to 1009 conditions per place. [2022-11-20 10:30:10,952 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 32 selfloop transitions, 7 changer transitions 50/182 dead transitions. [2022-11-20 10:30:10,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 182 transitions, 597 flow [2022-11-20 10:30:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:30:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:30:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1201 transitions. [2022-11-20 10:30:10,957 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8830882352941176 [2022-11-20 10:30:10,957 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1201 transitions. [2022-11-20 10:30:10,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1201 transitions. [2022-11-20 10:30:10,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:10,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1201 transitions. [2022-11-20 10:30:10,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.1) internal successors, (1201), 10 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,967 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,967 INFO L175 Difference]: Start difference. First operand has 152 places, 114 transitions, 256 flow. Second operand 10 states and 1201 transitions. [2022-11-20 10:30:10,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 182 transitions, 597 flow [2022-11-20 10:30:10,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 182 transitions, 567 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-20 10:30:10,983 INFO L231 Difference]: Finished difference. Result has 139 places, 117 transitions, 306 flow [2022-11-20 10:30:10,984 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=306, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2022-11-20 10:30:10,986 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-11-20 10:30:10,987 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 306 flow [2022-11-20 10:30:10,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,988 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:10,988 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:10,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:30:10,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:10,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:10,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1331264978, now seen corresponding path program 1 times [2022-11-20 10:30:10,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:10,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327745087] [2022-11-20 10:30:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:11,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327745087] [2022-11-20 10:30:11,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327745087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:11,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:11,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:30:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302441773] [2022-11-20 10:30:11,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:11,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:30:11,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:11,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:30:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:11,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-20 10:30:11,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:11,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:11,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-20 10:30:11,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:12,161 INFO L130 PetriNetUnfolder]: 848/1837 cut-off events. [2022-11-20 10:30:12,161 INFO L131 PetriNetUnfolder]: For 2388/2404 co-relation queries the response was YES. [2022-11-20 10:30:12,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 1837 events. 848/1837 cut-off events. For 2388/2404 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12036 event pairs, 6 based on Foata normal form. 52/1885 useless extension candidates. Maximal degree in co-relation 5384. Up to 644 conditions per place. [2022-11-20 10:30:12,179 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 38 selfloop transitions, 11 changer transitions 39/181 dead transitions. [2022-11-20 10:30:12,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 181 transitions, 790 flow [2022-11-20 10:30:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:30:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 10:30:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1200 transitions. [2022-11-20 10:30:12,184 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-11-20 10:30:12,184 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1200 transitions. [2022-11-20 10:30:12,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1200 transitions. [2022-11-20 10:30:12,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:12,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1200 transitions. [2022-11-20 10:30:12,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:12,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:12,192 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:12,193 INFO L175 Difference]: Start difference. First operand has 139 places, 117 transitions, 306 flow. Second operand 10 states and 1200 transitions. [2022-11-20 10:30:12,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 181 transitions, 790 flow [2022-11-20 10:30:12,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 181 transitions, 765 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-20 10:30:12,204 INFO L231 Difference]: Finished difference. Result has 143 places, 121 transitions, 394 flow [2022-11-20 10:30:12,205 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=394, PETRI_PLACES=143, PETRI_TRANSITIONS=121} [2022-11-20 10:30:12,206 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2022-11-20 10:30:12,206 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 121 transitions, 394 flow [2022-11-20 10:30:12,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:12,207 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:12,207 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:12,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:30:12,208 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash -768985580, now seen corresponding path program 1 times [2022-11-20 10:30:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:12,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698888759] [2022-11-20 10:30:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:12,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698888759] [2022-11-20 10:30:12,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698888759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:12,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:12,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176675743] [2022-11-20 10:30:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:12,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:30:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:30:12,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:30:12,596 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-20 10:30:12,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 121 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:12,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:12,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-20 10:30:12,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:13,133 INFO L130 PetriNetUnfolder]: 353/935 cut-off events. [2022-11-20 10:30:13,133 INFO L131 PetriNetUnfolder]: For 3279/3295 co-relation queries the response was YES. [2022-11-20 10:30:13,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 935 events. 353/935 cut-off events. For 3279/3295 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5169 event pairs, 12 based on Foata normal form. 30/961 useless extension candidates. Maximal degree in co-relation 3244. Up to 289 conditions per place. [2022-11-20 10:30:13,143 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 43 selfloop transitions, 15 changer transitions 39/190 dead transitions. [2022-11-20 10:30:13,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 190 transitions, 1062 flow [2022-11-20 10:30:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:30:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:30:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1320 transitions. [2022-11-20 10:30:13,147 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-11-20 10:30:13,147 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1320 transitions. [2022-11-20 10:30:13,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1320 transitions. [2022-11-20 10:30:13,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:13,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1320 transitions. [2022-11-20 10:30:13,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:13,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:13,155 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:13,155 INFO L175 Difference]: Start difference. First operand has 143 places, 121 transitions, 394 flow. Second operand 11 states and 1320 transitions. [2022-11-20 10:30:13,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 190 transitions, 1062 flow [2022-11-20 10:30:13,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 190 transitions, 882 flow, removed 79 selfloop flow, removed 9 redundant places. [2022-11-20 10:30:13,169 INFO L231 Difference]: Finished difference. Result has 146 places, 125 transitions, 444 flow [2022-11-20 10:30:13,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=444, PETRI_PLACES=146, PETRI_TRANSITIONS=125} [2022-11-20 10:30:13,170 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 3 predicate places. [2022-11-20 10:30:13,170 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 125 transitions, 444 flow [2022-11-20 10:30:13,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:13,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:13,171 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:13,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:30:13,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:13,172 INFO L85 PathProgramCache]: Analyzing trace with hash -984036074, now seen corresponding path program 1 times [2022-11-20 10:30:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:13,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085936629] [2022-11-20 10:30:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:13,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:13,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085936629] [2022-11-20 10:30:13,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085936629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:13,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:13,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114117351] [2022-11-20 10:30:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:13,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:30:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:30:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:30:13,571 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2022-11-20 10:30:13,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 125 transitions, 444 flow. Second operand has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:13,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:13,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2022-11-20 10:30:13,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:14,032 INFO L130 PetriNetUnfolder]: 309/1122 cut-off events. [2022-11-20 10:30:14,032 INFO L131 PetriNetUnfolder]: For 2688/2889 co-relation queries the response was YES. [2022-11-20 10:30:14,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 1122 events. 309/1122 cut-off events. For 2688/2889 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7288 event pairs, 34 based on Foata normal form. 41/1126 useless extension candidates. Maximal degree in co-relation 2783. Up to 236 conditions per place. [2022-11-20 10:30:14,045 INFO L137 encePairwiseOnDemand]: 128/136 looper letters, 44 selfloop transitions, 4 changer transitions 17/165 dead transitions. [2022-11-20 10:30:14,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 165 transitions, 665 flow [2022-11-20 10:30:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:30:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:30:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 914 transitions. [2022-11-20 10:30:14,048 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8400735294117647 [2022-11-20 10:30:14,049 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 914 transitions. [2022-11-20 10:30:14,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 914 transitions. [2022-11-20 10:30:14,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:14,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 914 transitions. [2022-11-20 10:30:14,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:14,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 136.0) internal successors, (1224), 9 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:14,056 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 136.0) internal successors, (1224), 9 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:14,056 INFO L175 Difference]: Start difference. First operand has 146 places, 125 transitions, 444 flow. Second operand 8 states and 914 transitions. [2022-11-20 10:30:14,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 165 transitions, 665 flow [2022-11-20 10:30:14,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 165 transitions, 580 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-11-20 10:30:14,072 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 382 flow [2022-11-20 10:30:14,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=382, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2022-11-20 10:30:14,075 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 1 predicate places. [2022-11-20 10:30:14,076 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 382 flow [2022-11-20 10:30:14,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:14,077 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:14,077 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:14,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:30:14,078 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:14,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1209214124, now seen corresponding path program 2 times [2022-11-20 10:30:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:14,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532410620] [2022-11-20 10:30:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:14,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:14,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532410620] [2022-11-20 10:30:14,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532410620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:14,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:14,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:30:14,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274418967] [2022-11-20 10:30:14,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:14,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:30:14,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:30:14,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:14,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2022-11-20 10:30:14,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:14,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:14,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2022-11-20 10:30:14,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:15,190 INFO L130 PetriNetUnfolder]: 470/1854 cut-off events. [2022-11-20 10:30:15,191 INFO L131 PetriNetUnfolder]: For 1862/2067 co-relation queries the response was YES. [2022-11-20 10:30:15,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 1854 events. 470/1854 cut-off events. For 1862/2067 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 14541 event pairs, 114 based on Foata normal form. 73/1858 useless extension candidates. Maximal degree in co-relation 3929. Up to 323 conditions per place. [2022-11-20 10:30:15,207 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 46 selfloop transitions, 8 changer transitions 22/176 dead transitions. [2022-11-20 10:30:15,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 176 transitions, 694 flow [2022-11-20 10:30:15,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:30:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:30:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1242 transitions. [2022-11-20 10:30:15,212 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8302139037433155 [2022-11-20 10:30:15,212 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1242 transitions. [2022-11-20 10:30:15,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1242 transitions. [2022-11-20 10:30:15,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:15,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1242 transitions. [2022-11-20 10:30:15,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.9090909090909) internal successors, (1242), 11 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:15,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:15,222 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:15,222 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 382 flow. Second operand 11 states and 1242 transitions. [2022-11-20 10:30:15,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 176 transitions, 694 flow [2022-11-20 10:30:15,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 176 transitions, 663 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-11-20 10:30:15,243 INFO L231 Difference]: Finished difference. Result has 154 places, 131 transitions, 455 flow [2022-11-20 10:30:15,243 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=455, PETRI_PLACES=154, PETRI_TRANSITIONS=131} [2022-11-20 10:30:15,244 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 11 predicate places. [2022-11-20 10:30:15,244 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 131 transitions, 455 flow [2022-11-20 10:30:15,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:15,245 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:15,245 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:15,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:30:15,245 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash -893109934, now seen corresponding path program 3 times [2022-11-20 10:30:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:15,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604208870] [2022-11-20 10:30:15,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:15,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:15,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:15,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604208870] [2022-11-20 10:30:15,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604208870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:15,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:15,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:30:15,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4019450] [2022-11-20 10:30:15,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:15,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:15,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:15,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:15,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:15,633 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-20 10:30:15,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 131 transitions, 455 flow. Second operand has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:15,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:15,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-20 10:30:15,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:16,259 INFO L130 PetriNetUnfolder]: 675/1916 cut-off events. [2022-11-20 10:30:16,259 INFO L131 PetriNetUnfolder]: For 3855/4274 co-relation queries the response was YES. [2022-11-20 10:30:16,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5807 conditions, 1916 events. 675/1916 cut-off events. For 3855/4274 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14667 event pairs, 69 based on Foata normal form. 172/1996 useless extension candidates. Maximal degree in co-relation 5784. Up to 359 conditions per place. [2022-11-20 10:30:16,277 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 32 selfloop transitions, 21 changer transitions 32/182 dead transitions. [2022-11-20 10:30:16,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 182 transitions, 936 flow [2022-11-20 10:30:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:30:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 10:30:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1407 transitions. [2022-11-20 10:30:16,281 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8621323529411765 [2022-11-20 10:30:16,281 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1407 transitions. [2022-11-20 10:30:16,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1407 transitions. [2022-11-20 10:30:16,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:16,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1407 transitions. [2022-11-20 10:30:16,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.25) internal successors, (1407), 12 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:16,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:16,290 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:16,290 INFO L175 Difference]: Start difference. First operand has 154 places, 131 transitions, 455 flow. Second operand 12 states and 1407 transitions. [2022-11-20 10:30:16,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 182 transitions, 936 flow [2022-11-20 10:30:16,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 182 transitions, 880 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-11-20 10:30:16,317 INFO L231 Difference]: Finished difference. Result has 159 places, 134 transitions, 513 flow [2022-11-20 10:30:16,318 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=513, PETRI_PLACES=159, PETRI_TRANSITIONS=134} [2022-11-20 10:30:16,320 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 16 predicate places. [2022-11-20 10:30:16,321 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 134 transitions, 513 flow [2022-11-20 10:30:16,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:16,321 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:16,322 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:16,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:30:16,324 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1170417064, now seen corresponding path program 1 times [2022-11-20 10:30:16,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:16,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891121003] [2022-11-20 10:30:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:16,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891121003] [2022-11-20 10:30:16,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891121003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:16,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:16,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:30:16,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167577786] [2022-11-20 10:30:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:16,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:30:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:30:16,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:16,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-11-20 10:30:16,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 134 transitions, 513 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:16,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:16,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-11-20 10:30:16,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:17,254 INFO L130 PetriNetUnfolder]: 464/2011 cut-off events. [2022-11-20 10:30:17,255 INFO L131 PetriNetUnfolder]: For 3884/4187 co-relation queries the response was YES. [2022-11-20 10:30:17,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5722 conditions, 2011 events. 464/2011 cut-off events. For 3884/4187 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18351 event pairs, 36 based on Foata normal form. 4/1919 useless extension candidates. Maximal degree in co-relation 5643. Up to 402 conditions per place. [2022-11-20 10:30:17,275 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 26 selfloop transitions, 1 changer transitions 14/153 dead transitions. [2022-11-20 10:30:17,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 153 transitions, 677 flow [2022-11-20 10:30:17,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:30:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:30:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2022-11-20 10:30:17,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8602941176470589 [2022-11-20 10:30:17,278 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2022-11-20 10:30:17,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2022-11-20 10:30:17,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:17,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2022-11-20 10:30:17,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:17,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:17,284 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:17,284 INFO L175 Difference]: Start difference. First operand has 159 places, 134 transitions, 513 flow. Second operand 7 states and 819 transitions. [2022-11-20 10:30:17,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 153 transitions, 677 flow [2022-11-20 10:30:17,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 153 transitions, 574 flow, removed 39 selfloop flow, removed 12 redundant places. [2022-11-20 10:30:17,321 INFO L231 Difference]: Finished difference. Result has 156 places, 134 transitions, 437 flow [2022-11-20 10:30:17,321 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=156, PETRI_TRANSITIONS=134} [2022-11-20 10:30:17,322 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 13 predicate places. [2022-11-20 10:30:17,322 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 134 transitions, 437 flow [2022-11-20 10:30:17,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:17,323 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:17,323 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:17,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:30:17,324 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:17,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1398560666, now seen corresponding path program 2 times [2022-11-20 10:30:17,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:17,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226954286] [2022-11-20 10:30:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:19,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:19,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226954286] [2022-11-20 10:30:19,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226954286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:19,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:19,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:30:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767334588] [2022-11-20 10:30:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:19,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:30:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:19,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:30:19,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:30:19,214 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2022-11-20 10:30:19,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 134 transitions, 437 flow. Second operand has 11 states, 11 states have (on average 110.0909090909091) internal successors, (1211), 11 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:19,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:19,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2022-11-20 10:30:19,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:19,725 INFO L130 PetriNetUnfolder]: 286/1425 cut-off events. [2022-11-20 10:30:19,725 INFO L131 PetriNetUnfolder]: For 857/953 co-relation queries the response was YES. [2022-11-20 10:30:19,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 1425 events. 286/1425 cut-off events. For 857/953 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12293 event pairs, 8 based on Foata normal form. 7/1367 useless extension candidates. Maximal degree in co-relation 3124. Up to 199 conditions per place. [2022-11-20 10:30:19,734 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 18 selfloop transitions, 8 changer transitions 12/145 dead transitions. [2022-11-20 10:30:19,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 145 transitions, 559 flow [2022-11-20 10:30:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:30:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 10:30:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1328 transitions. [2022-11-20 10:30:19,738 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8137254901960784 [2022-11-20 10:30:19,738 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1328 transitions. [2022-11-20 10:30:19,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1328 transitions. [2022-11-20 10:30:19,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:19,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1328 transitions. [2022-11-20 10:30:19,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 110.66666666666667) internal successors, (1328), 12 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:19,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:19,746 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:19,746 INFO L175 Difference]: Start difference. First operand has 156 places, 134 transitions, 437 flow. Second operand 12 states and 1328 transitions. [2022-11-20 10:30:19,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 145 transitions, 559 flow [2022-11-20 10:30:19,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 145 transitions, 517 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-11-20 10:30:19,763 INFO L231 Difference]: Finished difference. Result has 160 places, 133 transitions, 419 flow [2022-11-20 10:30:19,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=419, PETRI_PLACES=160, PETRI_TRANSITIONS=133} [2022-11-20 10:30:19,764 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 17 predicate places. [2022-11-20 10:30:19,765 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 133 transitions, 419 flow [2022-11-20 10:30:19,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.0909090909091) internal successors, (1211), 11 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:19,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:19,766 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:19,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:30:19,766 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 10:30:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash -779097472, now seen corresponding path program 3 times [2022-11-20 10:30:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:19,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026808269] [2022-11-20 10:30:19,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:19,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:19,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:19,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:19,991 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:30:19,993 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-20 10:30:19,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-20 10:30:19,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-20 10:30:19,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-20 10:30:19,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-20 10:30:19,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-20 10:30:19,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-20 10:30:19,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:30:19,996 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-11-20 10:30:20,003 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:30:20,003 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:30:20,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:30:20 BasicIcfg [2022-11-20 10:30:20,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:30:20,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:30:20,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:30:20,167 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:30:20,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:06" (3/4) ... [2022-11-20 10:30:20,177 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:30:20,353 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:30:20,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:30:20,353 INFO L158 Benchmark]: Toolchain (without parser) took 15749.36ms. Allocated memory was 155.2MB in the beginning and 320.9MB in the end (delta: 165.7MB). Free memory was 109.7MB in the beginning and 140.0MB in the end (delta: -30.3MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2022-11-20 10:30:20,354 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 83.7MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:30:20,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.92ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 85.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 10:30:20,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.60ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 82.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:30:20,355 INFO L158 Benchmark]: Boogie Preprocessor took 70.85ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:30:20,355 INFO L158 Benchmark]: RCFGBuilder took 1081.24ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 92.8MB in the end (delta: -12.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-11-20 10:30:20,356 INFO L158 Benchmark]: TraceAbstraction took 13562.43ms. Allocated memory was 155.2MB in the beginning and 320.9MB in the end (delta: 165.7MB). Free memory was 92.3MB in the beginning and 176.7MB in the end (delta: -84.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2022-11-20 10:30:20,356 INFO L158 Benchmark]: Witness Printer took 185.90ms. Allocated memory is still 320.9MB. Free memory was 176.7MB in the beginning and 140.0MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-20 10:30:20,358 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 83.7MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.92ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 85.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.60ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 82.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.85ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1081.24ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 92.8MB in the end (delta: -12.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13562.43ms. Allocated memory was 155.2MB in the beginning and 320.9MB in the end (delta: 165.7MB). Free memory was 92.3MB in the beginning and 176.7MB in the end (delta: -84.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 185.90ms. Allocated memory is still 320.9MB. Free memory was 176.7MB in the beginning and 140.0MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t445; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-3, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t446; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-2, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t447; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=-1, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] 0 pthread_t t448; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 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: 13.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1292 IncrementalHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 117 mSDtfsCounter, 1292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=513occurred in iteration=8, InterpolantAutomatonStates: 93, 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.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 942 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2022-11-20 10:30:20,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23a28c80-cbf4-424e-927e-4ad614c9cc12/bin/uautomizer-ug76WZFUDN/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