./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro --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 3fc7a688cbe32836e1b8ce30abe37b248e61f96ae5014519dab91b2515bcd4ed --- 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-8393723 [2022-11-18 20:03:40,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:03:40,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:03:40,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:03:40,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:03:40,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:03:40,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:03:40,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:03:40,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:03:40,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:03:40,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:03:40,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:03:40,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:03:40,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:03:40,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:03:40,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:03:40,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:03:40,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:03:40,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:03:40,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:03:40,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:03:40,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:03:40,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:03:40,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:03:40,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:03:40,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:03:40,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:03:40,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:03:40,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:03:40,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:03:40,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:03:40,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:03:40,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:03:40,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:03:40,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:03:40,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:03:40,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:03:40,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:03:40,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:03:40,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:03:40,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:03:40,403 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:03:40,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:03:40,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:03:40,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:03:40,452 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:03:40,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:03:40,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:03:40,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:03:40,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:03:40,455 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:03:40,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:03:40,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:03:40,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:03:40,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:03:40,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:03:40,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:03:40,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:03:40,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:03:40,458 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:03:40,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:03:40,459 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:03:40,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:03:40,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:03:40,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:03:40,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:03:40,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:03:40,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:03:40,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:03:40,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:03:40,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:03:40,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:03:40,462 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:03:40,462 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:03:40,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:03:40,463 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_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/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_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro 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 -> 3fc7a688cbe32836e1b8ce30abe37b248e61f96ae5014519dab91b2515bcd4ed [2022-11-18 20:03:40,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:03:40,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:03:40,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:03:40,820 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:03:40,821 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:03:40,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-11-18 20:03:40,905 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/data/0aa6d402a/6e3285ab42ab40ce995677c08c1d81f9/FLAG60b479867 [2022-11-18 20:03:41,525 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:03:41,526 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-11-18 20:03:41,551 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/data/0aa6d402a/6e3285ab42ab40ce995677c08c1d81f9/FLAG60b479867 [2022-11-18 20:03:41,798 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/data/0aa6d402a/6e3285ab42ab40ce995677c08c1d81f9 [2022-11-18 20:03:41,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:03:41,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:03:41,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:03:41,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:03:41,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:03:41,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:03:41" (1/1) ... [2022-11-18 20:03:41,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f533214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:41, skipping insertion in model container [2022-11-18 20:03:41,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:03:41" (1/1) ... [2022-11-18 20:03:41,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:03:41,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:03:42,124 WARN L234 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_03a91350-a821-495e-a5f5-c9a94a7da153/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i[1001,1014] [2022-11-18 20:03:42,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:42,421 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:03:42,436 WARN L234 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_03a91350-a821-495e-a5f5-c9a94a7da153/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i[1001,1014] [2022-11-18 20:03:42,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:42,544 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:03:42,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42 WrapperNode [2022-11-18 20:03:42,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:03:42,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:03:42,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:03:42,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:03:42,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,632 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-18 20:03:42,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:03:42,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:03:42,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:03:42,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:03:42,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:03:42,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:03:42,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:03:42,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:03:42,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:03:42,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:42,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:03:42,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:03:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:03:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:03:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:03:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:03:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:03:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:03:42,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:03:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:03:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:03:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:03:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:03:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:03:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:03:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:03:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:03:42,785 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:03:42,999 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:03:43,009 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:03:43,379 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:03:43,595 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:03:43,596 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:03:43,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:43 BoogieIcfgContainer [2022-11-18 20:03:43,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:03:43,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:03:43,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:03:43,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:03:43,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:03:41" (1/3) ... [2022-11-18 20:03:43,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195fb534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:03:43, skipping insertion in model container [2022-11-18 20:03:43,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (2/3) ... [2022-11-18 20:03:43,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195fb534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:03:43, skipping insertion in model container [2022-11-18 20:03:43,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:43" (3/3) ... [2022-11-18 20:03:43,608 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i [2022-11-18 20:03:43,616 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:03:43,627 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:03:43,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:03:43,628 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:03:43,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:03:43,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-11-18 20:03:43,872 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-18 20:03:43,872 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:03:43,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-18 20:03:43,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-11-18 20:03:43,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-11-18 20:03:43,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:03:43,911 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;@78964175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:03:43,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 20:03:43,941 INFO L130 PetriNetUnfolder]: 0/60 cut-off events. [2022-11-18 20:03:43,941 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:03:43,942 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:43,943 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] [2022-11-18 20:03:43,944 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-18 20:03:43,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash 742649825, now seen corresponding path program 1 times [2022-11-18 20:03:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257475197] [2022-11-18 20:03:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:43,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:44,705 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-18 20:03:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:44,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257475197] [2022-11-18 20:03:44,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257475197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:44,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:44,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:44,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547992352] [2022-11-18 20:03:44,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:44,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:44,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:44,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:44,770 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 117 [2022-11-18 20:03:44,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-18 20:03:44,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:44,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 117 [2022-11-18 20:03:44,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:44,946 INFO L130 PetriNetUnfolder]: 37/225 cut-off events. [2022-11-18 20:03:44,946 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-18 20:03:44,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 225 events. 37/225 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 707 event pairs, 7 based on Foata normal form. 13/222 useless extension candidates. Maximal degree in co-relation 264. Up to 51 conditions per place. [2022-11-18 20:03:44,952 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 11 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2022-11-18 20:03:44,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 114 transitions, 266 flow [2022-11-18 20:03:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:03:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-11-18 20:03:44,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-11-18 20:03:44,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-11-18 20:03:44,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-11-18 20:03:44,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:44,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-11-18 20:03:44,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-18 20:03:44,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-18 20:03:44,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-18 20:03:44,984 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 330 transitions. [2022-11-18 20:03:44,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 114 transitions, 266 flow [2022-11-18 20:03:44,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 114 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:03:44,992 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-11-18 20:03:44,999 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-11-18 20:03:45,005 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-11-18 20:03:45,006 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-11-18 20:03:45,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-18 20:03:45,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:45,007 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] [2022-11-18 20:03:45,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:03:45,008 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-18 20:03:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1828284566, now seen corresponding path program 1 times [2022-11-18 20:03:45,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:45,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693640528] [2022-11-18 20:03:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:45,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:45,427 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-18 20:03:45,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:45,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693640528] [2022-11-18 20:03:45,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693640528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:45,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:45,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:03:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730643742] [2022-11-18 20:03:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:45,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:03:45,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:45,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:03:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:03:45,432 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2022-11-18 20:03:45,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 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-18 20:03:45,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:45,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2022-11-18 20:03:45,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:46,276 INFO L130 PetriNetUnfolder]: 746/2119 cut-off events. [2022-11-18 20:03:46,276 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-11-18 20:03:46,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3410 conditions, 2119 events. 746/2119 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15930 event pairs, 302 based on Foata normal form. 0/2050 useless extension candidates. Maximal degree in co-relation 3353. Up to 705 conditions per place. [2022-11-18 20:03:46,297 INFO L137 encePairwiseOnDemand]: 109/117 looper letters, 24 selfloop transitions, 4 changer transitions 54/159 dead transitions. [2022-11-18 20:03:46,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 159 transitions, 488 flow [2022-11-18 20:03:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:03:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:03:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2022-11-18 20:03:46,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8471035137701804 [2022-11-18 20:03:46,307 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2022-11-18 20:03:46,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2022-11-18 20:03:46,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:46,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2022-11-18 20:03:46,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 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-18 20:03:46,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 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-18 20:03:46,319 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 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-18 20:03:46,319 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 9 states and 892 transitions. [2022-11-18 20:03:46,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 159 transitions, 488 flow [2022-11-18 20:03:46,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 159 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:03:46,328 INFO L231 Difference]: Finished difference. Result has 132 places, 101 transitions, 258 flow [2022-11-18 20:03:46,328 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=258, PETRI_PLACES=132, PETRI_TRANSITIONS=101} [2022-11-18 20:03:46,329 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2022-11-18 20:03:46,329 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 101 transitions, 258 flow [2022-11-18 20:03:46,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 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-18 20:03:46,331 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:46,331 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] [2022-11-18 20:03:46,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:03:46,332 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-18 20:03:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash 158082423, now seen corresponding path program 1 times [2022-11-18 20:03:46,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:46,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152298747] [2022-11-18 20:03:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:46,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,731 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-18 20:03:46,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:46,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152298747] [2022-11-18 20:03:46,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152298747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:46,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:46,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:03:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322302310] [2022-11-18 20:03:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:46,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:03:46,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:46,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:03:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:46,736 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2022-11-18 20:03:46,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 101 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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-18 20:03:46,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:46,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2022-11-18 20:03:46,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:47,223 INFO L130 PetriNetUnfolder]: 488/1002 cut-off events. [2022-11-18 20:03:47,223 INFO L131 PetriNetUnfolder]: For 1851/1851 co-relation queries the response was YES. [2022-11-18 20:03:47,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1002 events. 488/1002 cut-off events. For 1851/1851 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5384 event pairs, 114 based on Foata normal form. 24/993 useless extension candidates. Maximal degree in co-relation 2928. Up to 486 conditions per place. [2022-11-18 20:03:47,232 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 26 selfloop transitions, 3 changer transitions 40/146 dead transitions. [2022-11-18 20:03:47,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 146 transitions, 640 flow [2022-11-18 20:03:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:03:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:03:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 887 transitions. [2022-11-18 20:03:47,236 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.842355175688509 [2022-11-18 20:03:47,236 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 887 transitions. [2022-11-18 20:03:47,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 887 transitions. [2022-11-18 20:03:47,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:47,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 887 transitions. [2022-11-18 20:03:47,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.55555555555556) internal successors, (887), 9 states have internal predecessors, (887), 0 states have call successors, (0), 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-18 20:03:47,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 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-18 20:03:47,245 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 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-18 20:03:47,245 INFO L175 Difference]: Start difference. First operand has 132 places, 101 transitions, 258 flow. Second operand 9 states and 887 transitions. [2022-11-18 20:03:47,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 146 transitions, 640 flow [2022-11-18 20:03:47,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 146 transitions, 622 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-18 20:03:47,259 INFO L231 Difference]: Finished difference. Result has 125 places, 101 transitions, 271 flow [2022-11-18 20:03:47,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=125, PETRI_TRANSITIONS=101} [2022-11-18 20:03:47,261 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 3 predicate places. [2022-11-18 20:03:47,262 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 271 flow [2022-11-18 20:03:47,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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-18 20:03:47,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:47,263 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] [2022-11-18 20:03:47,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:03:47,263 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-18 20:03:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1658532895, now seen corresponding path program 1 times [2022-11-18 20:03:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:47,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389056816] [2022-11-18 20:03:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:47,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,568 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-18 20:03:47,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:47,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389056816] [2022-11-18 20:03:47,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389056816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:47,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:47,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:03:47,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648818958] [2022-11-18 20:03:47,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:47,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:03:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:47,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:03:47,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:03:47,572 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-18 20:03:47,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 101 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 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-18 20:03:47,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:47,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-18 20:03:47,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:48,209 INFO L130 PetriNetUnfolder]: 1007/2147 cut-off events. [2022-11-18 20:03:48,210 INFO L131 PetriNetUnfolder]: For 2454/2555 co-relation queries the response was YES. [2022-11-18 20:03:48,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4991 conditions, 2147 events. 1007/2147 cut-off events. For 2454/2555 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14957 event pairs, 131 based on Foata normal form. 0/2025 useless extension candidates. Maximal degree in co-relation 4925. Up to 526 conditions per place. [2022-11-18 20:03:48,225 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 46 selfloop transitions, 13 changer transitions 23/163 dead transitions. [2022-11-18 20:03:48,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 163 transitions, 623 flow [2022-11-18 20:03:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:03:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:03:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1021 transitions. [2022-11-18 20:03:48,230 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8726495726495727 [2022-11-18 20:03:48,230 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1021 transitions. [2022-11-18 20:03:48,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1021 transitions. [2022-11-18 20:03:48,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:48,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1021 transitions. [2022-11-18 20:03:48,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.1) internal successors, (1021), 10 states have internal predecessors, (1021), 0 states have call successors, (0), 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-18 20:03:48,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-18 20:03:48,243 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-18 20:03:48,244 INFO L175 Difference]: Start difference. First operand has 125 places, 101 transitions, 271 flow. Second operand 10 states and 1021 transitions. [2022-11-18 20:03:48,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 163 transitions, 623 flow [2022-11-18 20:03:48,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 163 transitions, 605 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-18 20:03:48,255 INFO L231 Difference]: Finished difference. Result has 126 places, 113 transitions, 351 flow [2022-11-18 20:03:48,255 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=351, PETRI_PLACES=126, PETRI_TRANSITIONS=113} [2022-11-18 20:03:48,257 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 4 predicate places. [2022-11-18 20:03:48,261 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 113 transitions, 351 flow [2022-11-18 20:03:48,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 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-18 20:03:48,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:48,262 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-18 20:03:48,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:03:48,263 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-18 20:03:48,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash -919166809, now seen corresponding path program 1 times [2022-11-18 20:03:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:48,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316275620] [2022-11-18 20:03:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:48,569 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-18 20:03:48,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:48,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316275620] [2022-11-18 20:03:48,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316275620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:48,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:48,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:03:48,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721466605] [2022-11-18 20:03:48,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:48,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:03:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:48,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:03:48,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:48,573 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-18 20:03:48,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 113 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 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-18 20:03:48,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:48,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-18 20:03:48,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:49,247 INFO L130 PetriNetUnfolder]: 808/1796 cut-off events. [2022-11-18 20:03:49,247 INFO L131 PetriNetUnfolder]: For 3074/3164 co-relation queries the response was YES. [2022-11-18 20:03:49,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 1796 events. 808/1796 cut-off events. For 3074/3164 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 12826 event pairs, 71 based on Foata normal form. 32/1756 useless extension candidates. Maximal degree in co-relation 5175. Up to 234 conditions per place. [2022-11-18 20:03:49,259 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 49 selfloop transitions, 18 changer transitions 45/193 dead transitions. [2022-11-18 20:03:49,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 193 transitions, 951 flow [2022-11-18 20:03:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:03:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:03:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1325 transitions. [2022-11-18 20:03:49,264 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.871137409598948 [2022-11-18 20:03:49,264 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1325 transitions. [2022-11-18 20:03:49,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1325 transitions. [2022-11-18 20:03:49,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:49,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1325 transitions. [2022-11-18 20:03:49,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.92307692307692) internal successors, (1325), 13 states have internal predecessors, (1325), 0 states have call successors, (0), 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-18 20:03:49,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 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-18 20:03:49,275 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 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-18 20:03:49,275 INFO L175 Difference]: Start difference. First operand has 126 places, 113 transitions, 351 flow. Second operand 13 states and 1325 transitions. [2022-11-18 20:03:49,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 193 transitions, 951 flow [2022-11-18 20:03:49,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 193 transitions, 949 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:03:49,285 INFO L231 Difference]: Finished difference. Result has 144 places, 120 transitions, 483 flow [2022-11-18 20:03:49,285 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=483, PETRI_PLACES=144, PETRI_TRANSITIONS=120} [2022-11-18 20:03:49,288 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 22 predicate places. [2022-11-18 20:03:49,288 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 120 transitions, 483 flow [2022-11-18 20:03:49,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 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-18 20:03:49,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:49,289 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] [2022-11-18 20:03:49,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:03:49,289 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-18 20:03:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2060125105, now seen corresponding path program 1 times [2022-11-18 20:03:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:49,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114118792] [2022-11-18 20:03:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,662 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-18 20:03:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:49,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114118792] [2022-11-18 20:03:49,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114118792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:49,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:49,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:03:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979255416] [2022-11-18 20:03:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:49,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:03:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:49,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:03:49,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:49,668 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-11-18 20:03:49,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 120 transitions, 483 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 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-18 20:03:49,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:49,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-11-18 20:03:49,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:50,276 INFO L130 PetriNetUnfolder]: 254/1341 cut-off events. [2022-11-18 20:03:50,276 INFO L131 PetriNetUnfolder]: For 2821/3061 co-relation queries the response was YES. [2022-11-18 20:03:50,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3866 conditions, 1341 events. 254/1341 cut-off events. For 2821/3061 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11409 event pairs, 21 based on Foata normal form. 38/1323 useless extension candidates. Maximal degree in co-relation 3786. Up to 200 conditions per place. [2022-11-18 20:03:50,289 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 46 selfloop transitions, 11 changer transitions 25/176 dead transitions. [2022-11-18 20:03:50,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 176 transitions, 883 flow [2022-11-18 20:03:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:03:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:03:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1061 transitions. [2022-11-18 20:03:50,292 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8243978243978244 [2022-11-18 20:03:50,292 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1061 transitions. [2022-11-18 20:03:50,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1061 transitions. [2022-11-18 20:03:50,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:50,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1061 transitions. [2022-11-18 20:03:50,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.45454545454545) internal successors, (1061), 11 states have internal predecessors, (1061), 0 states have call successors, (0), 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-18 20:03:50,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 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-18 20:03:50,301 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 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-18 20:03:50,301 INFO L175 Difference]: Start difference. First operand has 144 places, 120 transitions, 483 flow. Second operand 11 states and 1061 transitions. [2022-11-18 20:03:50,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 176 transitions, 883 flow [2022-11-18 20:03:50,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 176 transitions, 851 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-18 20:03:50,327 INFO L231 Difference]: Finished difference. Result has 153 places, 126 transitions, 552 flow [2022-11-18 20:03:50,327 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=552, PETRI_PLACES=153, PETRI_TRANSITIONS=126} [2022-11-18 20:03:50,330 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 31 predicate places. [2022-11-18 20:03:50,330 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 126 transitions, 552 flow [2022-11-18 20:03:50,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 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-18 20:03:50,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:50,331 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] [2022-11-18 20:03:50,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:03:50,331 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-18 20:03:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash -779620077, now seen corresponding path program 2 times [2022-11-18 20:03:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:50,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832934466] [2022-11-18 20:03:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:50,678 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-18 20:03:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:50,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832934466] [2022-11-18 20:03:50,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832934466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:50,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:50,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:03:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011040900] [2022-11-18 20:03:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:50,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:03:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:03:50,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:03:50,689 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-11-18 20:03:50,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 126 transitions, 552 flow. Second operand has 8 states, 8 states have (on average 91.5) internal successors, (732), 8 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:03:50,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:50,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-11-18 20:03:50,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:51,232 INFO L130 PetriNetUnfolder]: 291/1622 cut-off events. [2022-11-18 20:03:51,232 INFO L131 PetriNetUnfolder]: For 4062/4290 co-relation queries the response was YES. [2022-11-18 20:03:51,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4886 conditions, 1622 events. 291/1622 cut-off events. For 4062/4290 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15275 event pairs, 26 based on Foata normal form. 44/1597 useless extension candidates. Maximal degree in co-relation 4801. Up to 264 conditions per place. [2022-11-18 20:03:51,249 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 45 selfloop transitions, 9 changer transitions 25/173 dead transitions. [2022-11-18 20:03:51,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 173 transitions, 1027 flow [2022-11-18 20:03:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:03:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:03:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 879 transitions. [2022-11-18 20:03:51,252 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8347578347578347 [2022-11-18 20:03:51,253 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 879 transitions. [2022-11-18 20:03:51,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 879 transitions. [2022-11-18 20:03:51,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:51,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 879 transitions. [2022-11-18 20:03:51,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.66666666666667) internal successors, (879), 9 states have internal predecessors, (879), 0 states have call successors, (0), 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-18 20:03:51,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 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-18 20:03:51,259 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 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-18 20:03:51,259 INFO L175 Difference]: Start difference. First operand has 153 places, 126 transitions, 552 flow. Second operand 9 states and 879 transitions. [2022-11-18 20:03:51,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 173 transitions, 1027 flow [2022-11-18 20:03:51,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 173 transitions, 917 flow, removed 55 selfloop flow, removed 6 redundant places. [2022-11-18 20:03:51,295 INFO L231 Difference]: Finished difference. Result has 153 places, 124 transitions, 527 flow [2022-11-18 20:03:51,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=527, PETRI_PLACES=153, PETRI_TRANSITIONS=124} [2022-11-18 20:03:51,296 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 31 predicate places. [2022-11-18 20:03:51,297 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 124 transitions, 527 flow [2022-11-18 20:03:51,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.5) internal successors, (732), 8 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:03:51,297 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:51,297 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] [2022-11-18 20:03:51,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:03:51,298 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-18 20:03:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1080203571, now seen corresponding path program 3 times [2022-11-18 20:03:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:51,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199441325] [2022-11-18 20:03:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:51,612 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-18 20:03:51,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:51,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199441325] [2022-11-18 20:03:51,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199441325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:51,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:51,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:03:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120449146] [2022-11-18 20:03:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:51,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:03:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:03:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:03:51,616 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-18 20:03:51,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 124 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 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-18 20:03:51,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:51,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-18 20:03:51,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:52,410 INFO L130 PetriNetUnfolder]: 955/2407 cut-off events. [2022-11-18 20:03:52,411 INFO L131 PetriNetUnfolder]: For 5451/5717 co-relation queries the response was YES. [2022-11-18 20:03:52,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7642 conditions, 2407 events. 955/2407 cut-off events. For 5451/5717 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 21125 event pairs, 73 based on Foata normal form. 68/2365 useless extension candidates. Maximal degree in co-relation 7613. Up to 356 conditions per place. [2022-11-18 20:03:52,429 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 45 selfloop transitions, 22 changer transitions 27/179 dead transitions. [2022-11-18 20:03:52,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 179 transitions, 1033 flow [2022-11-18 20:03:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:03:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:03:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1593 transitions. [2022-11-18 20:03:52,434 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8509615384615384 [2022-11-18 20:03:52,434 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1593 transitions. [2022-11-18 20:03:52,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1593 transitions. [2022-11-18 20:03:52,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:52,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1593 transitions. [2022-11-18 20:03:52,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.5625) internal successors, (1593), 16 states have internal predecessors, (1593), 0 states have call successors, (0), 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-18 20:03:52,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 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-18 20:03:52,444 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 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-18 20:03:52,444 INFO L175 Difference]: Start difference. First operand has 153 places, 124 transitions, 527 flow. Second operand 16 states and 1593 transitions. [2022-11-18 20:03:52,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 179 transitions, 1033 flow [2022-11-18 20:03:52,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 179 transitions, 980 flow, removed 9 selfloop flow, removed 10 redundant places. [2022-11-18 20:03:52,494 INFO L231 Difference]: Finished difference. Result has 162 places, 125 transitions, 563 flow [2022-11-18 20:03:52,495 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=563, PETRI_PLACES=162, PETRI_TRANSITIONS=125} [2022-11-18 20:03:52,495 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 40 predicate places. [2022-11-18 20:03:52,495 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 125 transitions, 563 flow [2022-11-18 20:03:52,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 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-18 20:03:52,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:52,496 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:52,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:03:52,497 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-18 20:03:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2037523511, now seen corresponding path program 1 times [2022-11-18 20:03:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:52,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353461857] [2022-11-18 20:03:52,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:03:52,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:03:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:03:52,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:03:52,645 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:03:52,646 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 20:03:52,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 20:03:52,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 20:03:52,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 20:03:52,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 20:03:52,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 20:03:52,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:03:52,652 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:52,660 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:03:52,661 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:03:52,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:03:52 BasicIcfg [2022-11-18 20:03:52,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:03:52,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:03:52,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:03:52,788 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:03:52,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:43" (3/4) ... [2022-11-18 20:03:52,790 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:03:52,910 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:03:52,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:03:52,911 INFO L158 Benchmark]: Toolchain (without parser) took 11108.83ms. Allocated memory was 98.6MB in the beginning and 335.5MB in the end (delta: 237.0MB). Free memory was 62.6MB in the beginning and 241.1MB in the end (delta: -178.5MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2022-11-18 20:03:52,911 INFO L158 Benchmark]: CDTParser took 18.81ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 80.7MB in the end (delta: -12.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:03:52,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.31ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 61.6MB in the end (delta: 821.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:03:52,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.19ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 59.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:03:52,912 INFO L158 Benchmark]: Boogie Preprocessor took 40.61ms. Allocated memory is still 98.6MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:03:52,913 INFO L158 Benchmark]: RCFGBuilder took 921.80ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 57.2MB in the beginning and 108.4MB in the end (delta: -51.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2022-11-18 20:03:52,913 INFO L158 Benchmark]: TraceAbstraction took 9186.19ms. Allocated memory was 144.7MB in the beginning and 335.5MB in the end (delta: 190.8MB). Free memory was 107.5MB in the beginning and 265.2MB in the end (delta: -157.8MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. [2022-11-18 20:03:52,913 INFO L158 Benchmark]: Witness Printer took 122.56ms. Allocated memory is still 335.5MB. Free memory was 265.2MB in the beginning and 241.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-18 20:03:52,915 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 18.81ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 80.7MB in the end (delta: -12.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.31ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 61.6MB in the end (delta: 821.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.19ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 59.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.61ms. Allocated memory is still 98.6MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 921.80ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 57.2MB in the beginning and 108.4MB in the end (delta: -51.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9186.19ms. Allocated memory was 144.7MB in the beginning and 335.5MB in the end (delta: 190.8MB). Free memory was 107.5MB in the beginning and 265.2MB in the end (delta: -157.8MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. * Witness Printer took 122.56ms. Allocated memory is still 335.5MB. Free memory was 265.2MB in the beginning and 241.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L718] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0] [L734] 0 int *x$read_delayed_var; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L724] 0 int x$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=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}] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=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}] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=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}] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=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}] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=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}] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}] [L733] 0 _Bool x$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}] [L738] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L736] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L735] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L737] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L730] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L729] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L740] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L732] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L731] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L836] 0 pthread_t t412; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t412={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, z=0] [L837] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t412, ((void *)0), P0, ((void *)0))=-2, t412={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, z=0] [L838] 0 pthread_t t413; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t412={5:0}, t413={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, z=0] [L839] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t413, ((void *)0), P1, ((void *)0))=-1, t412={5:0}, t413={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, z=0] [L840] 0 pthread_t t414; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L841] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t414, ((void *)0), P2, ((void *)0))=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L748] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 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) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 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 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 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) [L815] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L816] 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 [L817] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L818] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 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) [L848] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] 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 [L850] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L854] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 839]: 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: 837]: 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, 144 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: 8.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 553 mSDsluCounter, 397 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 937 IncrementalHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 90 mSDtfsCounter, 937 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=8, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 719 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 2840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-18 20:03:52,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a91350-a821-495e-a5f5-c9a94a7da153/bin/uautomizer-TMbwUNV5ro/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