./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R --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 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- 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-38b53e6 [2022-11-25 17:31:25,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:31:25,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:31:25,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:31:25,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:31:25,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:31:25,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:31:25,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:31:25,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:31:25,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:31:25,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:31:25,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:31:25,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:31:25,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:31:25,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:31:25,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:31:25,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:31:25,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:31:25,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:31:25,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:31:25,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:31:25,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:31:25,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:31:25,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:31:25,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:31:25,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:31:25,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:31:25,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:31:25,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:31:25,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:31:25,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:31:25,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:31:25,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:31:25,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:31:25,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:31:25,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:31:25,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:31:25,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:31:25,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:31:25,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:31:25,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:31:25,497 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:31:25,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:31:25,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:31:25,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:31:25,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:31:25,542 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:31:25,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:31:25,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:31:25,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:31:25,544 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:31:25,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:31:25,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:31:25,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:31:25,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:31:25,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:31:25,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:31:25,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:31:25,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:31:25,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:31:25,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:31:25,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:31:25,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:31:25,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:31:25,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:31:25,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:31:25,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:25,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:31:25,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:31:25,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:31:25,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:31:25,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:31:25,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:31:25,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:31:25,552 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:31:25,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:31:25,553 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/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_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R 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 -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2022-11-25 17:31:25,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:31:25,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:31:25,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:31:25,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:31:25,882 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:31:25,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-25 17:31:28,903 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:31:29,209 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:31:29,209 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-25 17:31:29,224 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/data/5291cf640/a55697a990264ba498afe72b416336a6/FLAGf9ce799c3 [2022-11-25 17:31:29,245 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/data/5291cf640/a55697a990264ba498afe72b416336a6 [2022-11-25 17:31:29,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:31:29,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:31:29,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:29,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:31:29,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:31:29,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:29" (1/1) ... [2022-11-25 17:31:29,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157f6b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:29, skipping insertion in model container [2022-11-25 17:31:29,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:29" (1/1) ... [2022-11-25 17:31:29,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:31:29,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:31:29,532 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-25 17:31:29,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:29,837 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:31:29,852 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-25 17:31:29,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:29,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:29,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:30,028 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:31:30,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30 WrapperNode [2022-11-25 17:31:30,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:30,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:30,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:31:30,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:31:30,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,127 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-25 17:31:30,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:30,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:31:30,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:31:30,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:31:30,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,170 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:31:30,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:31:30,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:31:30,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:31:30,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (1/1) ... [2022-11-25 17:31:30,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:30,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:31:30,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:31:30,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:31:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:31:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:31:30,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:31:30,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:31:30,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:31:30,263 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:31:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:31:30,263 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:31:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:31:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:31:30,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:31:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:31:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:31:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:31:30,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:31:30,266 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:31:30,505 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:31:30,508 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:31:30,898 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:31:31,136 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:31:31,136 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:31:31,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:31 BoogieIcfgContainer [2022-11-25 17:31:31,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:31:31,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:31:31,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:31:31,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:31:31,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:31:29" (1/3) ... [2022-11-25 17:31:31,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6441f23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:31, skipping insertion in model container [2022-11-25 17:31:31,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:30" (2/3) ... [2022-11-25 17:31:31,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6441f23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:31, skipping insertion in model container [2022-11-25 17:31:31,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:31" (3/3) ... [2022-11-25 17:31:31,157 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2022-11-25 17:31:31,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:31:31,181 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:31:31,182 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:31:31,182 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:31:31,272 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:31:31,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-11-25 17:31:31,460 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-25 17:31:31,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:31,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 17:31:31,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-11-25 17:31:31,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-11-25 17:31:31,476 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:31:31,494 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2022-11-25 17:31:31,497 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2022-11-25 17:31:31,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2022-11-25 17:31:31,527 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-25 17:31:31,528 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:31,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 17:31:31,530 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-11-25 17:31:36,872 INFO L134 LiptonReduction]: Checked pairs total: 5111 [2022-11-25 17:31:36,873 INFO L136 LiptonReduction]: Total number of compositions: 105 [2022-11-25 17:31:36,900 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:31:36,907 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;@1d320ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:31:36,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 17:31:36,912 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 17:31:36,913 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:36,913 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:36,914 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:31:36,914 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-25 17:31:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 476804263, now seen corresponding path program 1 times [2022-11-25 17:31:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:36,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007774427] [2022-11-25 17:31:36,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:37,413 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-25 17:31:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:37,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007774427] [2022-11-25 17:31:37,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007774427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:37,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:37,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:31:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997887335] [2022-11-25 17:31:37,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:37,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:37,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:37,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:37,471 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 224 [2022-11-25 17:31:37,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-25 17:31:37,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:37,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 224 [2022-11-25 17:31:37,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:37,897 INFO L130 PetriNetUnfolder]: 1079/1692 cut-off events. [2022-11-25 17:31:37,897 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 17:31:37,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 1692 events. 1079/1692 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8038 event pairs, 275 based on Foata normal form. 0/1608 useless extension candidates. Maximal degree in co-relation 3328. Up to 1285 conditions per place. [2022-11-25 17:31:37,919 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2022-11-25 17:31:37,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2022-11-25 17:31:37,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2022-11-25 17:31:37,950 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2022-11-25 17:31:37,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2022-11-25 17:31:37,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2022-11-25 17:31:37,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:37,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2022-11-25 17:31:37,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:37,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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-25 17:31:37,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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-25 17:31:37,994 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 356 transitions. [2022-11-25 17:31:37,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2022-11-25 17:31:37,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:31:38,000 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-25 17:31:38,002 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-25 17:31:38,009 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-25 17:31:38,010 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-25 17:31:38,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-25 17:31:38,010 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:38,010 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:38,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:31:38,011 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-25 17:31:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:38,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1940630203, now seen corresponding path program 1 times [2022-11-25 17:31:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:38,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353913563] [2022-11-25 17:31:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:38,335 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-25 17:31:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:38,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353913563] [2022-11-25 17:31:38,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353913563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:38,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:38,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:31:38,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535490251] [2022-11-25 17:31:38,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:38,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:38,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:38,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:38,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:38,361 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 224 [2022-11-25 17:31:38,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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-25 17:31:38,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:38,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 224 [2022-11-25 17:31:38,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:38,846 INFO L130 PetriNetUnfolder]: 1505/2258 cut-off events. [2022-11-25 17:31:38,846 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-11-25 17:31:38,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 2258 events. 1505/2258 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9807 event pairs, 641 based on Foata normal form. 120/2378 useless extension candidates. Maximal degree in co-relation 4704. Up to 1889 conditions per place. [2022-11-25 17:31:38,859 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 30 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2022-11-25 17:31:38,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 232 flow [2022-11-25 17:31:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:31:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2022-11-25 17:31:38,866 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2022-11-25 17:31:38,866 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2022-11-25 17:31:38,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2022-11-25 17:31:38,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:38,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2022-11-25 17:31:38,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-25 17:31:38,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:31:38,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:31:38,875 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 545 transitions. [2022-11-25 17:31:38,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 232 flow [2022-11-25 17:31:38,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:38,879 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 86 flow [2022-11-25 17:31:38,880 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-11-25 17:31:38,881 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-11-25 17:31:38,881 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 86 flow [2022-11-25 17:31:38,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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-25 17:31:38,882 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:38,882 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:38,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:31:38,883 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-25 17:31:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -454927824, now seen corresponding path program 1 times [2022-11-25 17:31:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:38,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270399155] [2022-11-25 17:31:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:39,189 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-25 17:31:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:39,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270399155] [2022-11-25 17:31:39,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270399155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:39,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:39,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496547195] [2022-11-25 17:31:39,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:39,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:39,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:39,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:39,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:39,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 224 [2022-11-25 17:31:39,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 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-25 17:31:39,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:39,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 224 [2022-11-25 17:31:39,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:39,669 INFO L130 PetriNetUnfolder]: 1329/1994 cut-off events. [2022-11-25 17:31:39,669 INFO L131 PetriNetUnfolder]: For 1036/1036 co-relation queries the response was YES. [2022-11-25 17:31:39,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5037 conditions, 1994 events. 1329/1994 cut-off events. For 1036/1036 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8247 event pairs, 371 based on Foata normal form. 96/2090 useless extension candidates. Maximal degree in co-relation 5024. Up to 1301 conditions per place. [2022-11-25 17:31:39,685 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 31 selfloop transitions, 3 changer transitions 20/54 dead transitions. [2022-11-25 17:31:39,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 282 flow [2022-11-25 17:31:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:31:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-11-25 17:31:39,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48482142857142857 [2022-11-25 17:31:39,688 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2022-11-25 17:31:39,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2022-11-25 17:31:39,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:39,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2022-11-25 17:31:39,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 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-25 17:31:39,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:31:39,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:31:39,694 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 86 flow. Second operand 5 states and 543 transitions. [2022-11-25 17:31:39,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 282 flow [2022-11-25 17:31:39,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:39,702 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 95 flow [2022-11-25 17:31:39,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-11-25 17:31:39,704 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-11-25 17:31:39,704 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 95 flow [2022-11-25 17:31:39,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 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-25 17:31:39,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:39,706 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:39,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:31:39,707 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-25 17:31:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash 873004042, now seen corresponding path program 1 times [2022-11-25 17:31:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:39,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468464154] [2022-11-25 17:31:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:39,966 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-25 17:31:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:39,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468464154] [2022-11-25 17:31:39,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468464154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:39,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:39,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561942234] [2022-11-25 17:31:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:39,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:39,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:39,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:39,984 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 224 [2022-11-25 17:31:39,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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-25 17:31:39,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:39,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 224 [2022-11-25 17:31:39,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:40,268 INFO L130 PetriNetUnfolder]: 660/1096 cut-off events. [2022-11-25 17:31:40,268 INFO L131 PetriNetUnfolder]: For 655/667 co-relation queries the response was YES. [2022-11-25 17:31:40,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1096 events. 660/1096 cut-off events. For 655/667 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5083 event pairs, 151 based on Foata normal form. 95/1177 useless extension candidates. Maximal degree in co-relation 2831. Up to 468 conditions per place. [2022-11-25 17:31:40,275 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 42 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2022-11-25 17:31:40,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 265 flow [2022-11-25 17:31:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:31:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2022-11-25 17:31:40,277 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5033482142857143 [2022-11-25 17:31:40,277 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2022-11-25 17:31:40,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2022-11-25 17:31:40,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:40,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2022-11-25 17:31:40,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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-25 17:31:40,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-25 17:31:40,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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-25 17:31:40,282 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 95 flow. Second operand 4 states and 451 transitions. [2022-11-25 17:31:40,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 265 flow [2022-11-25 17:31:40,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 251 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 17:31:40,287 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 123 flow [2022-11-25 17:31:40,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-11-25 17:31:40,288 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-11-25 17:31:40,288 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 123 flow [2022-11-25 17:31:40,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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-25 17:31:40,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:40,289 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:31:40,289 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-25 17:31:40,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1418115917, now seen corresponding path program 1 times [2022-11-25 17:31:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:40,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304868181] [2022-11-25 17:31:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:40,505 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-25 17:31:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:40,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304868181] [2022-11-25 17:31:40,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304868181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:40,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:40,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679543377] [2022-11-25 17:31:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:40,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:40,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:40,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:40,523 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 224 [2022-11-25 17:31:40,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 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-25 17:31:40,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:40,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 224 [2022-11-25 17:31:40,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:40,808 INFO L130 PetriNetUnfolder]: 476/833 cut-off events. [2022-11-25 17:31:40,808 INFO L131 PetriNetUnfolder]: For 582/592 co-relation queries the response was YES. [2022-11-25 17:31:40,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 833 events. 476/833 cut-off events. For 582/592 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3843 event pairs, 145 based on Foata normal form. 52/875 useless extension candidates. Maximal degree in co-relation 2465. Up to 328 conditions per place. [2022-11-25 17:31:40,813 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 52 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2022-11-25 17:31:40,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 359 flow [2022-11-25 17:31:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:31:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-11-25 17:31:40,815 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2022-11-25 17:31:40,815 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2022-11-25 17:31:40,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2022-11-25 17:31:40,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:40,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2022-11-25 17:31:40,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 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-25 17:31:40,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:31:40,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:31:40,821 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 123 flow. Second operand 5 states and 565 transitions. [2022-11-25 17:31:40,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 359 flow [2022-11-25 17:31:40,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:31:40,824 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 175 flow [2022-11-25 17:31:40,825 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-11-25 17:31:40,825 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2022-11-25 17:31:40,825 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 175 flow [2022-11-25 17:31:40,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 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-25 17:31:40,826 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:40,826 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:40,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:31:40,827 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-25 17:31:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1800964981, now seen corresponding path program 1 times [2022-11-25 17:31:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:40,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922366562] [2022-11-25 17:31:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:41,055 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-25 17:31:41,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:41,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922366562] [2022-11-25 17:31:41,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922366562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:41,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:41,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968624831] [2022-11-25 17:31:41,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:41,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:41,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:41,088 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2022-11-25 17:31:41,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:41,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:41,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2022-11-25 17:31:41,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:41,506 INFO L130 PetriNetUnfolder]: 779/1332 cut-off events. [2022-11-25 17:31:41,506 INFO L131 PetriNetUnfolder]: For 2535/2535 co-relation queries the response was YES. [2022-11-25 17:31:41,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4611 conditions, 1332 events. 779/1332 cut-off events. For 2535/2535 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6309 event pairs, 98 based on Foata normal form. 13/1345 useless extension candidates. Maximal degree in co-relation 4592. Up to 822 conditions per place. [2022-11-25 17:31:41,513 INFO L137 encePairwiseOnDemand]: 216/224 looper letters, 66 selfloop transitions, 11 changer transitions 21/98 dead transitions. [2022-11-25 17:31:41,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 98 transitions, 690 flow [2022-11-25 17:31:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:31:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:31:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 750 transitions. [2022-11-25 17:31:41,516 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47831632653061223 [2022-11-25 17:31:41,517 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 750 transitions. [2022-11-25 17:31:41,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 750 transitions. [2022-11-25 17:31:41,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:41,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 750 transitions. [2022-11-25 17:31:41,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 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-25 17:31:41,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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-25 17:31:41,523 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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-25 17:31:41,523 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 175 flow. Second operand 7 states and 750 transitions. [2022-11-25 17:31:41,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 98 transitions, 690 flow [2022-11-25 17:31:41,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 98 transitions, 661 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:41,530 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 230 flow [2022-11-25 17:31:41,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-11-25 17:31:41,533 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-25 17:31:41,533 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 230 flow [2022-11-25 17:31:41,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:41,534 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:41,534 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:41,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:31:41,538 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-25 17:31:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1857762713, now seen corresponding path program 2 times [2022-11-25 17:31:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:41,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914538316] [2022-11-25 17:31:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:41,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:41,808 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-25 17:31:41,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:41,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914538316] [2022-11-25 17:31:41,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914538316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:41,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:41,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:41,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106502886] [2022-11-25 17:31:41,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:41,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:31:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:31:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:31:41,859 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2022-11-25 17:31:41,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 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-25 17:31:41,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:41,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2022-11-25 17:31:41,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:42,230 INFO L130 PetriNetUnfolder]: 412/764 cut-off events. [2022-11-25 17:31:42,230 INFO L131 PetriNetUnfolder]: For 1871/1871 co-relation queries the response was YES. [2022-11-25 17:31:42,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 764 events. 412/764 cut-off events. For 1871/1871 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3326 event pairs, 70 based on Foata normal form. 9/773 useless extension candidates. Maximal degree in co-relation 3018. Up to 380 conditions per place. [2022-11-25 17:31:42,235 INFO L137 encePairwiseOnDemand]: 216/224 looper letters, 57 selfloop transitions, 9 changer transitions 25/91 dead transitions. [2022-11-25 17:31:42,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 91 transitions, 697 flow [2022-11-25 17:31:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:31:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:31:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 748 transitions. [2022-11-25 17:31:42,238 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4770408163265306 [2022-11-25 17:31:42,238 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 748 transitions. [2022-11-25 17:31:42,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 748 transitions. [2022-11-25 17:31:42,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:42,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 748 transitions. [2022-11-25 17:31:42,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 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-25 17:31:42,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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-25 17:31:42,244 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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-25 17:31:42,244 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 230 flow. Second operand 7 states and 748 transitions. [2022-11-25 17:31:42,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 91 transitions, 697 flow [2022-11-25 17:31:42,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 91 transitions, 626 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-11-25 17:31:42,253 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 209 flow [2022-11-25 17:31:42,254 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2022-11-25 17:31:42,255 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-11-25 17:31:42,255 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 209 flow [2022-11-25 17:31:42,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 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-25 17:31:42,256 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:42,256 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:42,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:31:42,256 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-25 17:31:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1539615005, now seen corresponding path program 3 times [2022-11-25 17:31:42,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:42,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987809082] [2022-11-25 17:31:42,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:42,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:42,567 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-25 17:31:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:42,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987809082] [2022-11-25 17:31:42,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987809082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:42,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:42,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426552970] [2022-11-25 17:31:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:42,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:31:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:31:42,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:31:42,580 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 224 [2022-11-25 17:31:42,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:42,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:42,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 224 [2022-11-25 17:31:42,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:42,789 INFO L130 PetriNetUnfolder]: 247/476 cut-off events. [2022-11-25 17:31:42,789 INFO L131 PetriNetUnfolder]: For 811/815 co-relation queries the response was YES. [2022-11-25 17:31:42,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 476 events. 247/476 cut-off events. For 811/815 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2033 event pairs, 69 based on Foata normal form. 21/489 useless extension candidates. Maximal degree in co-relation 1609. Up to 186 conditions per place. [2022-11-25 17:31:42,792 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 31 selfloop transitions, 11 changer transitions 11/56 dead transitions. [2022-11-25 17:31:42,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 392 flow [2022-11-25 17:31:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:31:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:31:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2022-11-25 17:31:42,794 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48735119047619047 [2022-11-25 17:31:42,794 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2022-11-25 17:31:42,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2022-11-25 17:31:42,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:42,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2022-11-25 17:31:42,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 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-25 17:31:42,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 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-25 17:31:42,802 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 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-25 17:31:42,802 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 209 flow. Second operand 6 states and 655 transitions. [2022-11-25 17:31:42,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 392 flow [2022-11-25 17:31:42,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 347 flow, removed 5 selfloop flow, removed 8 redundant places. [2022-11-25 17:31:42,806 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 179 flow [2022-11-25 17:31:42,807 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2022-11-25 17:31:42,810 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-11-25 17:31:42,810 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 179 flow [2022-11-25 17:31:42,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:42,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:42,811 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] [2022-11-25 17:31:42,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:31:42,811 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-25 17:31:42,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash -726519073, now seen corresponding path program 1 times [2022-11-25 17:31:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:42,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952240297] [2022-11-25 17:31:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:43,640 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-25 17:31:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:43,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952240297] [2022-11-25 17:31:43,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952240297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:43,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:43,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211409431] [2022-11-25 17:31:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:43,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:31:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:43,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:31:43,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:31:43,703 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 224 [2022-11-25 17:31:43,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 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-25 17:31:43,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:43,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 224 [2022-11-25 17:31:43,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:44,060 INFO L130 PetriNetUnfolder]: 214/449 cut-off events. [2022-11-25 17:31:44,061 INFO L131 PetriNetUnfolder]: For 963/965 co-relation queries the response was YES. [2022-11-25 17:31:44,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 449 events. 214/449 cut-off events. For 963/965 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2020 event pairs, 20 based on Foata normal form. 1/446 useless extension candidates. Maximal degree in co-relation 1680. Up to 163 conditions per place. [2022-11-25 17:31:44,063 INFO L137 encePairwiseOnDemand]: 217/224 looper letters, 56 selfloop transitions, 4 changer transitions 27/90 dead transitions. [2022-11-25 17:31:44,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 723 flow [2022-11-25 17:31:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:31:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:31:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 762 transitions. [2022-11-25 17:31:44,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48596938775510207 [2022-11-25 17:31:44,067 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 762 transitions. [2022-11-25 17:31:44,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 762 transitions. [2022-11-25 17:31:44,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:44,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 762 transitions. [2022-11-25 17:31:44,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 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-25 17:31:44,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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-25 17:31:44,073 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 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-25 17:31:44,073 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 179 flow. Second operand 7 states and 762 transitions. [2022-11-25 17:31:44,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 723 flow [2022-11-25 17:31:44,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 621 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-11-25 17:31:44,079 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 173 flow [2022-11-25 17:31:44,080 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2022-11-25 17:31:44,080 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-11-25 17:31:44,080 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 173 flow [2022-11-25 17:31:44,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 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-25 17:31:44,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:44,081 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] [2022-11-25 17:31:44,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:31:44,082 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash 741670009, now seen corresponding path program 2 times [2022-11-25 17:31:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:44,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099494642] [2022-11-25 17:31:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:44,316 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-25 17:31:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:44,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099494642] [2022-11-25 17:31:44,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099494642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:44,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:44,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:44,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998219878] [2022-11-25 17:31:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:44,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:44,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:44,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 224 [2022-11-25 17:31:44,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 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-25 17:31:44,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:44,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 224 [2022-11-25 17:31:44,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:44,567 INFO L130 PetriNetUnfolder]: 267/562 cut-off events. [2022-11-25 17:31:44,568 INFO L131 PetriNetUnfolder]: For 951/951 co-relation queries the response was YES. [2022-11-25 17:31:44,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 562 events. 267/562 cut-off events. For 951/951 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2686 event pairs, 94 based on Foata normal form. 2/561 useless extension candidates. Maximal degree in co-relation 2094. Up to 258 conditions per place. [2022-11-25 17:31:44,570 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 28 selfloop transitions, 1 changer transitions 33/63 dead transitions. [2022-11-25 17:31:44,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 474 flow [2022-11-25 17:31:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:31:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2022-11-25 17:31:44,573 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-11-25 17:31:44,573 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2022-11-25 17:31:44,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2022-11-25 17:31:44,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:44,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2022-11-25 17:31:44,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 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-25 17:31:44,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:31:44,578 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:31:44,579 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 173 flow. Second operand 5 states and 546 transitions. [2022-11-25 17:31:44,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 474 flow [2022-11-25 17:31:44,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 421 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-11-25 17:31:44,587 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 142 flow [2022-11-25 17:31:44,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2022-11-25 17:31:44,588 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-11-25 17:31:44,588 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 142 flow [2022-11-25 17:31:44,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 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-25 17:31:44,589 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:44,589 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] [2022-11-25 17:31:44,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:31:44,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash 232608855, now seen corresponding path program 3 times [2022-11-25 17:31:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:44,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626236737] [2022-11-25 17:31:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:31:44,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:31:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:31:44,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:31:44,705 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:31:44,706 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 17:31:44,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 17:31:44,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 17:31:44,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 17:31:44,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 17:31:44,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 17:31:44,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:31:44,710 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-11-25 17:31:44,717 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:31:44,717 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:31:44,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:31:44 BasicIcfg [2022-11-25 17:31:44,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:31:44,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:31:44,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:31:44,781 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:31:44,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:31" (3/4) ... [2022-11-25 17:31:44,783 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:31:44,902 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:31:44,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:31:44,903 INFO L158 Benchmark]: Toolchain (without parser) took 15653.94ms. Allocated memory was 134.2MB in the beginning and 249.6MB in the end (delta: 115.3MB). Free memory was 70.3MB in the beginning and 85.1MB in the end (delta: -14.8MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2022-11-25 17:31:44,904 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:31:44,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 778.73ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 70.0MB in the beginning and 137.0MB in the end (delta: -67.0MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-11-25 17:31:44,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.26ms. Allocated memory is still 172.0MB. Free memory was 137.0MB in the beginning and 134.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:31:44,905 INFO L158 Benchmark]: Boogie Preprocessor took 46.40ms. Allocated memory is still 172.0MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:31:44,905 INFO L158 Benchmark]: RCFGBuilder took 964.32ms. Allocated memory is still 172.0MB. Free memory was 132.1MB in the beginning and 100.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-25 17:31:44,906 INFO L158 Benchmark]: TraceAbstraction took 13629.45ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 99.8MB in the beginning and 96.6MB in the end (delta: 3.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2022-11-25 17:31:44,906 INFO L158 Benchmark]: Witness Printer took 122.30ms. Allocated memory is still 249.6MB. Free memory was 96.6MB in the beginning and 85.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:31:44,909 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 778.73ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 70.0MB in the beginning and 137.0MB in the end (delta: -67.0MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.26ms. Allocated memory is still 172.0MB. Free memory was 137.0MB in the beginning and 134.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.40ms. Allocated memory is still 172.0MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 964.32ms. Allocated memory is still 172.0MB. Free memory was 132.1MB in the beginning and 100.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13629.45ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 99.8MB in the beginning and 96.6MB in the end (delta: 3.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 122.30ms. Allocated memory is still 249.6MB. Free memory was 96.6MB in the beginning and 85.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 124 PlacesBefore, 34 PlacesAfterwards, 116 TransitionsBefore, 25 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 5111 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2735, independent: 2569, independent conditional: 0, independent unconditional: 2569, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1528, independent: 1484, independent conditional: 0, independent unconditional: 1484, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1528, independent: 1469, independent conditional: 0, independent unconditional: 1469, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 473, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 443, dependent conditional: 0, dependent unconditional: 443, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2735, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 1528, unknown conditional: 0, unknown unconditional: 1528] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=-2, t916={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] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=-1, t916={5:0}, t917={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] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 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, a=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] [L845] 0 pthread_t t918; [L790] 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, a=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] [L846] FCALL, FORK 0 pthread_create(&t918, ((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, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L810] 3 z = 1 [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 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) [L758] 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)) [L759] 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)) [L760] 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)) [L761] 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)) [L762] 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)) [L763] 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)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 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, a=1, 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] [L793] 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) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 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, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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] [L819] 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) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 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 [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 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, a=1, 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] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={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] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 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 [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={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] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=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: 844]: 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: 842]: 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: 846]: 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, 147 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: 13.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 494 mSDsluCounter, 281 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1205 IncrementalHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 102 mSDtfsCounter, 1205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=6, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:31:44,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae3353cd-e581-4918-99b2-fbd6179faa32/bin/uautomizer-ZsLfNo2U6R/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