./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- 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-e04fb08 [2022-11-16 11:36:30,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:36:30,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:36:30,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:36:30,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:36:30,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:36:30,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:36:30,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:36:30,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:36:30,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:36:30,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:36:30,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:36:30,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:36:30,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:36:30,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:36:30,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:36:30,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:36:30,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:36:30,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:36:30,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:36:30,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:36:30,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:36:30,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:36:30,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:36:30,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:36:30,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:36:30,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:36:30,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:36:30,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:36:30,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:36:30,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:36:30,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:36:30,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:36:30,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:36:30,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:36:30,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:36:30,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:36:30,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:36:30,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:36:30,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:36:30,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:36:30,958 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:36:31,001 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:36:31,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:36:31,002 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:36:31,002 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:36:31,003 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:36:31,004 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:36:31,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:36:31,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:36:31,005 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:36:31,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:36:31,006 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:36:31,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:36:31,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:36:31,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:36:31,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:36:31,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:36:31,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:36:31,007 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:36:31,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:36:31,007 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:36:31,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:36:31,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:36:31,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:36:31,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:36:31,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:36:31,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:36:31,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:36:31,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:36:31,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:36:31,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:36:31,011 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:36:31,011 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:36:31,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:36:31,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/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_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2022-11-16 11:36:31,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:36:31,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:36:31,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:36:31,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:36:31,452 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:36:31,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:36:31,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/data/1d8c341a7/476eea198e9945d297f1afd372a267f1/FLAG2f875b736 [2022-11-16 11:36:32,210 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:36:32,211 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:36:32,233 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/data/1d8c341a7/476eea198e9945d297f1afd372a267f1/FLAG2f875b736 [2022-11-16 11:36:32,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/data/1d8c341a7/476eea198e9945d297f1afd372a267f1 [2022-11-16 11:36:32,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:36:32,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:36:32,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:36:32,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:36:32,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:36:32,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:36:32" (1/1) ... [2022-11-16 11:36:32,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fb7dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:32, skipping insertion in model container [2022-11-16 11:36:32,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:36:32" (1/1) ... [2022-11-16 11:36:32,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:36:32,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:36:32,752 WARN L229 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_7e7f8470-15b1-430b-8230-10683f7eaeaa/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-11-16 11:36:33,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:36:33,025 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:36:33,044 WARN L229 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_7e7f8470-15b1-430b-8230-10683f7eaeaa/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-11-16 11:36:33,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:36:33,175 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:36:33,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33 WrapperNode [2022-11-16 11:36:33,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:36:33,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:36:33,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:36:33,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:36:33,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,260 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-16 11:36:33,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:36:33,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:36:33,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:36:33,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:36:33,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,322 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:36:33,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:36:33,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:36:33,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:36:33,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (1/1) ... [2022-11-16 11:36:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:36:33,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:33,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:36:33,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:36:33,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:36:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:36:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:36:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:36:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:36:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:36:33,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:36:33,422 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:36:33,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:36:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:36:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:36:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:36:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:36:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:36:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:36:33,426 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:36:33,646 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:36:33,648 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:36:33,975 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:36:34,228 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:36:34,228 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:36:34,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:36:34 BoogieIcfgContainer [2022-11-16 11:36:34,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:36:34,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:36:34,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:36:34,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:36:34,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:36:32" (1/3) ... [2022-11-16 11:36:34,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fa2cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:36:34, skipping insertion in model container [2022-11-16 11:36:34,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:33" (2/3) ... [2022-11-16 11:36:34,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fa2cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:36:34, skipping insertion in model container [2022-11-16 11:36:34,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:36:34" (3/3) ... [2022-11-16 11:36:34,247 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:36:34,258 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:36:34,270 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:36:34,270 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:36:34,270 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:36:34,332 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:36:34,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-16 11:36:34,429 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-16 11:36:34,429 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:36:34,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-16 11:36:34,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-16 11:36:34,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-16 11:36:34,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:36:34,460 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;@13fbf024, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:36:34,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:36:34,478 INFO L130 PetriNetUnfolder]: 0/58 cut-off events. [2022-11-16 11:36:34,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:36:34,479 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:34,480 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:34,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:34,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2094514556, now seen corresponding path program 1 times [2022-11-16 11:36:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:34,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261362911] [2022-11-16 11:36:34,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:35,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:35,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261362911] [2022-11-16 11:36:35,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261362911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:35,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:35,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:36:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24705331] [2022-11-16 11:36:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:35,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:35,268 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-11-16 11:36:35,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:35,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:35,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-11-16 11:36:35,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:35,519 INFO L130 PetriNetUnfolder]: 57/323 cut-off events. [2022-11-16 11:36:35,519 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:36:35,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 323 events. 57/323 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1330 event pairs, 11 based on Foata normal form. 12/318 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2022-11-16 11:36:35,524 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 13 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-11-16 11:36:35,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 266 flow [2022-11-16 11:36:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:36:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2022-11-16 11:36:35,540 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2022-11-16 11:36:35,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2022-11-16 11:36:35,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2022-11-16 11:36:35,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:35,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2022-11-16 11:36:35,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:35,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:35,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:35,558 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 320 transitions. [2022-11-16 11:36:35,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 266 flow [2022-11-16 11:36:35,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:36:35,566 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-11-16 11:36:35,568 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-11-16 11:36:35,572 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-11-16 11:36:35,572 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-11-16 11:36:35,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:35,573 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:35,573 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:35,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:36:35,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:35,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash 185147135, now seen corresponding path program 1 times [2022-11-16 11:36:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:35,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306131446] [2022-11-16 11:36:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:36,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:36,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306131446] [2022-11-16 11:36:36,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306131446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:36,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:36,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:36:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612450791] [2022-11-16 11:36:36,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:36,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:36:36,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:36,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:36:36,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:36:36,534 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:36:36,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:36,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:36,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:36:36,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:38,329 INFO L130 PetriNetUnfolder]: 2161/5104 cut-off events. [2022-11-16 11:36:38,330 INFO L131 PetriNetUnfolder]: For 228/228 co-relation queries the response was YES. [2022-11-16 11:36:38,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8587 conditions, 5104 events. 2161/5104 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 41077 event pairs, 228 based on Foata normal form. 0/4952 useless extension candidates. Maximal degree in co-relation 8527. Up to 1366 conditions per place. [2022-11-16 11:36:38,361 INFO L137 encePairwiseOnDemand]: 100/114 looper letters, 42 selfloop transitions, 10 changer transitions 96/214 dead transitions. [2022-11-16 11:36:38,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 214 transitions, 740 flow [2022-11-16 11:36:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:36:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:36:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1180 transitions. [2022-11-16 11:36:38,368 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.796221322537112 [2022-11-16 11:36:38,368 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1180 transitions. [2022-11-16 11:36:38,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1180 transitions. [2022-11-16 11:36:38,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:38,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1180 transitions. [2022-11-16 11:36:38,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.76923076923077) internal successors, (1180), 13 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:38,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:38,378 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:38,378 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 13 states and 1180 transitions. [2022-11-16 11:36:38,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 214 transitions, 740 flow [2022-11-16 11:36:38,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 214 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:36:38,383 INFO L231 Difference]: Finished difference. Result has 138 places, 103 transitions, 332 flow [2022-11-16 11:36:38,384 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=332, PETRI_PLACES=138, PETRI_TRANSITIONS=103} [2022-11-16 11:36:38,385 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-11-16 11:36:38,385 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 103 transitions, 332 flow [2022-11-16 11:36:38,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:38,386 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:38,386 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:38,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:36:38,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash -614680386, now seen corresponding path program 1 times [2022-11-16 11:36:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:38,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901499289] [2022-11-16 11:36:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:38,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:39,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:39,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901499289] [2022-11-16 11:36:39,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901499289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:39,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:39,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:36:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700784703] [2022-11-16 11:36:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:39,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:36:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:36:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:36:39,058 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:36:39,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 103 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:39,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:39,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:36:39,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:40,410 INFO L130 PetriNetUnfolder]: 1344/2695 cut-off events. [2022-11-16 11:36:40,410 INFO L131 PetriNetUnfolder]: For 5853/8560 co-relation queries the response was YES. [2022-11-16 11:36:40,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9810 conditions, 2695 events. 1344/2695 cut-off events. For 5853/8560 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 17084 event pairs, 154 based on Foata normal form. 72/2685 useless extension candidates. Maximal degree in co-relation 9738. Up to 1121 conditions per place. [2022-11-16 11:36:40,435 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 40 selfloop transitions, 23 changer transitions 82/211 dead transitions. [2022-11-16 11:36:40,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 211 transitions, 1376 flow [2022-11-16 11:36:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:36:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:36:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1164 transitions. [2022-11-16 11:36:40,443 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7854251012145749 [2022-11-16 11:36:40,443 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1164 transitions. [2022-11-16 11:36:40,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1164 transitions. [2022-11-16 11:36:40,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:40,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1164 transitions. [2022-11-16 11:36:40,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.53846153846153) internal successors, (1164), 13 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:40,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:40,454 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:40,455 INFO L175 Difference]: Start difference. First operand has 138 places, 103 transitions, 332 flow. Second operand 13 states and 1164 transitions. [2022-11-16 11:36:40,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 211 transitions, 1376 flow [2022-11-16 11:36:40,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 211 transitions, 1348 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-16 11:36:40,482 INFO L231 Difference]: Finished difference. Result has 137 places, 116 transitions, 565 flow [2022-11-16 11:36:40,482 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=565, PETRI_PLACES=137, PETRI_TRANSITIONS=116} [2022-11-16 11:36:40,483 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2022-11-16 11:36:40,483 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 116 transitions, 565 flow [2022-11-16 11:36:40,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:40,484 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:40,484 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:40,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:36:40,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash 801926865, now seen corresponding path program 1 times [2022-11-16 11:36:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:40,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34223811] [2022-11-16 11:36:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:41,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:41,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34223811] [2022-11-16 11:36:41,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34223811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:41,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:41,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:36:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973821966] [2022-11-16 11:36:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:41,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:36:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:36:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:36:41,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:36:41,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 116 transitions, 565 flow. Second operand has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 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-11-16 11:36:41,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:41,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:36:41,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:42,059 INFO L130 PetriNetUnfolder]: 1348/2555 cut-off events. [2022-11-16 11:36:42,059 INFO L131 PetriNetUnfolder]: For 12422/32552 co-relation queries the response was YES. [2022-11-16 11:36:42,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12107 conditions, 2555 events. 1348/2555 cut-off events. For 12422/32552 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15320 event pairs, 274 based on Foata normal form. 69/2506 useless extension candidates. Maximal degree in co-relation 12017. Up to 1231 conditions per place. [2022-11-16 11:36:42,086 INFO L137 encePairwiseOnDemand]: 100/114 looper letters, 46 selfloop transitions, 13 changer transitions 58/183 dead transitions. [2022-11-16 11:36:42,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 183 transitions, 1416 flow [2022-11-16 11:36:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:36:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:36:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 727 transitions. [2022-11-16 11:36:42,089 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7971491228070176 [2022-11-16 11:36:42,090 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 727 transitions. [2022-11-16 11:36:42,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 727 transitions. [2022-11-16 11:36:42,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:42,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 727 transitions. [2022-11-16 11:36:42,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:42,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:42,101 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:42,101 INFO L175 Difference]: Start difference. First operand has 137 places, 116 transitions, 565 flow. Second operand 8 states and 727 transitions. [2022-11-16 11:36:42,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 183 transitions, 1416 flow [2022-11-16 11:36:42,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 183 transitions, 1352 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-11-16 11:36:42,172 INFO L231 Difference]: Finished difference. Result has 136 places, 110 transitions, 519 flow [2022-11-16 11:36:42,173 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=519, PETRI_PLACES=136, PETRI_TRANSITIONS=110} [2022-11-16 11:36:42,174 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2022-11-16 11:36:42,176 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 110 transitions, 519 flow [2022-11-16 11:36:42,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 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-11-16 11:36:42,179 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:42,179 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:42,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:36:42,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1714984277, now seen corresponding path program 2 times [2022-11-16 11:36:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:42,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627202370] [2022-11-16 11:36:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:42,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627202370] [2022-11-16 11:36:42,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627202370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:42,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:42,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:36:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888360991] [2022-11-16 11:36:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:42,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:36:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:42,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:36:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:36:42,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:36:42,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 110 transitions, 519 flow. Second operand has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:42,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:42,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:36:42,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:43,768 INFO L130 PetriNetUnfolder]: 780/1579 cut-off events. [2022-11-16 11:36:43,769 INFO L131 PetriNetUnfolder]: For 6396/12056 co-relation queries the response was YES. [2022-11-16 11:36:43,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7169 conditions, 1579 events. 780/1579 cut-off events. For 6396/12056 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8827 event pairs, 165 based on Foata normal form. 31/1555 useless extension candidates. Maximal degree in co-relation 7144. Up to 749 conditions per place. [2022-11-16 11:36:43,788 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 41 selfloop transitions, 22 changer transitions 49/178 dead transitions. [2022-11-16 11:36:43,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 178 transitions, 1334 flow [2022-11-16 11:36:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:36:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:36:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1141 transitions. [2022-11-16 11:36:43,793 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7699055330634278 [2022-11-16 11:36:43,793 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1141 transitions. [2022-11-16 11:36:43,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1141 transitions. [2022-11-16 11:36:43,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:43,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1141 transitions. [2022-11-16 11:36:43,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 87.76923076923077) internal successors, (1141), 13 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:43,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:43,802 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:43,802 INFO L175 Difference]: Start difference. First operand has 136 places, 110 transitions, 519 flow. Second operand 13 states and 1141 transitions. [2022-11-16 11:36:43,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 178 transitions, 1334 flow [2022-11-16 11:36:43,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 178 transitions, 1200 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-11-16 11:36:43,819 INFO L231 Difference]: Finished difference. Result has 146 places, 117 transitions, 648 flow [2022-11-16 11:36:43,820 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=648, PETRI_PLACES=146, PETRI_TRANSITIONS=117} [2022-11-16 11:36:43,821 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 27 predicate places. [2022-11-16 11:36:43,821 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 117 transitions, 648 flow [2022-11-16 11:36:43,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:43,822 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:43,822 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:43,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:36:43,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:43,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1114199349, now seen corresponding path program 1 times [2022-11-16 11:36:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:43,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456712139] [2022-11-16 11:36:43,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:43,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:44,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-11-16 11:36:44,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:44,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456712139] [2022-11-16 11:36:44,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456712139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:44,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:44,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:36:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155882305] [2022-11-16 11:36:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:44,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:36:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:44,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:36:44,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:36:44,340 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:36:44,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 117 transitions, 648 flow. Second operand has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 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-11-16 11:36:44,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:44,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:36:44,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:45,002 INFO L130 PetriNetUnfolder]: 753/1555 cut-off events. [2022-11-16 11:36:45,003 INFO L131 PetriNetUnfolder]: For 8501/27103 co-relation queries the response was YES. [2022-11-16 11:36:45,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 1555 events. 753/1555 cut-off events. For 8501/27103 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8970 event pairs, 108 based on Foata normal form. 47/1536 useless extension candidates. Maximal degree in co-relation 7450. Up to 756 conditions per place. [2022-11-16 11:36:45,017 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 34 selfloop transitions, 16 changer transitions 54/170 dead transitions. [2022-11-16 11:36:45,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 170 transitions, 1438 flow [2022-11-16 11:36:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:36:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:36:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 714 transitions. [2022-11-16 11:36:45,020 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7828947368421053 [2022-11-16 11:36:45,020 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 714 transitions. [2022-11-16 11:36:45,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 714 transitions. [2022-11-16 11:36:45,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:45,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 714 transitions. [2022-11-16 11:36:45,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 89.25) internal successors, (714), 8 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:45,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:45,026 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:45,026 INFO L175 Difference]: Start difference. First operand has 146 places, 117 transitions, 648 flow. Second operand 8 states and 714 transitions. [2022-11-16 11:36:45,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 170 transitions, 1438 flow [2022-11-16 11:36:45,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 170 transitions, 1387 flow, removed 23 selfloop flow, removed 10 redundant places. [2022-11-16 11:36:45,056 INFO L231 Difference]: Finished difference. Result has 138 places, 108 transitions, 538 flow [2022-11-16 11:36:45,056 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=138, PETRI_TRANSITIONS=108} [2022-11-16 11:36:45,057 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-11-16 11:36:45,057 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 108 transitions, 538 flow [2022-11-16 11:36:45,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 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-11-16 11:36:45,058 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:45,058 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:45,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:36:45,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1997512912, now seen corresponding path program 1 times [2022-11-16 11:36:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:45,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208224248] [2022-11-16 11:36:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:45,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:45,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:45,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208224248] [2022-11-16 11:36:45,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208224248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:45,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:45,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:36:45,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566018956] [2022-11-16 11:36:45,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:45,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:36:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:45,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:36:45,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:36:45,489 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:36:45,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 108 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:45,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:45,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:36:45,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:45,983 INFO L130 PetriNetUnfolder]: 358/794 cut-off events. [2022-11-16 11:36:45,983 INFO L131 PetriNetUnfolder]: For 3417/8433 co-relation queries the response was YES. [2022-11-16 11:36:45,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3585 conditions, 794 events. 358/794 cut-off events. For 3417/8433 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3533 event pairs, 49 based on Foata normal form. 21/775 useless extension candidates. Maximal degree in co-relation 3561. Up to 364 conditions per place. [2022-11-16 11:36:45,997 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 40 selfloop transitions, 11 changer transitions 31/148 dead transitions. [2022-11-16 11:36:45,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 148 transitions, 1024 flow [2022-11-16 11:36:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:36:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:36:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 871 transitions. [2022-11-16 11:36:46,001 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7640350877192983 [2022-11-16 11:36:46,001 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 871 transitions. [2022-11-16 11:36:46,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 871 transitions. [2022-11-16 11:36:46,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:46,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 871 transitions. [2022-11-16 11:36:46,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:46,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:46,007 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:46,007 INFO L175 Difference]: Start difference. First operand has 138 places, 108 transitions, 538 flow. Second operand 10 states and 871 transitions. [2022-11-16 11:36:46,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 148 transitions, 1024 flow [2022-11-16 11:36:46,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 148 transitions, 922 flow, removed 23 selfloop flow, removed 10 redundant places. [2022-11-16 11:36:46,018 INFO L231 Difference]: Finished difference. Result has 142 places, 110 transitions, 517 flow [2022-11-16 11:36:46,018 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=517, PETRI_PLACES=142, PETRI_TRANSITIONS=110} [2022-11-16 11:36:46,019 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 23 predicate places. [2022-11-16 11:36:46,019 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 110 transitions, 517 flow [2022-11-16 11:36:46,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:46,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:46,020 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:46,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:36:46,020 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash 338443070, now seen corresponding path program 1 times [2022-11-16 11:36:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:46,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599391498] [2022-11-16 11:36:46,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:46,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599391498] [2022-11-16 11:36:46,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599391498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:46,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:46,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:36:46,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932807511] [2022-11-16 11:36:46,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:46,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:36:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:36:46,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:36:46,306 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-11-16 11:36:46,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 110 transitions, 517 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 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-11-16 11:36:46,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:46,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-11-16 11:36:46,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:46,669 INFO L130 PetriNetUnfolder]: 223/617 cut-off events. [2022-11-16 11:36:46,669 INFO L131 PetriNetUnfolder]: For 2519/4645 co-relation queries the response was YES. [2022-11-16 11:36:46,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 617 events. 223/617 cut-off events. For 2519/4645 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3125 event pairs, 69 based on Foata normal form. 19/604 useless extension candidates. Maximal degree in co-relation 2649. Up to 281 conditions per place. [2022-11-16 11:36:46,675 INFO L137 encePairwiseOnDemand]: 107/114 looper letters, 28 selfloop transitions, 3 changer transitions 30/136 dead transitions. [2022-11-16 11:36:46,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 898 flow [2022-11-16 11:36:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:36:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:36:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 760 transitions. [2022-11-16 11:36:46,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-11-16 11:36:46,678 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 760 transitions. [2022-11-16 11:36:46,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 760 transitions. [2022-11-16 11:36:46,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:46,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 760 transitions. [2022-11-16 11:36:46,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:46,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:46,683 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:46,683 INFO L175 Difference]: Start difference. First operand has 142 places, 110 transitions, 517 flow. Second operand 8 states and 760 transitions. [2022-11-16 11:36:46,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 898 flow [2022-11-16 11:36:46,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 136 transitions, 855 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-11-16 11:36:46,692 INFO L231 Difference]: Finished difference. Result has 140 places, 103 transitions, 416 flow [2022-11-16 11:36:46,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=416, PETRI_PLACES=140, PETRI_TRANSITIONS=103} [2022-11-16 11:36:46,693 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2022-11-16 11:36:46,694 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 103 transitions, 416 flow [2022-11-16 11:36:46,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 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-11-16 11:36:46,694 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:46,694 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:46,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:36:46,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1064429366, now seen corresponding path program 2 times [2022-11-16 11:36:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:46,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394281020] [2022-11-16 11:36:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:47,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:47,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394281020] [2022-11-16 11:36:47,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394281020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:47,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:47,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:36:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855054323] [2022-11-16 11:36:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:47,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:36:47,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:36:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:36:47,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-11-16 11:36:47,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 103 transitions, 416 flow. Second operand has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:47,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:47,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-11-16 11:36:47,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:48,057 INFO L130 PetriNetUnfolder]: 234/592 cut-off events. [2022-11-16 11:36:48,058 INFO L131 PetriNetUnfolder]: For 2518/2936 co-relation queries the response was YES. [2022-11-16 11:36:48,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 592 events. 234/592 cut-off events. For 2518/2936 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2520 event pairs, 66 based on Foata normal form. 16/589 useless extension candidates. Maximal degree in co-relation 2368. Up to 246 conditions per place. [2022-11-16 11:36:48,063 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 25 selfloop transitions, 11 changer transitions 31/144 dead transitions. [2022-11-16 11:36:48,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 144 transitions, 890 flow [2022-11-16 11:36:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:36:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 11:36:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1130 transitions. [2022-11-16 11:36:48,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8260233918128655 [2022-11-16 11:36:48,067 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1130 transitions. [2022-11-16 11:36:48,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1130 transitions. [2022-11-16 11:36:48,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:48,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1130 transitions. [2022-11-16 11:36:48,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.16666666666667) internal successors, (1130), 12 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:48,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:48,075 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:48,075 INFO L175 Difference]: Start difference. First operand has 140 places, 103 transitions, 416 flow. Second operand 12 states and 1130 transitions. [2022-11-16 11:36:48,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 144 transitions, 890 flow [2022-11-16 11:36:48,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 144 transitions, 830 flow, removed 23 selfloop flow, removed 9 redundant places. [2022-11-16 11:36:48,087 INFO L231 Difference]: Finished difference. Result has 143 places, 108 transitions, 496 flow [2022-11-16 11:36:48,087 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=496, PETRI_PLACES=143, PETRI_TRANSITIONS=108} [2022-11-16 11:36:48,088 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 24 predicate places. [2022-11-16 11:36:48,089 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 108 transitions, 496 flow [2022-11-16 11:36:48,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:48,089 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:48,090 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:48,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:36:48,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1363705778, now seen corresponding path program 3 times [2022-11-16 11:36:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864308475] [2022-11-16 11:36:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:48,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:48,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864308475] [2022-11-16 11:36:48,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864308475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:48,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:48,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:36:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803294366] [2022-11-16 11:36:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:48,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:36:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:48,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:36:48,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:36:48,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:36:48,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 108 transitions, 496 flow. Second operand has 12 states, 12 states have (on average 82.08333333333333) internal successors, (985), 12 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:48,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:48,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:36:48,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:49,647 INFO L130 PetriNetUnfolder]: 207/543 cut-off events. [2022-11-16 11:36:49,647 INFO L131 PetriNetUnfolder]: For 4979/5316 co-relation queries the response was YES. [2022-11-16 11:36:49,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 543 events. 207/543 cut-off events. For 4979/5316 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2374 event pairs, 54 based on Foata normal form. 21/554 useless extension candidates. Maximal degree in co-relation 2834. Up to 216 conditions per place. [2022-11-16 11:36:49,653 INFO L137 encePairwiseOnDemand]: 96/114 looper letters, 35 selfloop transitions, 27 changer transitions 41/169 dead transitions. [2022-11-16 11:36:49,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 169 transitions, 1501 flow [2022-11-16 11:36:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:36:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 11:36:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1448 transitions. [2022-11-16 11:36:49,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7471620227038184 [2022-11-16 11:36:49,658 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1448 transitions. [2022-11-16 11:36:49,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1448 transitions. [2022-11-16 11:36:49,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:49,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1448 transitions. [2022-11-16 11:36:49,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.17647058823529) internal successors, (1448), 17 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:49,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:49,667 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:49,667 INFO L175 Difference]: Start difference. First operand has 143 places, 108 transitions, 496 flow. Second operand 17 states and 1448 transitions. [2022-11-16 11:36:49,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 169 transitions, 1501 flow [2022-11-16 11:36:49,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 169 transitions, 1246 flow, removed 119 selfloop flow, removed 9 redundant places. [2022-11-16 11:36:49,677 INFO L231 Difference]: Finished difference. Result has 156 places, 123 transitions, 775 flow [2022-11-16 11:36:49,678 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=775, PETRI_PLACES=156, PETRI_TRANSITIONS=123} [2022-11-16 11:36:49,678 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2022-11-16 11:36:49,678 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 123 transitions, 775 flow [2022-11-16 11:36:49,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.08333333333333) internal successors, (985), 12 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:49,679 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:49,679 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:49,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:36:49,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1395146792, now seen corresponding path program 1 times [2022-11-16 11:36:49,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:49,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927872978] [2022-11-16 11:36:49,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:49,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927872978] [2022-11-16 11:36:49,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927872978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:49,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:49,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:36:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434444078] [2022-11-16 11:36:49,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:49,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:36:49,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:49,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:36:49,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:36:49,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-16 11:36:49,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 123 transitions, 775 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:49,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:49,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-16 11:36:49,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:50,493 INFO L130 PetriNetUnfolder]: 808/1787 cut-off events. [2022-11-16 11:36:50,494 INFO L131 PetriNetUnfolder]: For 16457/16640 co-relation queries the response was YES. [2022-11-16 11:36:50,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7476 conditions, 1787 events. 808/1787 cut-off events. For 16457/16640 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11487 event pairs, 53 based on Foata normal form. 23/1742 useless extension candidates. Maximal degree in co-relation 7444. Up to 512 conditions per place. [2022-11-16 11:36:50,509 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 39 selfloop transitions, 7 changer transitions 50/175 dead transitions. [2022-11-16 11:36:50,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 175 transitions, 1430 flow [2022-11-16 11:36:50,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:36:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:36:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions. [2022-11-16 11:36:50,512 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2022-11-16 11:36:50,512 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 976 transitions. [2022-11-16 11:36:50,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions. [2022-11-16 11:36:50,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:50,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions. [2022-11-16 11:36:50,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:50,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:50,518 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:50,518 INFO L175 Difference]: Start difference. First operand has 156 places, 123 transitions, 775 flow. Second operand 10 states and 976 transitions. [2022-11-16 11:36:50,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 175 transitions, 1430 flow [2022-11-16 11:36:50,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 175 transitions, 1181 flow, removed 95 selfloop flow, removed 15 redundant places. [2022-11-16 11:36:50,535 INFO L231 Difference]: Finished difference. Result has 147 places, 111 transitions, 515 flow [2022-11-16 11:36:50,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=515, PETRI_PLACES=147, PETRI_TRANSITIONS=111} [2022-11-16 11:36:50,536 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 28 predicate places. [2022-11-16 11:36:50,536 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 111 transitions, 515 flow [2022-11-16 11:36:50,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:50,537 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:50,537 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:50,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:36:50,537 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1327602555, now seen corresponding path program 1 times [2022-11-16 11:36:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:50,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897361727] [2022-11-16 11:36:50,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:50,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:50,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897361727] [2022-11-16 11:36:50,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897361727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:50,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:50,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:36:50,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887243609] [2022-11-16 11:36:50,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:50,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:36:50,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:50,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:36:50,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:36:50,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-16 11:36:50,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 111 transitions, 515 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:50,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:50,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-16 11:36:50,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:51,286 INFO L130 PetriNetUnfolder]: 317/910 cut-off events. [2022-11-16 11:36:51,287 INFO L131 PetriNetUnfolder]: For 5318/5382 co-relation queries the response was YES. [2022-11-16 11:36:51,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 910 events. 317/910 cut-off events. For 5318/5382 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5336 event pairs, 31 based on Foata normal form. 24/918 useless extension candidates. Maximal degree in co-relation 3740. Up to 209 conditions per place. [2022-11-16 11:36:51,296 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 46 selfloop transitions, 18 changer transitions 22/165 dead transitions. [2022-11-16 11:36:51,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 1257 flow [2022-11-16 11:36:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:36:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:36:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1071 transitions. [2022-11-16 11:36:51,300 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.854066985645933 [2022-11-16 11:36:51,300 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1071 transitions. [2022-11-16 11:36:51,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1071 transitions. [2022-11-16 11:36:51,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:51,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1071 transitions. [2022-11-16 11:36:51,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.36363636363636) internal successors, (1071), 11 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:51,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:51,307 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:51,307 INFO L175 Difference]: Start difference. First operand has 147 places, 111 transitions, 515 flow. Second operand 11 states and 1071 transitions. [2022-11-16 11:36:51,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 1257 flow [2022-11-16 11:36:51,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 1239 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-16 11:36:51,319 INFO L231 Difference]: Finished difference. Result has 155 places, 125 transitions, 679 flow [2022-11-16 11:36:51,319 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=679, PETRI_PLACES=155, PETRI_TRANSITIONS=125} [2022-11-16 11:36:51,321 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 36 predicate places. [2022-11-16 11:36:51,321 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 125 transitions, 679 flow [2022-11-16 11:36:51,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:51,322 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:51,322 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:51,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:36:51,323 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash -224941008, now seen corresponding path program 1 times [2022-11-16 11:36:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:51,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238197717] [2022-11-16 11:36:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:51,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:51,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238197717] [2022-11-16 11:36:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238197717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:51,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:51,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:36:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283254064] [2022-11-16 11:36:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:51,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:36:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:36:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:36:51,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-16 11:36:51,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 125 transitions, 679 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:51,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:51,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-16 11:36:51,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:52,096 INFO L130 PetriNetUnfolder]: 257/761 cut-off events. [2022-11-16 11:36:52,096 INFO L131 PetriNetUnfolder]: For 5507/5565 co-relation queries the response was YES. [2022-11-16 11:36:52,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 761 events. 257/761 cut-off events. For 5507/5565 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4548 event pairs, 19 based on Foata normal form. 8/758 useless extension candidates. Maximal degree in co-relation 3521. Up to 177 conditions per place. [2022-11-16 11:36:52,102 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 39 selfloop transitions, 22 changer transitions 24/164 dead transitions. [2022-11-16 11:36:52,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 1277 flow [2022-11-16 11:36:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:36:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:36:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1332 transitions. [2022-11-16 11:36:52,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8345864661654135 [2022-11-16 11:36:52,106 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1332 transitions. [2022-11-16 11:36:52,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1332 transitions. [2022-11-16 11:36:52,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:52,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1332 transitions. [2022-11-16 11:36:52,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.14285714285714) internal successors, (1332), 14 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:52,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:52,116 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:52,116 INFO L175 Difference]: Start difference. First operand has 155 places, 125 transitions, 679 flow. Second operand 14 states and 1332 transitions. [2022-11-16 11:36:52,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 1277 flow [2022-11-16 11:36:52,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 164 transitions, 1183 flow, removed 43 selfloop flow, removed 6 redundant places. [2022-11-16 11:36:52,136 INFO L231 Difference]: Finished difference. Result has 169 places, 126 transitions, 673 flow [2022-11-16 11:36:52,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=673, PETRI_PLACES=169, PETRI_TRANSITIONS=126} [2022-11-16 11:36:52,138 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 50 predicate places. [2022-11-16 11:36:52,138 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 126 transitions, 673 flow [2022-11-16 11:36:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:52,139 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:52,139 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:52,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:36:52,139 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1448615456, now seen corresponding path program 1 times [2022-11-16 11:36:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:52,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352023405] [2022-11-16 11:36:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:53,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:53,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352023405] [2022-11-16 11:36:53,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352023405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:53,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:53,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-16 11:36:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004699753] [2022-11-16 11:36:53,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:53,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:36:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:53,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:36:53,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:36:53,786 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 114 [2022-11-16 11:36:53,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 126 transitions, 673 flow. Second operand has 16 states, 16 states have (on average 79.0) internal successors, (1264), 16 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:53,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:53,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 114 [2022-11-16 11:36:53,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:54,520 INFO L130 PetriNetUnfolder]: 88/598 cut-off events. [2022-11-16 11:36:54,521 INFO L131 PetriNetUnfolder]: For 1637/1673 co-relation queries the response was YES. [2022-11-16 11:36:54,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 598 events. 88/598 cut-off events. For 1637/1673 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4372 event pairs, 3 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 1896. Up to 83 conditions per place. [2022-11-16 11:36:54,528 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 26 selfloop transitions, 14 changer transitions 13/136 dead transitions. [2022-11-16 11:36:54,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 136 transitions, 843 flow [2022-11-16 11:36:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:36:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:36:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1201 transitions. [2022-11-16 11:36:54,532 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7023391812865497 [2022-11-16 11:36:54,532 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1201 transitions. [2022-11-16 11:36:54,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1201 transitions. [2022-11-16 11:36:54,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:54,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1201 transitions. [2022-11-16 11:36:54,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 80.06666666666666) internal successors, (1201), 15 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:54,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:54,556 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:54,556 INFO L175 Difference]: Start difference. First operand has 169 places, 126 transitions, 673 flow. Second operand 15 states and 1201 transitions. [2022-11-16 11:36:54,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 136 transitions, 843 flow [2022-11-16 11:36:54,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 136 transitions, 717 flow, removed 45 selfloop flow, removed 17 redundant places. [2022-11-16 11:36:54,572 INFO L231 Difference]: Finished difference. Result has 167 places, 120 transitions, 547 flow [2022-11-16 11:36:54,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=547, PETRI_PLACES=167, PETRI_TRANSITIONS=120} [2022-11-16 11:36:54,573 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 48 predicate places. [2022-11-16 11:36:54,573 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 120 transitions, 547 flow [2022-11-16 11:36:54,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.0) internal successors, (1264), 16 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:36:54,574 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:54,574 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:54,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:36:54,575 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:36:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 134079480, now seen corresponding path program 2 times [2022-11-16 11:36:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:54,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031623093] [2022-11-16 11:36:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:36:54,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:36:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:36:54,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:36:54,724 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:36:54,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 11:36:54,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:36:54,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 11:36:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 11:36:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 11:36:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:36:54,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:36:54,729 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:54,739 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:36:54,739 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:36:54,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:36:54 BasicIcfg [2022-11-16 11:36:54,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:36:54,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:36:54,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:36:54,890 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:36:54,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:36:34" (3/4) ... [2022-11-16 11:36:54,893 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:36:54,977 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:36:54,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:36:54,978 INFO L158 Benchmark]: Toolchain (without parser) took 22498.12ms. Allocated memory was 130.0MB in the beginning and 507.5MB in the end (delta: 377.5MB). Free memory was 91.5MB in the beginning and 160.4MB in the end (delta: -69.0MB). Peak memory consumption was 308.1MB. Max. memory is 16.1GB. [2022-11-16 11:36:54,979 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory was 109.5MB in the beginning and 109.4MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:36:54,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.16ms. Allocated memory is still 130.0MB. Free memory was 91.2MB in the beginning and 92.0MB in the end (delta: -761.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:36:54,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.34ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 89.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:36:54,980 INFO L158 Benchmark]: Boogie Preprocessor took 64.68ms. Allocated memory is still 130.0MB. Free memory was 89.5MB in the beginning and 87.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:36:54,980 INFO L158 Benchmark]: RCFGBuilder took 905.08ms. Allocated memory is still 130.0MB. Free memory was 87.4MB in the beginning and 100.2MB in the end (delta: -12.7MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-11-16 11:36:54,981 INFO L158 Benchmark]: TraceAbstraction took 20654.61ms. Allocated memory was 130.0MB in the beginning and 507.5MB in the end (delta: 377.5MB). Free memory was 99.6MB in the beginning and 182.5MB in the end (delta: -82.9MB). Peak memory consumption was 294.4MB. Max. memory is 16.1GB. [2022-11-16 11:36:54,981 INFO L158 Benchmark]: Witness Printer took 87.80ms. Allocated memory is still 507.5MB. Free memory was 182.5MB in the beginning and 160.4MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 11:36:54,983 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.32ms. Allocated memory is still 130.0MB. Free memory was 109.5MB in the beginning and 109.4MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.16ms. Allocated memory is still 130.0MB. Free memory was 91.2MB in the beginning and 92.0MB in the end (delta: -761.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.34ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 89.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.68ms. Allocated memory is still 130.0MB. Free memory was 89.5MB in the beginning and 87.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 905.08ms. Allocated memory is still 130.0MB. Free memory was 87.4MB in the beginning and 100.2MB in the end (delta: -12.7MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20654.61ms. Allocated memory was 130.0MB in the beginning and 507.5MB in the end (delta: 377.5MB). Free memory was 99.6MB in the beginning and 182.5MB in the end (delta: -82.9MB). Peak memory consumption was 294.4MB. Max. memory is 16.1GB. * Witness Printer took 87.80ms. Allocated memory is still 507.5MB. Free memory was 182.5MB in the beginning and 160.4MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L718] 0 _Bool x$flush_delayed; VAL [x$flush_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [x$flush_delayed=0, x$read_delayed_var={0:0}] [L736] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L737] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L719] 0 int x$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=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$read_delayed_var={0:0}] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=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$read_delayed_var={0:0}] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, x$read_delayed_var={0:0}] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$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] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, 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$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] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd1=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] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$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] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1804; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1804, ((void *)0), P0, ((void *)0))=-2, t1804={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1805; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1805, ((void *)0), P1, ((void *)0))=-1, t1804={5:0}, t1805={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1806; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1806, ((void *)0), P2, ((void *)0))=0, t1804={5:0}, t1805={6:0}, t1806={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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1036 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 1102 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 859 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1765 IncrementalHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 243 mSDtfsCounter, 1765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=775occurred in iteration=10, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1182 NumberOfCodeBlocks, 1182 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1080 ConstructedInterpolants, 0 QuantifiedInterpolants, 5432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:36:55,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7f8470-15b1-430b-8230-10683f7eaeaa/bin/uautomizer-tPACEb0tL8/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