./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8 --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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- 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-2329fc7 [2022-12-13 12:52:32,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:52:32,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:52:32,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:52:32,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:52:32,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:52:32,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:52:32,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:52:32,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:52:32,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:52:32,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:52:32,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:52:32,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:52:32,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:52:32,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:52:32,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:52:32,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:52:32,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:52:32,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:52:32,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:52:32,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:52:32,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:52:32,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:52:32,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:52:32,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:52:32,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:52:32,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:52:32,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:52:32,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:52:32,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:52:32,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:52:32,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:52:32,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:52:32,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:52:32,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:52:32,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:52:32,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:52:32,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:52:32,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:52:32,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:52:32,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:52:32,805 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:52:32,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:52:32,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:52:32,827 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:52:32,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:52:32,828 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:52:32,828 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:52:32,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:52:32,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:52:32,829 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:52:32,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:52:32,830 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:52:32,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:52:32,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:52:32,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:52:32,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:52:32,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:52:32,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:52:32,831 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:52:32,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:52:32,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:52:32,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:52:32,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:52:32,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:52:32,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:52:32,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:52:32,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:52:32,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:52:32,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:52:32,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:52:32,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:52:32,839 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:52:32,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:52:32,840 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:52:32,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:52:32,840 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:52:32,840 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/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_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8 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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2022-12-13 12:52:33,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:52:33,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:52:33,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:52:33,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:52:33,059 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:52:33,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-12-13 12:52:35,599 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:52:35,761 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:52:35,762 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-12-13 12:52:35,771 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/data/b8673b4f3/06fa32f5dc944ef69164eebdf26e0750/FLAG76ca815c8 [2022-12-13 12:52:35,781 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/data/b8673b4f3/06fa32f5dc944ef69164eebdf26e0750 [2022-12-13 12:52:35,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:52:35,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:52:35,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:52:35,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:52:35,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:52:35,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:35" (1/1) ... [2022-12-13 12:52:35,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d84f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:35, skipping insertion in model container [2022-12-13 12:52:35,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:35" (1/1) ... [2022-12-13 12:52:35,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:52:35,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:52:35,963 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_939f443c-a3b3-4826-905b-029708d38a28/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-12-13 12:52:36,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:52:36,103 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:52:36,112 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_939f443c-a3b3-4826-905b-029708d38a28/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-12-13 12:52:36,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:52:36,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:52:36,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:52:36,175 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:52:36,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36 WrapperNode [2022-12-13 12:52:36,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:52:36,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:52:36,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:52:36,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:52:36,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,209 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 12:52:36,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:52:36,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:52:36,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:52:36,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:52:36,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,229 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:52:36,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:52:36,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:52:36,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:52:36,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (1/1) ... [2022-12-13 12:52:36,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:52:36,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:52:36,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:52:36,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:52:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:52:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:52:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:52:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:52:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:52:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:52:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:52:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:52:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:52:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:52:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:52:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:52:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:52:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:52:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:52:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:52:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:52:36,303 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 12:52:36,413 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:52:36,414 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:52:36,682 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:52:36,782 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:52:36,782 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:52:36,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:36 BoogieIcfgContainer [2022-12-13 12:52:36,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:52:36,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:52:36,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:52:36,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:52:36,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:52:35" (1/3) ... [2022-12-13 12:52:36,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d119588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:36, skipping insertion in model container [2022-12-13 12:52:36,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:36" (2/3) ... [2022-12-13 12:52:36,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d119588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:36, skipping insertion in model container [2022-12-13 12:52:36,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:36" (3/3) ... [2022-12-13 12:52:36,791 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2022-12-13 12:52:36,798 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 12:52:36,805 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:52:36,805 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:52:36,805 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:52:36,862 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:52:36,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 12:52:36,969 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 12:52:36,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:52:36,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 12:52:36,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 12:52:36,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-12-13 12:52:36,984 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:52:36,992 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 12:52:36,994 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 12:52:36,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-12-13 12:52:37,013 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 12:52:37,013 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:52:37,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 12:52:37,015 INFO L119 LiptonReduction]: Number of co-enabled transitions 3232 [2022-12-13 12:52:39,767 INFO L134 LiptonReduction]: Checked pairs total: 8817 [2022-12-13 12:52:39,767 INFO L136 LiptonReduction]: Total number of compositions: 113 [2022-12-13 12:52:39,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:52:39,781 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;@705f5b6a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:52:39,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 12:52:39,784 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 12:52:39,784 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:52:39,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:39,784 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:52:39,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 533716314, now seen corresponding path program 1 times [2022-12-13 12:52:39,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:39,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609486847] [2022-12-13 12:52:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:39,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:40,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609486847] [2022-12-13 12:52:40,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609486847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:40,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:40,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:52:40,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678772498] [2022-12-13 12:52:40,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:40,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:52:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:52:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:52:40,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 250 [2022-12-13 12:52:40,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-12-13 12:52:40,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:40,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 250 [2022-12-13 12:52:40,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:41,006 INFO L130 PetriNetUnfolder]: 5463/7588 cut-off events. [2022-12-13 12:52:41,006 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-13 12:52:41,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15188 conditions, 7588 events. 5463/7588 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 38439 event pairs, 2045 based on Foata normal form. 256/7264 useless extension candidates. Maximal degree in co-relation 15176. Up to 5923 conditions per place. [2022-12-13 12:52:41,036 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2022-12-13 12:52:41,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2022-12-13 12:52:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:52:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:52:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2022-12-13 12:52:41,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.552 [2022-12-13 12:52:41,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2022-12-13 12:52:41,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2022-12-13 12:52:41,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:41,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2022-12-13 12:52:41,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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-12-13 12:52:41,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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-12-13 12:52:41,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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-12-13 12:52:41,060 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 414 transitions. [2022-12-13 12:52:41,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2022-12-13 12:52:41,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:52:41,064 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-12-13 12:52:41,066 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 12:52:41,068 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-12-13 12:52:41,069 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-12-13 12:52:41,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-12-13 12:52:41,069 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:41,069 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:41,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:52:41,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:41,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1177868292, now seen corresponding path program 1 times [2022-12-13 12:52:41,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:41,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149674213] [2022-12-13 12:52:41,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:41,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149674213] [2022-12-13 12:52:41,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149674213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:41,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:41,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:52:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046180131] [2022-12-13 12:52:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:41,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:52:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:52:41,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:52:41,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 250 [2022-12-13 12:52:41,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-12-13 12:52:41,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:41,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 250 [2022-12-13 12:52:41,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:43,346 INFO L130 PetriNetUnfolder]: 16497/22490 cut-off events. [2022-12-13 12:52:43,346 INFO L131 PetriNetUnfolder]: For 1154/1154 co-relation queries the response was YES. [2022-12-13 12:52:43,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46486 conditions, 22490 events. 16497/22490 cut-off events. For 1154/1154 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 119233 event pairs, 5291 based on Foata normal form. 948/23438 useless extension candidates. Maximal degree in co-relation 46476. Up to 13271 conditions per place. [2022-12-13 12:52:43,431 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 46 selfloop transitions, 7 changer transitions 33/86 dead transitions. [2022-12-13 12:52:43,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 86 transitions, 368 flow [2022-12-13 12:52:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:52:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:52:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2022-12-13 12:52:43,435 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5184 [2022-12-13 12:52:43,435 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2022-12-13 12:52:43,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2022-12-13 12:52:43,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:43,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2022-12-13 12:52:43,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 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-12-13 12:52:43,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-12-13 12:52:43,441 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-12-13 12:52:43,441 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 648 transitions. [2022-12-13 12:52:43,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 86 transitions, 368 flow [2022-12-13 12:52:43,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 86 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:52:43,444 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 134 flow [2022-12-13 12:52:43,444 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 12:52:43,444 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2022-12-13 12:52:43,445 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 134 flow [2022-12-13 12:52:43,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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-12-13 12:52:43,445 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:43,445 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:43,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:52:43,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2140737301, now seen corresponding path program 1 times [2022-12-13 12:52:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:43,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089049487] [2022-12-13 12:52:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:43,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:43,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089049487] [2022-12-13 12:52:43,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089049487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:43,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:43,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:52:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109869784] [2022-12-13 12:52:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:52:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:52:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:52:43,613 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 250 [2022-12-13 12:52:43,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 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-12-13 12:52:43,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:43,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 250 [2022-12-13 12:52:43,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:45,431 INFO L130 PetriNetUnfolder]: 14489/19886 cut-off events. [2022-12-13 12:52:45,431 INFO L131 PetriNetUnfolder]: For 12024/12024 co-relation queries the response was YES. [2022-12-13 12:52:45,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52434 conditions, 19886 events. 14489/19886 cut-off events. For 12024/12024 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 103370 event pairs, 3175 based on Foata normal form. 928/20814 useless extension candidates. Maximal degree in co-relation 52420. Up to 8721 conditions per place. [2022-12-13 12:52:45,485 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 54 selfloop transitions, 7 changer transitions 44/105 dead transitions. [2022-12-13 12:52:45,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 105 transitions, 576 flow [2022-12-13 12:52:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:52:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:52:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2022-12-13 12:52:45,489 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5045714285714286 [2022-12-13 12:52:45,489 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2022-12-13 12:52:45,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2022-12-13 12:52:45,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:45,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2022-12-13 12:52:45,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 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-12-13 12:52:45,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-12-13 12:52:45,500 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-12-13 12:52:45,500 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 134 flow. Second operand 7 states and 883 transitions. [2022-12-13 12:52:45,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 105 transitions, 576 flow [2022-12-13 12:52:45,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 105 transitions, 534 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 12:52:45,561 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 178 flow [2022-12-13 12:52:45,561 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-12-13 12:52:45,562 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2022-12-13 12:52:45,562 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 178 flow [2022-12-13 12:52:45,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 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-12-13 12:52:45,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:45,562 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:45,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:52:45,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash -232605342, now seen corresponding path program 1 times [2022-12-13 12:52:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:45,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470112923] [2022-12-13 12:52:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:45,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:45,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:45,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470112923] [2022-12-13 12:52:45,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470112923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:45,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:45,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:52:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802604222] [2022-12-13 12:52:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:45,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:52:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:52:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:52:45,683 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 250 [2022-12-13 12:52:45,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-12-13 12:52:45,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:45,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 250 [2022-12-13 12:52:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:46,273 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([409] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 158#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 166#true, 134#L3-1true, 97#L845true, 119#L770true, P2Thread1of1ForFork3InUse, Black: 170#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 69#P2EXITtrue, Black: 172#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#true, P3Thread1of1ForFork1InUse, Black: 169#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, Black: 168#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork0InUse, Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 138#L795true]) [2022-12-13 12:52:46,273 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 12:52:46,273 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:52:46,273 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:52:46,273 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:52:46,347 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([409] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 158#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 166#true, 134#L3-1true, 97#L845true, P2Thread1of1ForFork3InUse, Black: 170#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 69#P2EXITtrue, Black: 172#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#true, P3Thread1of1ForFork1InUse, Black: 169#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 124#P0EXITtrue, P1Thread1of1ForFork2InUse, Black: 168#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork0InUse, Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 138#L795true]) [2022-12-13 12:52:46,347 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,348 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,348 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,348 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([409] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 158#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 166#true, 97#L845true, 119#L770true, P2Thread1of1ForFork3InUse, Black: 170#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 69#P2EXITtrue, Black: 172#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#true, P3Thread1of1ForFork1InUse, Black: 169#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, Black: 168#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork0InUse, Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L880true, 138#L795true]) [2022-12-13 12:52:46,349 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,349 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,349 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,349 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L880-->L19: Formula: (and (= (mod v_~main$tmp_guard1~0_10 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= v_~main$tmp_guard1~0_10 (ite (= (ite (not (and (= v_~__unbuffered_p3_EBX~0_8 0) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_8) (= v_~__unbuffered_p1_EAX~0_8 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][54], [Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 37#L19true, Black: 158#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 32#L838true, 166#true, 119#L770true, P2Thread1of1ForFork3InUse, Black: 170#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 69#P2EXITtrue, Black: 172#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#true, P3Thread1of1ForFork1InUse, Black: 169#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, Black: 168#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork0InUse, Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 138#L795true]) [2022-12-13 12:52:46,349 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,349 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,349 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,349 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 12:52:46,412 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([409] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 158#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 166#true, 97#L845true, P2Thread1of1ForFork3InUse, Black: 170#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 69#P2EXITtrue, Black: 172#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork1InUse, 182#true, Black: 169#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 124#P0EXITtrue, P1Thread1of1ForFork2InUse, Black: 168#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork0InUse, Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 39#L880true, 138#L795true]) [2022-12-13 12:52:46,412 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 12:52:46,412 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:52:46,412 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:52:46,412 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:52:46,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L880-->L19: Formula: (and (= (mod v_~main$tmp_guard1~0_10 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= v_~main$tmp_guard1~0_10 (ite (= (ite (not (and (= v_~__unbuffered_p3_EBX~0_8 0) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_8) (= v_~__unbuffered_p1_EAX~0_8 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][54], [Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 37#L19true, Black: 158#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 32#L838true, 166#true, P2Thread1of1ForFork3InUse, Black: 170#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), 69#P2EXITtrue, Black: 172#(and (= ~__unbuffered_p3_EAX~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork1InUse, 182#true, Black: 169#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 124#P0EXITtrue, P1Thread1of1ForFork2InUse, Black: 168#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork0InUse, Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 138#L795true]) [2022-12-13 12:52:46,413 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 12:52:46,413 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:52:46,413 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:52:46,413 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 12:52:46,557 INFO L130 PetriNetUnfolder]: 5862/8627 cut-off events. [2022-12-13 12:52:46,557 INFO L131 PetriNetUnfolder]: For 7268/7598 co-relation queries the response was YES. [2022-12-13 12:52:46,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22538 conditions, 8627 events. 5862/8627 cut-off events. For 7268/7598 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 48986 event pairs, 1392 based on Foata normal form. 277/8589 useless extension candidates. Maximal degree in co-relation 22518. Up to 7285 conditions per place. [2022-12-13 12:52:46,603 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 43 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2022-12-13 12:52:46,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 344 flow [2022-12-13 12:52:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:52:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:52:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-12-13 12:52:46,605 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5293333333333333 [2022-12-13 12:52:46,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2022-12-13 12:52:46,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2022-12-13 12:52:46,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:46,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2022-12-13 12:52:46,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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-12-13 12:52:46,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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-12-13 12:52:46,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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-12-13 12:52:46,611 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 178 flow. Second operand 3 states and 397 transitions. [2022-12-13 12:52:46,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 344 flow [2022-12-13 12:52:46,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 333 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 12:52:46,652 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 200 flow [2022-12-13 12:52:46,652 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-13 12:52:46,653 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2022-12-13 12:52:46,653 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 200 flow [2022-12-13 12:52:46,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-12-13 12:52:46,653 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:46,654 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:46,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:52:46,654 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1096666613, now seen corresponding path program 1 times [2022-12-13 12:52:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:46,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339408909] [2022-12-13 12:52:46,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:46,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339408909] [2022-12-13 12:52:46,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339408909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:46,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:46,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:52:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260734532] [2022-12-13 12:52:46,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:46,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:52:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:46,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:52:46,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:52:46,874 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 250 [2022-12-13 12:52:46,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 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-12-13 12:52:46,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:46,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 250 [2022-12-13 12:52:46,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:47,367 INFO L130 PetriNetUnfolder]: 2925/4603 cut-off events. [2022-12-13 12:52:47,367 INFO L131 PetriNetUnfolder]: For 2807/2897 co-relation queries the response was YES. [2022-12-13 12:52:47,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13362 conditions, 4603 events. 2925/4603 cut-off events. For 2807/2897 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 25729 event pairs, 592 based on Foata normal form. 301/4779 useless extension candidates. Maximal degree in co-relation 13342. Up to 2234 conditions per place. [2022-12-13 12:52:47,382 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 58 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2022-12-13 12:52:47,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 468 flow [2022-12-13 12:52:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:52:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:52:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2022-12-13 12:52:47,384 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.531 [2022-12-13 12:52:47,384 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2022-12-13 12:52:47,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2022-12-13 12:52:47,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:47,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2022-12-13 12:52:47,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 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-12-13 12:52:47,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 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-12-13 12:52:47,386 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 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-12-13 12:52:47,387 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 200 flow. Second operand 4 states and 531 transitions. [2022-12-13 12:52:47,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 468 flow [2022-12-13 12:52:47,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 453 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 12:52:47,394 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 241 flow [2022-12-13 12:52:47,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-13 12:52:47,395 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2022-12-13 12:52:47,395 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 241 flow [2022-12-13 12:52:47,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 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-12-13 12:52:47,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:47,396 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] [2022-12-13 12:52:47,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:52:47,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 467345196, now seen corresponding path program 1 times [2022-12-13 12:52:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:47,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340481978] [2022-12-13 12:52:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:47,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340481978] [2022-12-13 12:52:47,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340481978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:47,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:47,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:52:47,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167783478] [2022-12-13 12:52:47,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:47,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:52:47,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:47,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:52:47,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:52:47,571 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-12-13 12:52:47,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 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-12-13 12:52:47,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:47,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-12-13 12:52:47,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:48,613 INFO L130 PetriNetUnfolder]: 4764/7245 cut-off events. [2022-12-13 12:52:48,614 INFO L131 PetriNetUnfolder]: For 9909/9909 co-relation queries the response was YES. [2022-12-13 12:52:48,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24398 conditions, 7245 events. 4764/7245 cut-off events. For 9909/9909 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 39290 event pairs, 515 based on Foata normal form. 129/7374 useless extension candidates. Maximal degree in co-relation 24378. Up to 3346 conditions per place. [2022-12-13 12:52:48,639 INFO L137 encePairwiseOnDemand]: 240/250 looper letters, 111 selfloop transitions, 21 changer transitions 27/159 dead transitions. [2022-12-13 12:52:48,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 159 transitions, 1109 flow [2022-12-13 12:52:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:52:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:52:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2022-12-13 12:52:48,641 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5102857142857142 [2022-12-13 12:52:48,641 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2022-12-13 12:52:48,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2022-12-13 12:52:48,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:48,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2022-12-13 12:52:48,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 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-12-13 12:52:48,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-12-13 12:52:48,646 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-12-13 12:52:48,646 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 241 flow. Second operand 7 states and 893 transitions. [2022-12-13 12:52:48,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 159 transitions, 1109 flow [2022-12-13 12:52:48,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 159 transitions, 1051 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 12:52:48,657 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 393 flow [2022-12-13 12:52:48,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=393, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2022-12-13 12:52:48,658 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2022-12-13 12:52:48,658 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 393 flow [2022-12-13 12:52:48,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 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-12-13 12:52:48,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:48,658 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] [2022-12-13 12:52:48,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:52:48,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -714011422, now seen corresponding path program 2 times [2022-12-13 12:52:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:48,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126860150] [2022-12-13 12:52:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:48,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126860150] [2022-12-13 12:52:48,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126860150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:48,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:48,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:52:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065510048] [2022-12-13 12:52:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:48,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:52:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:48,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:52:48,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:52:48,919 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-12-13 12:52:48,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 393 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-12-13 12:52:48,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:48,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-12-13 12:52:48,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:50,213 INFO L130 PetriNetUnfolder]: 5766/8800 cut-off events. [2022-12-13 12:52:50,213 INFO L131 PetriNetUnfolder]: For 20686/20686 co-relation queries the response was YES. [2022-12-13 12:52:50,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32865 conditions, 8800 events. 5766/8800 cut-off events. For 20686/20686 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 49676 event pairs, 707 based on Foata normal form. 90/8890 useless extension candidates. Maximal degree in co-relation 32840. Up to 3174 conditions per place. [2022-12-13 12:52:50,243 INFO L137 encePairwiseOnDemand]: 240/250 looper letters, 122 selfloop transitions, 20 changer transitions 30/172 dead transitions. [2022-12-13 12:52:50,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 172 transitions, 1304 flow [2022-12-13 12:52:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:52:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:52:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 895 transitions. [2022-12-13 12:52:50,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5114285714285715 [2022-12-13 12:52:50,245 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 895 transitions. [2022-12-13 12:52:50,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 895 transitions. [2022-12-13 12:52:50,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:50,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 895 transitions. [2022-12-13 12:52:50,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 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-12-13 12:52:50,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-12-13 12:52:50,249 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-12-13 12:52:50,249 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 393 flow. Second operand 7 states and 895 transitions. [2022-12-13 12:52:50,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 172 transitions, 1304 flow [2022-12-13 12:52:50,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 172 transitions, 1270 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 12:52:50,323 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 431 flow [2022-12-13 12:52:50,323 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2022-12-13 12:52:50,323 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2022-12-13 12:52:50,323 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 431 flow [2022-12-13 12:52:50,324 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-12-13 12:52:50,324 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:50,324 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] [2022-12-13 12:52:50,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:52:50,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1819459708, now seen corresponding path program 3 times [2022-12-13 12:52:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:50,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959595815] [2022-12-13 12:52:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959595815] [2022-12-13 12:52:50,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959595815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:50,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:50,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:52:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482048263] [2022-12-13 12:52:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:50,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:52:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:52:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:52:50,468 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 250 [2022-12-13 12:52:50,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 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-12-13 12:52:50,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:50,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 250 [2022-12-13 12:52:50,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:51,053 INFO L130 PetriNetUnfolder]: 2998/4788 cut-off events. [2022-12-13 12:52:51,053 INFO L131 PetriNetUnfolder]: For 9530/9640 co-relation queries the response was YES. [2022-12-13 12:52:51,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16378 conditions, 4788 events. 2998/4788 cut-off events. For 9530/9640 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28152 event pairs, 563 based on Foata normal form. 297/4970 useless extension candidates. Maximal degree in co-relation 16351. Up to 1774 conditions per place. [2022-12-13 12:52:51,069 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 79 selfloop transitions, 13 changer transitions 2/113 dead transitions. [2022-12-13 12:52:51,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 940 flow [2022-12-13 12:52:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:52:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:52:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2022-12-13 12:52:51,070 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5304 [2022-12-13 12:52:51,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2022-12-13 12:52:51,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2022-12-13 12:52:51,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:51,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2022-12-13 12:52:51,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 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-12-13 12:52:51,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-12-13 12:52:51,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-12-13 12:52:51,073 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 431 flow. Second operand 5 states and 663 transitions. [2022-12-13 12:52:51,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 940 flow [2022-12-13 12:52:51,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 868 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 12:52:51,084 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 456 flow [2022-12-13 12:52:51,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=456, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2022-12-13 12:52:51,085 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-12-13 12:52:51,085 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 456 flow [2022-12-13 12:52:51,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 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-12-13 12:52:51,085 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:51,085 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] [2022-12-13 12:52:51,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:52:51,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash -162000152, now seen corresponding path program 1 times [2022-12-13 12:52:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:51,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131242349] [2022-12-13 12:52:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:51,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:51,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:51,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131242349] [2022-12-13 12:52:51,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131242349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:51,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:51,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:52:51,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725319403] [2022-12-13 12:52:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:51,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:52:51,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:52:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:52:51,212 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-12-13 12:52:51,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 456 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:52:51,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:51,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-12-13 12:52:51,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:51,943 INFO L130 PetriNetUnfolder]: 4250/6796 cut-off events. [2022-12-13 12:52:51,943 INFO L131 PetriNetUnfolder]: For 16411/16597 co-relation queries the response was YES. [2022-12-13 12:52:51,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25478 conditions, 6796 events. 4250/6796 cut-off events. For 16411/16597 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 41307 event pairs, 1317 based on Foata normal form. 33/6618 useless extension candidates. Maximal degree in co-relation 25452. Up to 3644 conditions per place. [2022-12-13 12:52:51,964 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 62 selfloop transitions, 7 changer transitions 29/105 dead transitions. [2022-12-13 12:52:51,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 105 transitions, 919 flow [2022-12-13 12:52:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:52:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:52:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2022-12-13 12:52:51,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.529 [2022-12-13 12:52:51,965 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2022-12-13 12:52:51,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2022-12-13 12:52:51,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:51,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2022-12-13 12:52:51,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 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-12-13 12:52:51,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 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-12-13 12:52:51,967 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 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-12-13 12:52:51,968 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 456 flow. Second operand 4 states and 529 transitions. [2022-12-13 12:52:51,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 105 transitions, 919 flow [2022-12-13 12:52:52,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 105 transitions, 853 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 12:52:52,069 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 365 flow [2022-12-13 12:52:52,069 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2022-12-13 12:52:52,069 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2022-12-13 12:52:52,070 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 365 flow [2022-12-13 12:52:52,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:52:52,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:52,070 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] [2022-12-13 12:52:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:52:52,070 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash 664051015, now seen corresponding path program 1 times [2022-12-13 12:52:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:52,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958766765] [2022-12-13 12:52:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:52,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:52,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:52,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958766765] [2022-12-13 12:52:52,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958766765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:52,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:52,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:52:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88237339] [2022-12-13 12:52:52,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:52,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:52:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:52:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:52:52,365 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250 [2022-12-13 12:52:52,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 365 flow. Second operand has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 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-12-13 12:52:52,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:52,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250 [2022-12-13 12:52:52,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:53,421 INFO L130 PetriNetUnfolder]: 5069/8553 cut-off events. [2022-12-13 12:52:53,421 INFO L131 PetriNetUnfolder]: For 15968/16221 co-relation queries the response was YES. [2022-12-13 12:52:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29765 conditions, 8553 events. 5069/8553 cut-off events. For 15968/16221 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 59887 event pairs, 804 based on Foata normal form. 74/8452 useless extension candidates. Maximal degree in co-relation 29738. Up to 4089 conditions per place. [2022-12-13 12:52:53,447 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 97 selfloop transitions, 9 changer transitions 65/182 dead transitions. [2022-12-13 12:52:53,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 182 transitions, 1449 flow [2022-12-13 12:52:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:52:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:52:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1023 transitions. [2022-12-13 12:52:53,449 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5115 [2022-12-13 12:52:53,449 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1023 transitions. [2022-12-13 12:52:53,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1023 transitions. [2022-12-13 12:52:53,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:53,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1023 transitions. [2022-12-13 12:52:53,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 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-12-13 12:52:53,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 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-12-13 12:52:53,452 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 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-12-13 12:52:53,452 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 365 flow. Second operand 8 states and 1023 transitions. [2022-12-13 12:52:53,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 182 transitions, 1449 flow [2022-12-13 12:52:53,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 182 transitions, 1424 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 12:52:53,602 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 413 flow [2022-12-13 12:52:53,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=413, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2022-12-13 12:52:53,602 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2022-12-13 12:52:53,603 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 413 flow [2022-12-13 12:52:53,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 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-12-13 12:52:53,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:53,603 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] [2022-12-13 12:52:53,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:52:53,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1938554463, now seen corresponding path program 2 times [2022-12-13 12:52:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:53,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809623837] [2022-12-13 12:52:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:53,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809623837] [2022-12-13 12:52:53,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809623837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:53,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:53,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:52:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354212318] [2022-12-13 12:52:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:53,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:52:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:52:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:52:53,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 250 [2022-12-13 12:52:53,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 413 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 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-12-13 12:52:53,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:53,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 250 [2022-12-13 12:52:53,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:54,501 INFO L130 PetriNetUnfolder]: 3791/6169 cut-off events. [2022-12-13 12:52:54,502 INFO L131 PetriNetUnfolder]: For 15342/15781 co-relation queries the response was YES. [2022-12-13 12:52:54,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23841 conditions, 6169 events. 3791/6169 cut-off events. For 15342/15781 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 40234 event pairs, 466 based on Foata normal form. 193/6219 useless extension candidates. Maximal degree in co-relation 23817. Up to 2401 conditions per place. [2022-12-13 12:52:54,516 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 68 selfloop transitions, 17 changer transitions 32/123 dead transitions. [2022-12-13 12:52:54,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 123 transitions, 998 flow [2022-12-13 12:52:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:52:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:52:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 781 transitions. [2022-12-13 12:52:54,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5206666666666667 [2022-12-13 12:52:54,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 781 transitions. [2022-12-13 12:52:54,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 781 transitions. [2022-12-13 12:52:54,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:54,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 781 transitions. [2022-12-13 12:52:54,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 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-12-13 12:52:54,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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-12-13 12:52:54,522 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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-12-13 12:52:54,522 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 413 flow. Second operand 6 states and 781 transitions. [2022-12-13 12:52:54,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 123 transitions, 998 flow [2022-12-13 12:52:54,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 977 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 12:52:54,710 INFO L231 Difference]: Finished difference. Result has 72 places, 49 transitions, 324 flow [2022-12-13 12:52:54,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=72, PETRI_TRANSITIONS=49} [2022-12-13 12:52:54,711 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2022-12-13 12:52:54,711 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 324 flow [2022-12-13 12:52:54,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 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-12-13 12:52:54,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:54,711 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] [2022-12-13 12:52:54,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:52:54,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash 107623447, now seen corresponding path program 1 times [2022-12-13 12:52:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:54,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415262698] [2022-12-13 12:52:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:54,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:54,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415262698] [2022-12-13 12:52:54,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415262698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:54,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:54,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:52:54,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400987069] [2022-12-13 12:52:54,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:54,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:52:54,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:52:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:52:54,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 250 [2022-12-13 12:52:54,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 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-12-13 12:52:54,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:54,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 250 [2022-12-13 12:52:54,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:55,279 INFO L130 PetriNetUnfolder]: 1536/2566 cut-off events. [2022-12-13 12:52:55,280 INFO L131 PetriNetUnfolder]: For 6903/6942 co-relation queries the response was YES. [2022-12-13 12:52:55,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10742 conditions, 2566 events. 1536/2566 cut-off events. For 6903/6942 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13725 event pairs, 521 based on Foata normal form. 5/2546 useless extension candidates. Maximal degree in co-relation 10724. Up to 1420 conditions per place. [2022-12-13 12:52:55,289 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 45 selfloop transitions, 1 changer transitions 43/92 dead transitions. [2022-12-13 12:52:55,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 92 transitions, 797 flow [2022-12-13 12:52:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:52:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:52:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2022-12-13 12:52:55,292 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.512 [2022-12-13 12:52:55,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2022-12-13 12:52:55,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2022-12-13 12:52:55,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:55,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2022-12-13 12:52:55,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 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-12-13 12:52:55,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-12-13 12:52:55,298 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-12-13 12:52:55,298 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 324 flow. Second operand 5 states and 640 transitions. [2022-12-13 12:52:55,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 92 transitions, 797 flow [2022-12-13 12:52:55,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 636 flow, removed 44 selfloop flow, removed 11 redundant places. [2022-12-13 12:52:55,334 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 228 flow [2022-12-13 12:52:55,334 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2022-12-13 12:52:55,334 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2022-12-13 12:52:55,335 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 228 flow [2022-12-13 12:52:55,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 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-12-13 12:52:55,335 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:55,335 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] [2022-12-13 12:52:55,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:52:55,336 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1288896923, now seen corresponding path program 2 times [2022-12-13 12:52:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:55,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67434759] [2022-12-13 12:52:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:52:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:52:56,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:52:56,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67434759] [2022-12-13 12:52:56,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67434759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:52:56,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:52:56,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:52:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989214715] [2022-12-13 12:52:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:52:56,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:52:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:52:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:52:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:52:56,168 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250 [2022-12-13 12:52:56,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 228 flow. Second operand has 9 states, 9 states have (on average 118.66666666666667) internal successors, (1068), 9 states have internal predecessors, (1068), 0 states have call successors, (0), 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-12-13 12:52:56,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:52:56,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250 [2022-12-13 12:52:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:52:56,483 INFO L130 PetriNetUnfolder]: 449/788 cut-off events. [2022-12-13 12:52:56,483 INFO L131 PetriNetUnfolder]: For 1139/1148 co-relation queries the response was YES. [2022-12-13 12:52:56,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 788 events. 449/788 cut-off events. For 1139/1148 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3199 event pairs, 79 based on Foata normal form. 7/787 useless extension candidates. Maximal degree in co-relation 2794. Up to 456 conditions per place. [2022-12-13 12:52:56,486 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 52 selfloop transitions, 4 changer transitions 30/90 dead transitions. [2022-12-13 12:52:56,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 627 flow [2022-12-13 12:52:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:52:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:52:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2022-12-13 12:52:56,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4937142857142857 [2022-12-13 12:52:56,488 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2022-12-13 12:52:56,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2022-12-13 12:52:56,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:52:56,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2022-12-13 12:52:56,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 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-12-13 12:52:56,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-12-13 12:52:56,493 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-12-13 12:52:56,493 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 228 flow. Second operand 7 states and 864 transitions. [2022-12-13 12:52:56,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 627 flow [2022-12-13 12:52:56,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 609 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 12:52:56,499 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 233 flow [2022-12-13 12:52:56,499 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2022-12-13 12:52:56,499 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2022-12-13 12:52:56,500 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 233 flow [2022-12-13 12:52:56,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.66666666666667) internal successors, (1068), 9 states have internal predecessors, (1068), 0 states have call successors, (0), 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-12-13 12:52:56,500 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:52:56,500 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] [2022-12-13 12:52:56,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:52:56,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 12:52:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:52:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 235179481, now seen corresponding path program 3 times [2022-12-13 12:52:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:52:56,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286963765] [2022-12-13 12:52:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:52:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:52:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:52:56,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:52:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:52:56,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:52:56,617 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:52:56,618 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 12:52:56,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 12:52:56,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 12:52:56,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 12:52:56,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 12:52:56,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 12:52:56,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 12:52:56,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:52:56,621 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 12:52:56,627 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:52:56,627 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:52:56,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:52:56 BasicIcfg [2022-12-13 12:52:56,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:52:56,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:52:56,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:52:56,698 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:52:56,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:36" (3/4) ... [2022-12-13 12:52:56,700 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 12:52:56,780 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:52:56,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:52:56,781 INFO L158 Benchmark]: Toolchain (without parser) took 20996.44ms. Allocated memory was 115.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 61.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 300.8MB. Max. memory is 16.1GB. [2022-12-13 12:52:56,781 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:52:56,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.99ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 61.1MB in the beginning and 95.2MB in the end (delta: -34.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-12-13 12:52:56,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.95ms. Allocated memory is still 144.7MB. Free memory was 94.2MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:52:56,782 INFO L158 Benchmark]: Boogie Preprocessor took 22.20ms. Allocated memory is still 144.7MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:52:56,782 INFO L158 Benchmark]: RCFGBuilder took 552.24ms. Allocated memory is still 144.7MB. Free memory was 90.0MB in the beginning and 55.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-12-13 12:52:56,782 INFO L158 Benchmark]: TraceAbstraction took 19910.30ms. Allocated memory was 144.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 54.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 245.1MB. Max. memory is 16.1GB. [2022-12-13 12:52:56,783 INFO L158 Benchmark]: Witness Printer took 82.46ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 12:52:56,784 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.13ms. Allocated memory is still 115.3MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.99ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 61.1MB in the beginning and 95.2MB in the end (delta: -34.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.95ms. Allocated memory is still 144.7MB. Free memory was 94.2MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.20ms. Allocated memory is still 144.7MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.24ms. Allocated memory is still 144.7MB. Free memory was 90.0MB in the beginning and 55.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19910.30ms. Allocated memory was 144.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 54.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 245.1MB. Max. memory is 16.1GB. * Witness Printer took 82.46ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 144 PlacesBefore, 44 PlacesAfterwards, 133 TransitionsBefore, 32 TransitionsAfterwards, 3232 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 8817 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3327, independent: 3093, independent conditional: 0, independent unconditional: 3093, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1670, independent: 1631, independent conditional: 0, independent unconditional: 1631, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3327, independent: 1462, independent conditional: 0, independent unconditional: 1462, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 1670, unknown conditional: 0, unknown unconditional: 1670] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t685, ((void *)0), P0, ((void *)0))=-3, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t686, ((void *)0), P1, ((void *)0))=-2, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t687, ((void *)0), P2, ((void *)0))=-1, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t688, ((void *)0), P3, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 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: 865]: 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: 863]: 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, 173 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: 19.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 895 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 749 mSDsluCounter, 514 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2162 IncrementalHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 70 mSDtfsCounter, 2162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=456occurred in iteration=8, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 1545 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:52:56,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_939f443c-a3b3-4826-905b-029708d38a28/bin/uautomizer-uyxdKDjOR8/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