./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/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_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/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_2441ed46-a992-43fe-8147-5e143a71be67/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 a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --- 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:18:34,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:18:34,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:18:34,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:18:34,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:18:34,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:18:34,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:18:34,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:18:34,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:18:34,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:18:34,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:18:34,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:18:34,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:18:34,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:18:34,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:18:34,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:18:34,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:18:34,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:18:34,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:18:34,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:18:34,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:18:34,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:18:34,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:18:34,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:18:34,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:18:34,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:18:34,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:18:34,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:18:34,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:18:34,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:18:34,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:18:34,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:18:34,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:18:34,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:18:34,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:18:34,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:18:34,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:18:34,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:18:34,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:18:34,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:18:34,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:18:34,169 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:18:34,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:18:34,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:18:34,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:18:34,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:18:34,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:18:34,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:18:34,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:18:34,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:18:34,215 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:18:34,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:18:34,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:18:34,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:18:34,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:18:34,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:18:34,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:18:34,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:18:34,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:18:34,218 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:18:34,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:18:34,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:18:34,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:18:34,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:18:34,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:18:34,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:18:34,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:18:34,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:18:34,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:18:34,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:18:34,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:18:34,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:18:34,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:18:34,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:18:34,221 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:18:34,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:18:34,222 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_2441ed46-a992-43fe-8147-5e143a71be67/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_2441ed46-a992-43fe-8147-5e143a71be67/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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e [2022-11-25 17:18:34,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:18:34,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:18:34,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:18:34,556 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:18:34,557 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:18:34,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:18:37,566 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:18:37,940 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:18:37,941 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:18:37,958 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/data/9f075a970/74b5ac8207b34db390c067666c9257bf/FLAG5c5fbf951 [2022-11-25 17:18:37,977 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/data/9f075a970/74b5ac8207b34db390c067666c9257bf [2022-11-25 17:18:37,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:18:37,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:18:37,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:18:37,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:18:37,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:18:37,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:18:37" (1/1) ... [2022-11-25 17:18:37,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@80e608c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:37, skipping insertion in model container [2022-11-25 17:18:37,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:18:37" (1/1) ... [2022-11-25 17:18:37,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:18:38,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:18:38,267 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_2441ed46-a992-43fe-8147-5e143a71be67/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:18:38,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:18:38,569 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:18:38,582 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_2441ed46-a992-43fe-8147-5e143a71be67/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:18:38,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:18:38,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:18:38,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:18:38,676 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:18:38,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38 WrapperNode [2022-11-25 17:18:38,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:18:38,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:18:38,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:18:38,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:18:38,685 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:18:38" (1/1) ... [2022-11-25 17:18:38,701 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:18:38" (1/1) ... [2022-11-25 17:18:38,726 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-25 17:18:38,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:18:38,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:18:38,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:18:38,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:18:38,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,755 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:18:38,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:18:38,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:18:38,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:18:38,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (1/1) ... [2022-11-25 17:18:38,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:18:38,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:38,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:18:38,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2441ed46-a992-43fe-8147-5e143a71be67/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:18:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:18:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:18:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:18:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:18:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:18:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:18:38,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:18:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:18:38,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:18:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:18:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:18:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:18:38,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:18:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:18:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:18:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:18:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:18:38,868 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:18:39,047 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:18:39,050 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:18:39,438 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:18:39,686 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:18:39,686 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:18:39,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:18:39 BoogieIcfgContainer [2022-11-25 17:18:39,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:18:39,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:18:39,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:18:39,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:18:39,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:18:37" (1/3) ... [2022-11-25 17:18:39,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271efff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:18:39, skipping insertion in model container [2022-11-25 17:18:39,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:38" (2/3) ... [2022-11-25 17:18:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271efff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:18:39, skipping insertion in model container [2022-11-25 17:18:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:18:39" (3/3) ... [2022-11-25 17:18:39,702 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:18:39,725 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:18:39,755 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:18:39,755 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:18:39,756 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:18:39,836 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:18:39,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-25 17:18:39,973 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-25 17:18:39,974 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:18:39,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-11-25 17:18:39,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-25 17:18:39,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-25 17:18:39,999 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:18:40,027 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2022-11-25 17:18:40,032 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2022-11-25 17:18:40,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2022-11-25 17:18:40,097 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-25 17:18:40,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:18:40,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-11-25 17:18:40,103 INFO L119 LiptonReduction]: Number of co-enabled transitions 3404 [2022-11-25 17:18:45,276 INFO L134 LiptonReduction]: Checked pairs total: 9459 [2022-11-25 17:18:45,277 INFO L136 LiptonReduction]: Total number of compositions: 113 [2022-11-25 17:18:45,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:18:45,299 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;@20066c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:18:45,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 17:18:45,311 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-11-25 17:18:45,311 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:18:45,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:18:45,312 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:18:45,313 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:18:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash 563310, now seen corresponding path program 1 times [2022-11-25 17:18:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:45,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037845317] [2022-11-25 17:18:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:45,748 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:18:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:45,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037845317] [2022-11-25 17:18:45,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037845317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:45,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:45,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:18:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751967818] [2022-11-25 17:18:45,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:45,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:18:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:45,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:18:45,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:18:45,795 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 249 [2022-11-25 17:18:45,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:18:45,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:18:45,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 249 [2022-11-25 17:18:45,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:18:47,326 INFO L130 PetriNetUnfolder]: 5879/8506 cut-off events. [2022-11-25 17:18:47,327 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-25 17:18:47,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16650 conditions, 8506 events. 5879/8506 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 50713 event pairs, 1079 based on Foata normal form. 0/8165 useless extension candidates. Maximal degree in co-relation 16638. Up to 6367 conditions per place. [2022-11-25 17:18:47,385 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2022-11-25 17:18:47,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 217 flow [2022-11-25 17:18:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:18:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:18:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2022-11-25 17:18:47,409 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5488621151271754 [2022-11-25 17:18:47,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2022-11-25 17:18:47,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2022-11-25 17:18:47,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:18:47,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2022-11-25 17:18:47,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 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:18:47,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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:18:47,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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:18:47,429 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 410 transitions. [2022-11-25 17:18:47,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 217 flow [2022-11-25 17:18:47,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:18:47,436 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2022-11-25 17:18:47,438 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-11-25 17:18:47,443 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-11-25 17:18:47,443 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2022-11-25 17:18:47,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:18:47,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:18:47,444 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:47,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:18:47,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:18:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1937584046, now seen corresponding path program 1 times [2022-11-25 17:18:47,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:47,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639269200] [2022-11-25 17:18:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:47,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:47,967 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:18:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:47,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639269200] [2022-11-25 17:18:47,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639269200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:47,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:47,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:18:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443442023] [2022-11-25 17:18:47,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:47,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:18:47,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:47,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:18:47,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:18:48,005 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-25 17:18:48,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:18:48,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:18:48,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-25 17:18:48,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:18:52,923 INFO L130 PetriNetUnfolder]: 24574/33203 cut-off events. [2022-11-25 17:18:52,923 INFO L131 PetriNetUnfolder]: For 1637/1637 co-relation queries the response was YES. [2022-11-25 17:18:52,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68444 conditions, 33203 events. 24574/33203 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 181393 event pairs, 8116 based on Foata normal form. 1374/34577 useless extension candidates. Maximal degree in co-relation 68434. Up to 14653 conditions per place. [2022-11-25 17:18:53,093 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 44 selfloop transitions, 9 changer transitions 35/88 dead transitions. [2022-11-25 17:18:53,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 374 flow [2022-11-25 17:18:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:18:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:18:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2022-11-25 17:18:53,096 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2022-11-25 17:18:53,096 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2022-11-25 17:18:53,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2022-11-25 17:18:53,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:18:53,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2022-11-25 17:18:53,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 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:18:53,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:18:53,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:18:53,102 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 5 states and 630 transitions. [2022-11-25 17:18:53,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 374 flow [2022-11-25 17:18:53,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:18:53,105 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 156 flow [2022-11-25 17:18:53,105 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-11-25 17:18:53,106 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-11-25 17:18:53,106 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 156 flow [2022-11-25 17:18:53,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:18:53,106 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:18:53,107 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:53,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:18:53,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:18:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:53,108 INFO L85 PathProgramCache]: Analyzing trace with hash -64457059, now seen corresponding path program 1 times [2022-11-25 17:18:53,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:53,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509727781] [2022-11-25 17:18:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:53,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:53,301 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:18:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:53,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509727781] [2022-11-25 17:18:53,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509727781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:53,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:53,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:18:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812012488] [2022-11-25 17:18:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:53,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:18:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:53,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:18:53,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:18:53,334 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-25 17:18:53,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:18:53,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:18:53,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-25 17:18:53,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:18:56,897 INFO L130 PetriNetUnfolder]: 21535/29357 cut-off events. [2022-11-25 17:18:56,897 INFO L131 PetriNetUnfolder]: For 26399/26399 co-relation queries the response was YES. [2022-11-25 17:18:56,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82948 conditions, 29357 events. 21535/29357 cut-off events. For 26399/26399 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 158826 event pairs, 3875 based on Foata normal form. 1369/30726 useless extension candidates. Maximal degree in co-relation 82934. Up to 10527 conditions per place. [2022-11-25 17:18:57,077 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 59 selfloop transitions, 9 changer transitions 52/120 dead transitions. [2022-11-25 17:18:57,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 120 transitions, 712 flow [2022-11-25 17:18:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:18:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:18:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2022-11-25 17:18:57,081 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49627079747561675 [2022-11-25 17:18:57,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2022-11-25 17:18:57,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2022-11-25 17:18:57,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:18:57,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2022-11-25 17:18:57,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 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:18:57,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:18:57,090 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:18:57,091 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 156 flow. Second operand 7 states and 865 transitions. [2022-11-25 17:18:57,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 120 transitions, 712 flow [2022-11-25 17:18:57,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 120 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:18:57,173 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 222 flow [2022-11-25 17:18:57,174 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-11-25 17:18:57,176 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-11-25 17:18:57,176 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 222 flow [2022-11-25 17:18:57,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 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:18:57,177 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:18:57,177 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:57,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:18:57,178 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:18:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1006140711, now seen corresponding path program 1 times [2022-11-25 17:18:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:57,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838122225] [2022-11-25 17:18:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:57,430 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:18:57,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:57,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838122225] [2022-11-25 17:18:57,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838122225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:57,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:57,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:18:57,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844628036] [2022-11-25 17:18:57,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:57,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:18:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:18:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:18:57,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-25 17:18:57,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:18:57,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:18:57,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-25 17:18:57,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:00,608 INFO L130 PetriNetUnfolder]: 19711/26881 cut-off events. [2022-11-25 17:19:00,609 INFO L131 PetriNetUnfolder]: For 51373/51373 co-relation queries the response was YES. [2022-11-25 17:19:00,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83119 conditions, 26881 events. 19711/26881 cut-off events. For 51373/51373 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 145710 event pairs, 2055 based on Foata normal form. 893/27774 useless extension candidates. Maximal degree in co-relation 83099. Up to 11748 conditions per place. [2022-11-25 17:19:00,767 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 65 selfloop transitions, 20 changer transitions 45/130 dead transitions. [2022-11-25 17:19:00,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 130 transitions, 878 flow [2022-11-25 17:19:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:19:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:19:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2022-11-25 17:19:00,770 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4985656913367757 [2022-11-25 17:19:00,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2022-11-25 17:19:00,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2022-11-25 17:19:00,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:00,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2022-11-25 17:19:00,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:19:00,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:19:00,778 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:19:00,778 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 222 flow. Second operand 7 states and 869 transitions. [2022-11-25 17:19:00,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 130 transitions, 878 flow [2022-11-25 17:19:00,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 130 transitions, 861 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-25 17:19:00,958 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 424 flow [2022-11-25 17:19:00,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=424, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2022-11-25 17:19:00,960 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2022-11-25 17:19:00,961 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 424 flow [2022-11-25 17:19:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:19:00,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:00,962 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:00,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:19:00,962 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:19:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1831057140, now seen corresponding path program 1 times [2022-11-25 17:19:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:00,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730652860] [2022-11-25 17:19:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:01,138 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:19:01,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:01,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730652860] [2022-11-25 17:19:01,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730652860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:01,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:01,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:19:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188720451] [2022-11-25 17:19:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:01,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:19:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:19:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:19:01,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 249 [2022-11-25 17:19:01,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 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:19:01,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:01,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 249 [2022-11-25 17:19:01,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:04,440 INFO L130 PetriNetUnfolder]: 15558/22198 cut-off events. [2022-11-25 17:19:04,441 INFO L131 PetriNetUnfolder]: For 68660/69544 co-relation queries the response was YES. [2022-11-25 17:19:04,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75340 conditions, 22198 events. 15558/22198 cut-off events. For 68660/69544 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 132151 event pairs, 6688 based on Foata normal form. 1145/23118 useless extension candidates. Maximal degree in co-relation 75314. Up to 18071 conditions per place. [2022-11-25 17:19:04,631 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 62 selfloop transitions, 10 changer transitions 27/111 dead transitions. [2022-11-25 17:19:04,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 111 transitions, 950 flow [2022-11-25 17:19:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:19:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:19:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2022-11-25 17:19:04,639 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5236947791164659 [2022-11-25 17:19:04,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2022-11-25 17:19:04,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2022-11-25 17:19:04,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:04,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2022-11-25 17:19:04,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:19:04,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:19:04,645 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:19:04,646 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 424 flow. Second operand 5 states and 652 transitions. [2022-11-25 17:19:04,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 111 transitions, 950 flow [2022-11-25 17:19:04,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 111 transitions, 918 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-11-25 17:19:04,937 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 548 flow [2022-11-25 17:19:04,937 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2022-11-25 17:19:04,938 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-11-25 17:19:04,938 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 548 flow [2022-11-25 17:19:04,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 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:19:04,939 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:04,939 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:04,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:19:04,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:19:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:04,941 INFO L85 PathProgramCache]: Analyzing trace with hash -413370693, now seen corresponding path program 1 times [2022-11-25 17:19:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:04,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9708425] [2022-11-25 17:19:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:05,139 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:19:05,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9708425] [2022-11-25 17:19:05,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9708425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:05,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:05,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:19:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029095547] [2022-11-25 17:19:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:05,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:19:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:05,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:19:05,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:19:05,173 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-25 17:19:05,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 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:19:05,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:05,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-25 17:19:05,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:09,907 INFO L130 PetriNetUnfolder]: 26100/35784 cut-off events. [2022-11-25 17:19:09,907 INFO L131 PetriNetUnfolder]: For 114148/114148 co-relation queries the response was YES. [2022-11-25 17:19:10,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124293 conditions, 35784 events. 26100/35784 cut-off events. For 114148/114148 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 204905 event pairs, 4328 based on Foata normal form. 963/36747 useless extension candidates. Maximal degree in co-relation 124264. Up to 13446 conditions per place. [2022-11-25 17:19:10,094 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 71 selfloop transitions, 34 changer transitions 44/149 dead transitions. [2022-11-25 17:19:10,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 149 transitions, 1260 flow [2022-11-25 17:19:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:19:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:19:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2022-11-25 17:19:10,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5002868617326449 [2022-11-25 17:19:10,097 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2022-11-25 17:19:10,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2022-11-25 17:19:10,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:10,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2022-11-25 17:19:10,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:19:10,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:19:10,106 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:19:10,107 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 548 flow. Second operand 7 states and 872 transitions. [2022-11-25 17:19:10,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 149 transitions, 1260 flow [2022-11-25 17:19:10,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 149 transitions, 1230 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-25 17:19:10,349 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 747 flow [2022-11-25 17:19:10,349 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=747, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2022-11-25 17:19:10,352 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2022-11-25 17:19:10,352 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 747 flow [2022-11-25 17:19:10,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 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:19:10,353 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:10,353 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:10,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:19:10,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:19:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash -426776643, now seen corresponding path program 1 times [2022-11-25 17:19:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:10,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701508487] [2022-11-25 17:19:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:10,565 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:19:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:10,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701508487] [2022-11-25 17:19:10,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701508487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:10,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:10,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:19:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433418160] [2022-11-25 17:19:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:10,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:19:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:19:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:19:10,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-11-25 17:19:10,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:19:10,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:10,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-11-25 17:19:10,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:11,636 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([416] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][97], [Black: 187#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 184#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 88#L762true, 47#L782true, Black: 199#(= ~x~0 0), 209#(= ~y~0 1), Black: 202#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 181#true, 90#L838true, 165#true, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 210#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 213#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 207#true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 223#true, 92#L874true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 157#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 168#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, Black: 183#(= ~y~0 0)]) [2022-11-25 17:19:11,636 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:19:11,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:19:11,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:19:11,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:19:11,821 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([402] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][36], [Black: 181#true, Black: 187#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 20#L822true, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 209#(= ~y~0 1), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 39#L769true, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 168#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 210#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 213#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 207#true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 223#true, 92#L874true, Black: 154#true, Black: 157#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 125#L789true, Black: 165#true, Black: 167#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, 184#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 183#(= ~y~0 0)]) [2022-11-25 17:19:11,821 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,821 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,821 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,821 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,822 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([416] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][97], [Black: 187#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 184#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 47#L782true, Black: 199#(= ~x~0 0), 209#(= ~y~0 1), Black: 202#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 181#true, 90#L838true, 39#L769true, 165#true, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 210#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 213#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 207#true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 223#true, 92#L874true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 157#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 168#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, Black: 183#(= ~y~0 0)]) [2022-11-25 17:19:11,822 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,822 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,822 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,822 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,823 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([416] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][97], [Black: 187#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 184#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 88#L762true, 47#L782true, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 209#(= ~y~0 1), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 181#true, 90#L838true, 165#true, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 210#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 213#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 207#true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 223#true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 157#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 41#L880true, Black: 168#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, Black: 183#(= ~y~0 0)]) [2022-11-25 17:19:11,823 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,823 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,824 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:11,824 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:19:12,188 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([402] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][36], [Black: 181#true, Black: 187#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 20#L822true, Black: 199#(= ~x~0 0), 209#(= ~y~0 1), Black: 202#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 39#L769true, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 168#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 210#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 213#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 207#true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 223#true, Black: 154#true, Black: 157#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 41#L880true, 125#L789true, Black: 165#true, Black: 167#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, 184#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 183#(= ~y~0 0)]) [2022-11-25 17:19:12,189 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 17:19:12,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:19:12,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:19:12,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:19:12,190 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([416] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][97], [Black: 187#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 184#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 47#L782true, Black: 199#(= ~x~0 0), Black: 202#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 209#(= ~y~0 1), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 181#true, 90#L838true, 39#L769true, 165#true, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 210#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 213#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 207#true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 223#true, Black: 156#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 157#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 41#L880true, Black: 168#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, Black: 183#(= ~y~0 0)]) [2022-11-25 17:19:12,190 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 17:19:12,190 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:19:12,190 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:19:12,190 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:19:13,044 INFO L130 PetriNetUnfolder]: 10952/16328 cut-off events. [2022-11-25 17:19:13,044 INFO L131 PetriNetUnfolder]: For 70626/72657 co-relation queries the response was YES. [2022-11-25 17:19:13,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56512 conditions, 16328 events. 10952/16328 cut-off events. For 70626/72657 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 103758 event pairs, 2436 based on Foata normal form. 921/16954 useless extension candidates. Maximal degree in co-relation 56479. Up to 13805 conditions per place. [2022-11-25 17:19:13,341 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 76 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2022-11-25 17:19:13,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 106 transitions, 1233 flow [2022-11-25 17:19:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:19:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:19:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2022-11-25 17:19:13,343 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5261044176706827 [2022-11-25 17:19:13,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2022-11-25 17:19:13,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2022-11-25 17:19:13,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:13,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2022-11-25 17:19:13,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 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:19:13,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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:19:13,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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:19:13,347 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 747 flow. Second operand 3 states and 393 transitions. [2022-11-25 17:19:13,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 106 transitions, 1233 flow [2022-11-25 17:19:13,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 1221 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-25 17:19:13,404 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 770 flow [2022-11-25 17:19:13,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2022-11-25 17:19:13,405 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2022-11-25 17:19:13,406 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 770 flow [2022-11-25 17:19:13,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:19:13,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:13,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:13,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:19:13,407 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:19:13,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1436728761, now seen corresponding path program 1 times [2022-11-25 17:19:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:13,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975920904] [2022-11-25 17:19:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:13,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:13,615 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:19:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:13,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975920904] [2022-11-25 17:19:13,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975920904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:13,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:13,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:19:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292741553] [2022-11-25 17:19:13,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:13,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:19:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:13,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:19:13,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:19:13,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-25 17:19:13,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 770 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:19:13,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:13,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-25 17:19:13,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:18,184 INFO L130 PetriNetUnfolder]: 21432/31053 cut-off events. [2022-11-25 17:19:18,184 INFO L131 PetriNetUnfolder]: For 140915/140915 co-relation queries the response was YES. [2022-11-25 17:19:18,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123415 conditions, 31053 events. 21432/31053 cut-off events. For 140915/140915 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 196635 event pairs, 5841 based on Foata normal form. 612/31665 useless extension candidates. Maximal degree in co-relation 123381. Up to 12583 conditions per place. [2022-11-25 17:19:18,349 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 90 selfloop transitions, 33 changer transitions 57/180 dead transitions. [2022-11-25 17:19:18,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 180 transitions, 1895 flow [2022-11-25 17:19:18,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:19:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:19:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2022-11-25 17:19:18,353 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49971313826735514 [2022-11-25 17:19:18,353 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2022-11-25 17:19:18,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2022-11-25 17:19:18,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:18,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2022-11-25 17:19:18,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:19:18,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:19:18,357 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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:19:18,357 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 770 flow. Second operand 7 states and 871 transitions. [2022-11-25 17:19:18,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 180 transitions, 1895 flow [2022-11-25 17:19:18,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 180 transitions, 1874 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-25 17:19:18,606 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 984 flow [2022-11-25 17:19:18,606 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=984, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2022-11-25 17:19:18,607 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2022-11-25 17:19:18,607 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 984 flow [2022-11-25 17:19:18,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:19:18,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:18,608 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:18,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:19:18,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:19:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1785608957, now seen corresponding path program 1 times [2022-11-25 17:19:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:18,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699941038] [2022-11-25 17:19:18,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:18,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:18,800 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:19:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:18,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699941038] [2022-11-25 17:19:18,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699941038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:18,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:18,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:19:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411675541] [2022-11-25 17:19:18,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:18,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:19:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:19:18,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:19:18,813 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-11-25 17:19:18,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 984 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:19:18,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:18,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-11-25 17:19:18,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:20,815 INFO L130 PetriNetUnfolder]: 7186/11469 cut-off events. [2022-11-25 17:19:20,815 INFO L131 PetriNetUnfolder]: For 56704/57640 co-relation queries the response was YES. [2022-11-25 17:19:20,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43345 conditions, 11469 events. 7186/11469 cut-off events. For 56704/57640 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 77285 event pairs, 1362 based on Foata normal form. 1144/12408 useless extension candidates. Maximal degree in co-relation 43304. Up to 5805 conditions per place. [2022-11-25 17:19:20,888 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 112 selfloop transitions, 9 changer transitions 1/146 dead transitions. [2022-11-25 17:19:20,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 146 transitions, 1998 flow [2022-11-25 17:19:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:19:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:19:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2022-11-25 17:19:20,892 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5281124497991968 [2022-11-25 17:19:20,893 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2022-11-25 17:19:20,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2022-11-25 17:19:20,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:20,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2022-11-25 17:19:20,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 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:19:20,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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:19:20,897 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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:19:20,897 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 984 flow. Second operand 4 states and 526 transitions. [2022-11-25 17:19:20,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 146 transitions, 1998 flow [2022-11-25 17:19:20,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 1970 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-11-25 17:19:20,966 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 1022 flow [2022-11-25 17:19:20,966 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1022, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2022-11-25 17:19:20,967 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2022-11-25 17:19:20,967 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 1022 flow [2022-11-25 17:19:20,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:19:20,967 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:20,968 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:19:20,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:19:20,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:19:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1327598342, now seen corresponding path program 1 times [2022-11-25 17:19:20,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:20,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857427096] [2022-11-25 17:19:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:21,192 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:19:21,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:21,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857427096] [2022-11-25 17:19:21,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857427096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:21,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:21,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:19:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654395808] [2022-11-25 17:19:21,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:21,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:19:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:19:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:19:21,221 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2022-11-25 17:19:21,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 1022 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 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:19:21,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:21,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2022-11-25 17:19:21,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:24,831 INFO L130 PetriNetUnfolder]: 13091/20222 cut-off events. [2022-11-25 17:19:24,831 INFO L131 PetriNetUnfolder]: For 123163/123163 co-relation queries the response was YES. [2022-11-25 17:19:24,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89120 conditions, 20222 events. 13091/20222 cut-off events. For 123163/123163 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 134778 event pairs, 2493 based on Foata normal form. 150/20372 useless extension candidates. Maximal degree in co-relation 89077. Up to 9959 conditions per place. [2022-11-25 17:19:24,985 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 88 selfloop transitions, 36 changer transitions 42/166 dead transitions. [2022-11-25 17:19:24,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 166 transitions, 2101 flow [2022-11-25 17:19:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:19:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:19:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-11-25 17:19:24,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5036144578313253 [2022-11-25 17:19:24,987 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2022-11-25 17:19:24,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2022-11-25 17:19:24,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:24,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2022-11-25 17:19:24,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 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:19:24,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:19:24,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:19:24,993 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 1022 flow. Second operand 5 states and 627 transitions. [2022-11-25 17:19:24,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 166 transitions, 2101 flow [2022-11-25 17:19:25,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 166 transitions, 2039 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-11-25 17:19:25,320 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 1014 flow [2022-11-25 17:19:25,322 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1014, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2022-11-25 17:19:25,323 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2022-11-25 17:19:25,323 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 1014 flow [2022-11-25 17:19:25,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 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:19:25,324 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:25,324 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:25,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:19:25,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:19:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash 218426872, now seen corresponding path program 2 times [2022-11-25 17:19:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:25,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752759511] [2022-11-25 17:19:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:25,561 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:19:25,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:25,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752759511] [2022-11-25 17:19:25,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752759511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:25,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:25,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:19:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507692836] [2022-11-25 17:19:25,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:25,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:19:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:25,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:19:25,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:19:25,572 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-11-25 17:19:25,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 1014 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 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:19:25,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:25,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-11-25 17:19:25,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:27,223 INFO L130 PetriNetUnfolder]: 5319/8783 cut-off events. [2022-11-25 17:19:27,223 INFO L131 PetriNetUnfolder]: For 40242/40656 co-relation queries the response was YES. [2022-11-25 17:19:27,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34039 conditions, 8783 events. 5319/8783 cut-off events. For 40242/40656 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 60861 event pairs, 1062 based on Foata normal form. 647/9253 useless extension candidates. Maximal degree in co-relation 33995. Up to 3320 conditions per place. [2022-11-25 17:19:27,276 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 114 selfloop transitions, 13 changer transitions 18/164 dead transitions. [2022-11-25 17:19:27,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 164 transitions, 2331 flow [2022-11-25 17:19:27,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:19:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:19:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2022-11-25 17:19:27,280 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5277108433734939 [2022-11-25 17:19:27,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2022-11-25 17:19:27,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2022-11-25 17:19:27,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:27,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2022-11-25 17:19:27,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 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:19:27,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:19:27,286 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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:19:27,286 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 1014 flow. Second operand 5 states and 657 transitions. [2022-11-25 17:19:27,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 164 transitions, 2331 flow [2022-11-25 17:19:27,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 164 transitions, 2251 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:19:27,333 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 959 flow [2022-11-25 17:19:27,333 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=959, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2022-11-25 17:19:27,333 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2022-11-25 17:19:27,333 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 959 flow [2022-11-25 17:19:27,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 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:19:27,334 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:27,334 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:27,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:19:27,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:19:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1082479673, now seen corresponding path program 1 times [2022-11-25 17:19:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:27,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646351551] [2022-11-25 17:19:27,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:27,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:27,720 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:19:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:27,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646351551] [2022-11-25 17:19:27,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646351551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:27,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:27,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:19:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045569486] [2022-11-25 17:19:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:27,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:19:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:19:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:19:27,734 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 249 [2022-11-25 17:19:27,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 959 flow. Second operand has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 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:19:27,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:27,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 249 [2022-11-25 17:19:27,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand