./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/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_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/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_97a26bed-0c70-4529-9784-aba911f8cd28/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 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- 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 16:58:32,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:58:32,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:58:33,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:58:33,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:58:33,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:58:33,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:58:33,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:58:33,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:58:33,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:58:33,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:58:33,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:58:33,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:58:33,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:58:33,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:58:33,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:58:33,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:58:33,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:58:33,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:58:33,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:58:33,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:58:33,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:58:33,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:58:33,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:58:33,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:58:33,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:58:33,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:58:33,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:58:33,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:58:33,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:58:33,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:58:33,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:58:33,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:58:33,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:58:33,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:58:33,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:58:33,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:58:33,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:58:33,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:58:33,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:58:33,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:58:33,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:58:33,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:58:33,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:58:33,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:58:33,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:58:33,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:58:33,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:58:33,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:58:33,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:58:33,095 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:58:33,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:58:33,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:58:33,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:58:33,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:58:33,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:58:33,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:58:33,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:58:33,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:58:33,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:58:33,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:58:33,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:58:33,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:58:33,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:58:33,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:58:33,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:58:33,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:33,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:58:33,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:58:33,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:58:33,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:58:33,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:58:33,106 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:58:33,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:58:33,107 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:58:33,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:58:33,108 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_97a26bed-0c70-4529-9784-aba911f8cd28/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_97a26bed-0c70-4529-9784-aba911f8cd28/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 -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2022-11-25 16:58:33,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:58:33,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:58:33,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:58:33,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:58:33,429 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:58:33,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-11-25 16:58:36,453 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:58:36,748 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:58:36,749 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-11-25 16:58:36,777 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/data/c26f14848/4100ac1b71f34c88973068244947bcb0/FLAG7cb31a870 [2022-11-25 16:58:36,792 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/data/c26f14848/4100ac1b71f34c88973068244947bcb0 [2022-11-25 16:58:36,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:58:36,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:58:36,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:36,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:58:36,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:58:36,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:36" (1/1) ... [2022-11-25 16:58:36,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4800d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:36, skipping insertion in model container [2022-11-25 16:58:36,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:36" (1/1) ... [2022-11-25 16:58:36,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:58:36,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:58:37,057 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_97a26bed-0c70-4529-9784-aba911f8cd28/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-11-25 16:58:37,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:37,397 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:58:37,410 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_97a26bed-0c70-4529-9784-aba911f8cd28/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-11-25 16:58:37,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:58:37,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:58:37,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:37,573 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:58:37,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37 WrapperNode [2022-11-25 16:58:37,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:37,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:37,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:58:37,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:58:37,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,707 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-11-25 16:58:37,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:37,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:58:37,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:58:37,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:58:37,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,766 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:58:37,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:58:37,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:58:37,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:58:37,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:37,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:37,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:37,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:58:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:58:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:58:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:58:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:58:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:58:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:58:37,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:58:37,872 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:58:37,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:58:37,872 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:58:37,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:58:37,872 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 16:58:37,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 16:58:37,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:58:37,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:58:37,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:58:37,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:58:37,875 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 16:58:38,061 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:58:38,064 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:58:38,467 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:58:38,639 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:58:38,639 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:58:38,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:38 BoogieIcfgContainer [2022-11-25 16:58:38,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:58:38,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:58:38,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:58:38,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:58:38,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:58:36" (1/3) ... [2022-11-25 16:58:38,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23647b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:38, skipping insertion in model container [2022-11-25 16:58:38,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (2/3) ... [2022-11-25 16:58:38,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23647b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:38, skipping insertion in model container [2022-11-25 16:58:38,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:38" (3/3) ... [2022-11-25 16:58:38,651 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-11-25 16:58:38,661 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:58:38,672 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:58:38,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:58:38,672 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:58:38,773 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:58:38,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-11-25 16:58:38,952 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-11-25 16:58:38,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:58:38,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-25 16:58:38,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2022-11-25 16:58:38,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2022-11-25 16:58:38,980 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:58:39,022 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 282 flow [2022-11-25 16:58:39,025 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 282 flow [2022-11-25 16:58:39,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 282 flow [2022-11-25 16:58:39,065 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-11-25 16:58:39,066 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:58:39,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-25 16:58:39,070 INFO L119 LiptonReduction]: Number of co-enabled transitions 3504 [2022-11-25 16:58:46,460 INFO L134 LiptonReduction]: Checked pairs total: 9554 [2022-11-25 16:58:46,461 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-25 16:58:46,478 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:58:46,484 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;@2a8bf3de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:58:46,485 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 16:58:46,488 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-11-25 16:58:46,488 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:58:46,489 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:46,489 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 16:58:46,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:58:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash 553626847, now seen corresponding path program 1 times [2022-11-25 16:58:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:46,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702904755] [2022-11-25 16:58:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:46,961 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 16:58:46,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:46,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702904755] [2022-11-25 16:58:46,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702904755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:46,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:46,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:58:46,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613689561] [2022-11-25 16:58:46,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:46,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:58:46,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:46,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:58:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:58:47,007 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 259 [2022-11-25 16:58:47,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 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 16:58:47,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:47,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 259 [2022-11-25 16:58:47,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:48,268 INFO L130 PetriNetUnfolder]: 3927/5537 cut-off events. [2022-11-25 16:58:48,268 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 16:58:48,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11089 conditions, 5537 events. 3927/5537 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 27817 event pairs, 1469 based on Foata normal form. 0/5220 useless extension candidates. Maximal degree in co-relation 11077. Up to 4291 conditions per place. [2022-11-25 16:58:48,311 INFO L137 encePairwiseOnDemand]: 255/259 looper letters, 37 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2022-11-25 16:58:48,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 192 flow [2022-11-25 16:58:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:58:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:58:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2022-11-25 16:58:48,334 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2022-11-25 16:58:48,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2022-11-25 16:58:48,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2022-11-25 16:58:48,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:48,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2022-11-25 16:58:48,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 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 16:58:48,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 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 16:58:48,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 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 16:58:48,361 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 413 transitions. [2022-11-25 16:58:48,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 192 flow [2022-11-25 16:58:48,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 16:58:48,372 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2022-11-25 16:58:48,374 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-11-25 16:58:48,378 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-11-25 16:58:48,378 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2022-11-25 16:58:48,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 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 16:58:48,379 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:48,379 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:48,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:58:48,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:58:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 67884114, now seen corresponding path program 1 times [2022-11-25 16:58:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:48,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235055456] [2022-11-25 16:58:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:49,036 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 16:58:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:49,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235055456] [2022-11-25 16:58:49,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235055456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:49,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:49,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:58:49,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174644117] [2022-11-25 16:58:49,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:49,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:49,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:49,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:49,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:49,163 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2022-11-25 16:58:49,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 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 16:58:49,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:49,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2022-11-25 16:58:49,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:50,876 INFO L130 PetriNetUnfolder]: 7805/10575 cut-off events. [2022-11-25 16:58:50,876 INFO L131 PetriNetUnfolder]: For 549/549 co-relation queries the response was YES. [2022-11-25 16:58:50,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21955 conditions, 10575 events. 7805/10575 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 49728 event pairs, 2349 based on Foata normal form. 280/10854 useless extension candidates. Maximal degree in co-relation 21945. Up to 6973 conditions per place. [2022-11-25 16:58:50,944 INFO L137 encePairwiseOnDemand]: 247/259 looper letters, 42 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2022-11-25 16:58:50,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 230 flow [2022-11-25 16:58:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:58:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2022-11-25 16:58:50,947 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48166023166023164 [2022-11-25 16:58:50,947 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2022-11-25 16:58:50,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2022-11-25 16:58:50,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:50,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2022-11-25 16:58:50,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 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 16:58:50,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 16:58:50,952 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 16:58:50,952 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 4 states and 499 transitions. [2022-11-25 16:58:50,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 230 flow [2022-11-25 16:58:50,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:58:50,955 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 148 flow [2022-11-25 16:58:50,955 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-11-25 16:58:50,957 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2022-11-25 16:58:50,957 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 148 flow [2022-11-25 16:58:50,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 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 16:58:50,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:50,958 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:50,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:58:50,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:58:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash 811062376, now seen corresponding path program 1 times [2022-11-25 16:58:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:50,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265168977] [2022-11-25 16:58:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:51,997 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 16:58:51,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:51,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265168977] [2022-11-25 16:58:51,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265168977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:51,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:51,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:58:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892653415] [2022-11-25 16:58:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:52,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:58:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:58:52,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:58:52,032 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 259 [2022-11-25 16:58:52,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 16:58:52,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:52,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 259 [2022-11-25 16:58:52,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:53,895 INFO L130 PetriNetUnfolder]: 7502/10465 cut-off events. [2022-11-25 16:58:53,896 INFO L131 PetriNetUnfolder]: For 3417/3544 co-relation queries the response was YES. [2022-11-25 16:58:53,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27771 conditions, 10465 events. 7502/10465 cut-off events. For 3417/3544 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 55501 event pairs, 2657 based on Foata normal form. 76/10161 useless extension candidates. Maximal degree in co-relation 27758. Up to 8680 conditions per place. [2022-11-25 16:58:53,974 INFO L137 encePairwiseOnDemand]: 255/259 looper letters, 47 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2022-11-25 16:58:53,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 322 flow [2022-11-25 16:58:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:58:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:58:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2022-11-25 16:58:53,976 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.528957528957529 [2022-11-25 16:58:53,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2022-11-25 16:58:53,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2022-11-25 16:58:53,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:53,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2022-11-25 16:58:53,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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 16:58:53,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 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 16:58:53,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 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 16:58:53,982 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 148 flow. Second operand 3 states and 411 transitions. [2022-11-25 16:58:53,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 322 flow [2022-11-25 16:58:53,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:58:53,989 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 178 flow [2022-11-25 16:58:53,989 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-11-25 16:58:53,990 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2022-11-25 16:58:53,990 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 178 flow [2022-11-25 16:58:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 16:58:53,991 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:53,991 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:53,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:58:53,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:58:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -626814587, now seen corresponding path program 1 times [2022-11-25 16:58:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:53,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137791918] [2022-11-25 16:58:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,598 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 16:58:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:54,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137791918] [2022-11-25 16:58:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137791918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243305028] [2022-11-25 16:58:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:54,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:54,635 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 259 [2022-11-25 16:58:54,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 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 16:58:54,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:54,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 259 [2022-11-25 16:58:54,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:58:56,734 INFO L130 PetriNetUnfolder]: 7755/10912 cut-off events. [2022-11-25 16:58:56,735 INFO L131 PetriNetUnfolder]: For 5917/6126 co-relation queries the response was YES. [2022-11-25 16:58:56,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30682 conditions, 10912 events. 7755/10912 cut-off events. For 5917/6126 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 60058 event pairs, 1832 based on Foata normal form. 185/10740 useless extension candidates. Maximal degree in co-relation 30667. Up to 8403 conditions per place. [2022-11-25 16:58:56,812 INFO L137 encePairwiseOnDemand]: 252/259 looper letters, 59 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2022-11-25 16:58:56,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 446 flow [2022-11-25 16:58:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:58:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:58:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-11-25 16:58:56,814 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5222007722007722 [2022-11-25 16:58:56,815 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2022-11-25 16:58:56,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2022-11-25 16:58:56,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:58:56,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2022-11-25 16:58:56,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 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 16:58:56,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 16:58:56,821 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 16:58:56,821 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 178 flow. Second operand 4 states and 541 transitions. [2022-11-25 16:58:56,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 446 flow [2022-11-25 16:58:56,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:58:56,832 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 255 flow [2022-11-25 16:58:56,832 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2022-11-25 16:58:56,834 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2022-11-25 16:58:56,834 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 255 flow [2022-11-25 16:58:56,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 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 16:58:56,835 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:56,835 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:56,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:58:56,836 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:58:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash 464194755, now seen corresponding path program 1 times [2022-11-25 16:58:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:56,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277799111] [2022-11-25 16:58:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,384 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 16:58:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:57,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277799111] [2022-11-25 16:58:57,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277799111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:57,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:57,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:58:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349058923] [2022-11-25 16:58:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:57,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:57,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:57,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 259 [2022-11-25 16:58:57,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:58:57,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:58:57,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 259 [2022-11-25 16:58:57,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:00,082 INFO L130 PetriNetUnfolder]: 12010/16196 cut-off events. [2022-11-25 16:59:00,082 INFO L131 PetriNetUnfolder]: For 13725/13725 co-relation queries the response was YES. [2022-11-25 16:59:00,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51506 conditions, 16196 events. 12010/16196 cut-off events. For 13725/13725 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 78704 event pairs, 2383 based on Foata normal form. 80/16276 useless extension candidates. Maximal degree in co-relation 51489. Up to 11938 conditions per place. [2022-11-25 16:59:00,178 INFO L137 encePairwiseOnDemand]: 245/259 looper letters, 87 selfloop transitions, 46 changer transitions 0/133 dead transitions. [2022-11-25 16:59:00,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 133 transitions, 891 flow [2022-11-25 16:59:00,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2022-11-25 16:59:00,182 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48584298584298585 [2022-11-25 16:59:00,183 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 755 transitions. [2022-11-25 16:59:00,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 755 transitions. [2022-11-25 16:59:00,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:00,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 755 transitions. [2022-11-25 16:59:00,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 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 16:59:00,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 16:59:00,191 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 16:59:00,191 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 255 flow. Second operand 6 states and 755 transitions. [2022-11-25 16:59:00,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 133 transitions, 891 flow [2022-11-25 16:59:00,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 133 transitions, 868 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 16:59:00,203 INFO L231 Difference]: Finished difference. Result has 56 places, 82 transitions, 672 flow [2022-11-25 16:59:00,204 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=56, PETRI_TRANSITIONS=82} [2022-11-25 16:59:00,205 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2022-11-25 16:59:00,205 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 82 transitions, 672 flow [2022-11-25 16:59:00,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:00,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:00,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:00,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:59:00,206 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:00,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:00,207 INFO L85 PathProgramCache]: Analyzing trace with hash 371016195, now seen corresponding path program 2 times [2022-11-25 16:59:00,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:00,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553563665] [2022-11-25 16:59:00,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:00,747 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 16:59:00,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:00,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553563665] [2022-11-25 16:59:00,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553563665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:00,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:00,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705794178] [2022-11-25 16:59:00,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:00,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:00,782 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 259 [2022-11-25 16:59:00,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 82 transitions, 672 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 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 16:59:00,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:00,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 259 [2022-11-25 16:59:00,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:02,677 INFO L130 PetriNetUnfolder]: 9387/13432 cut-off events. [2022-11-25 16:59:02,677 INFO L131 PetriNetUnfolder]: For 38656/38917 co-relation queries the response was YES. [2022-11-25 16:59:02,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56827 conditions, 13432 events. 9387/13432 cut-off events. For 38656/38917 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 74484 event pairs, 2458 based on Foata normal form. 215/13450 useless extension candidates. Maximal degree in co-relation 56805. Up to 8808 conditions per place. [2022-11-25 16:59:02,783 INFO L137 encePairwiseOnDemand]: 252/259 looper letters, 75 selfloop transitions, 26 changer transitions 0/118 dead transitions. [2022-11-25 16:59:02,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 118 transitions, 1070 flow [2022-11-25 16:59:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2022-11-25 16:59:02,786 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2022-11-25 16:59:02,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2022-11-25 16:59:02,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2022-11-25 16:59:02,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:02,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2022-11-25 16:59:02,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:02,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 16:59:02,792 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 16:59:02,792 INFO L175 Difference]: Start difference. First operand has 56 places, 82 transitions, 672 flow. Second operand 4 states and 546 transitions. [2022-11-25 16:59:02,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 118 transitions, 1070 flow [2022-11-25 16:59:02,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 1058 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-11-25 16:59:02,847 INFO L231 Difference]: Finished difference. Result has 60 places, 91 transitions, 831 flow [2022-11-25 16:59:02,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=831, PETRI_PLACES=60, PETRI_TRANSITIONS=91} [2022-11-25 16:59:02,848 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2022-11-25 16:59:02,848 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 91 transitions, 831 flow [2022-11-25 16:59:02,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 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 16:59:02,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:02,849 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:02,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:59:02,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:02,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1093511351, now seen corresponding path program 1 times [2022-11-25 16:59:02,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:02,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169446893] [2022-11-25 16:59:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:03,539 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 16:59:03,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:03,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169446893] [2022-11-25 16:59:03,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169446893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:03,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:03,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:03,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512779060] [2022-11-25 16:59:03,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:03,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:03,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:03,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:03,593 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 259 [2022-11-25 16:59:03,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 91 transitions, 831 flow. Second operand has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 16:59:03,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:03,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 259 [2022-11-25 16:59:03,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:06,048 INFO L130 PetriNetUnfolder]: 9975/14159 cut-off events. [2022-11-25 16:59:06,048 INFO L131 PetriNetUnfolder]: For 51681/52054 co-relation queries the response was YES. [2022-11-25 16:59:06,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63021 conditions, 14159 events. 9975/14159 cut-off events. For 51681/52054 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 77439 event pairs, 2518 based on Foata normal form. 281/14201 useless extension candidates. Maximal degree in co-relation 62996. Up to 9336 conditions per place. [2022-11-25 16:59:06,196 INFO L137 encePairwiseOnDemand]: 252/259 looper letters, 85 selfloop transitions, 38 changer transitions 0/140 dead transitions. [2022-11-25 16:59:06,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 140 transitions, 1373 flow [2022-11-25 16:59:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2022-11-25 16:59:06,200 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5227799227799228 [2022-11-25 16:59:06,200 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2022-11-25 16:59:06,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2022-11-25 16:59:06,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:06,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2022-11-25 16:59:06,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 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 16:59:06,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:06,207 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:06,208 INFO L175 Difference]: Start difference. First operand has 60 places, 91 transitions, 831 flow. Second operand 5 states and 677 transitions. [2022-11-25 16:59:06,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 140 transitions, 1373 flow [2022-11-25 16:59:06,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 140 transitions, 1341 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:06,317 INFO L231 Difference]: Finished difference. Result has 64 places, 102 transitions, 1038 flow [2022-11-25 16:59:06,317 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1038, PETRI_PLACES=64, PETRI_TRANSITIONS=102} [2022-11-25 16:59:06,318 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-11-25 16:59:06,319 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 102 transitions, 1038 flow [2022-11-25 16:59:06,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 16:59:06,320 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:06,321 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:06,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:59:06,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1883130406, now seen corresponding path program 1 times [2022-11-25 16:59:06,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:06,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111469505] [2022-11-25 16:59:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:06,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:06,811 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 16:59:06,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:06,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111469505] [2022-11-25 16:59:06,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111469505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:06,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:06,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692991596] [2022-11-25 16:59:06,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:06,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:06,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:06,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 259 [2022-11-25 16:59:06,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 102 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:06,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:06,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 259 [2022-11-25 16:59:06,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:09,442 INFO L130 PetriNetUnfolder]: 10728/15119 cut-off events. [2022-11-25 16:59:09,442 INFO L131 PetriNetUnfolder]: For 70767/71469 co-relation queries the response was YES. [2022-11-25 16:59:09,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70673 conditions, 15119 events. 10728/15119 cut-off events. For 70767/71469 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 83336 event pairs, 3138 based on Foata normal form. 368/15114 useless extension candidates. Maximal degree in co-relation 70646. Up to 9867 conditions per place. [2022-11-25 16:59:09,571 INFO L137 encePairwiseOnDemand]: 250/259 looper letters, 91 selfloop transitions, 44 changer transitions 0/152 dead transitions. [2022-11-25 16:59:09,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 152 transitions, 1602 flow [2022-11-25 16:59:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2022-11-25 16:59:09,574 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5150579150579151 [2022-11-25 16:59:09,575 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2022-11-25 16:59:09,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2022-11-25 16:59:09,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:09,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2022-11-25 16:59:09,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 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 16:59:09,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:09,581 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:09,582 INFO L175 Difference]: Start difference. First operand has 64 places, 102 transitions, 1038 flow. Second operand 5 states and 667 transitions. [2022-11-25 16:59:09,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 152 transitions, 1602 flow [2022-11-25 16:59:09,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 152 transitions, 1518 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:09,693 INFO L231 Difference]: Finished difference. Result has 66 places, 116 transitions, 1232 flow [2022-11-25 16:59:09,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1232, PETRI_PLACES=66, PETRI_TRANSITIONS=116} [2022-11-25 16:59:09,694 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2022-11-25 16:59:09,694 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 116 transitions, 1232 flow [2022-11-25 16:59:09,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:09,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:09,695 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:09,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:59:09,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1431202110, now seen corresponding path program 2 times [2022-11-25 16:59:09,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:09,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948013668] [2022-11-25 16:59:09,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:10,154 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 16:59:10,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948013668] [2022-11-25 16:59:10,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948013668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:10,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:10,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536555720] [2022-11-25 16:59:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:10,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:10,191 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 259 [2022-11-25 16:59:10,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 116 transitions, 1232 flow. Second operand has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 16:59:10,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:10,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 259 [2022-11-25 16:59:10,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:12,105 INFO L130 PetriNetUnfolder]: 10907/15357 cut-off events. [2022-11-25 16:59:12,106 INFO L131 PetriNetUnfolder]: For 88959/89720 co-relation queries the response was YES. [2022-11-25 16:59:12,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76984 conditions, 15357 events. 10907/15357 cut-off events. For 88959/89720 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 85076 event pairs, 3136 based on Foata normal form. 424/15399 useless extension candidates. Maximal degree in co-relation 76956. Up to 9943 conditions per place. [2022-11-25 16:59:12,225 INFO L137 encePairwiseOnDemand]: 250/259 looper letters, 94 selfloop transitions, 52 changer transitions 0/163 dead transitions. [2022-11-25 16:59:12,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 163 transitions, 1824 flow [2022-11-25 16:59:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2022-11-25 16:59:12,233 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5227799227799228 [2022-11-25 16:59:12,233 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2022-11-25 16:59:12,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2022-11-25 16:59:12,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:12,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2022-11-25 16:59:12,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 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 16:59:12,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:12,241 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:12,241 INFO L175 Difference]: Start difference. First operand has 66 places, 116 transitions, 1232 flow. Second operand 5 states and 677 transitions. [2022-11-25 16:59:12,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 163 transitions, 1824 flow [2022-11-25 16:59:12,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 163 transitions, 1718 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:12,456 INFO L231 Difference]: Finished difference. Result has 68 places, 127 transitions, 1418 flow [2022-11-25 16:59:12,457 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1418, PETRI_PLACES=68, PETRI_TRANSITIONS=127} [2022-11-25 16:59:12,457 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2022-11-25 16:59:12,457 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 127 transitions, 1418 flow [2022-11-25 16:59:12,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 16:59:12,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:12,458 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:12,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:59:12,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1418861940, now seen corresponding path program 3 times [2022-11-25 16:59:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:12,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561198417] [2022-11-25 16:59:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:12,884 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 16:59:12,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:12,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561198417] [2022-11-25 16:59:12,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561198417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:12,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:12,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125048079] [2022-11-25 16:59:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:12,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:12,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:12,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:12,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 259 [2022-11-25 16:59:12,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 127 transitions, 1418 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 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 16:59:12,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:12,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 259 [2022-11-25 16:59:12,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:15,207 INFO L130 PetriNetUnfolder]: 11120/15652 cut-off events. [2022-11-25 16:59:15,207 INFO L131 PetriNetUnfolder]: For 107814/108636 co-relation queries the response was YES. [2022-11-25 16:59:15,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81979 conditions, 15652 events. 11120/15652 cut-off events. For 107814/108636 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 86689 event pairs, 3152 based on Foata normal form. 420/15685 useless extension candidates. Maximal degree in co-relation 81950. Up to 10194 conditions per place. [2022-11-25 16:59:15,326 INFO L137 encePairwiseOnDemand]: 250/259 looper letters, 99 selfloop transitions, 59 changer transitions 0/175 dead transitions. [2022-11-25 16:59:15,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 175 transitions, 2070 flow [2022-11-25 16:59:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-25 16:59:15,330 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2022-11-25 16:59:15,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-25 16:59:15,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-25 16:59:15,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:15,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-25 16:59:15,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 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 16:59:15,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:15,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:15,339 INFO L175 Difference]: Start difference. First operand has 68 places, 127 transitions, 1418 flow. Second operand 5 states and 672 transitions. [2022-11-25 16:59:15,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 175 transitions, 2070 flow [2022-11-25 16:59:15,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 175 transitions, 1958 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:15,572 INFO L231 Difference]: Finished difference. Result has 70 places, 138 transitions, 1640 flow [2022-11-25 16:59:15,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1640, PETRI_PLACES=70, PETRI_TRANSITIONS=138} [2022-11-25 16:59:15,573 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2022-11-25 16:59:15,573 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 138 transitions, 1640 flow [2022-11-25 16:59:15,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 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 16:59:15,574 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:15,574 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:15,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:59:15,574 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:15,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:15,575 INFO L85 PathProgramCache]: Analyzing trace with hash -215198371, now seen corresponding path program 1 times [2022-11-25 16:59:15,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:15,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898792175] [2022-11-25 16:59:15,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:15,932 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 16:59:15,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:15,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898792175] [2022-11-25 16:59:15,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898792175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:15,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:15,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:15,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103560619] [2022-11-25 16:59:15,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:15,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:15,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:15,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:15,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 259 [2022-11-25 16:59:15,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 138 transitions, 1640 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:15,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:15,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 259 [2022-11-25 16:59:15,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:18,187 INFO L130 PetriNetUnfolder]: 12101/16954 cut-off events. [2022-11-25 16:59:18,187 INFO L131 PetriNetUnfolder]: For 149097/150601 co-relation queries the response was YES. [2022-11-25 16:59:18,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94160 conditions, 16954 events. 12101/16954 cut-off events. For 149097/150601 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 94898 event pairs, 3154 based on Foata normal form. 904/17484 useless extension candidates. Maximal degree in co-relation 94130. Up to 10647 conditions per place. [2022-11-25 16:59:18,321 INFO L137 encePairwiseOnDemand]: 250/259 looper letters, 112 selfloop transitions, 60 changer transitions 0/189 dead transitions. [2022-11-25 16:59:18,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 189 transitions, 2378 flow [2022-11-25 16:59:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2022-11-25 16:59:18,326 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5064350064350064 [2022-11-25 16:59:18,326 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2022-11-25 16:59:18,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2022-11-25 16:59:18,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:18,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2022-11-25 16:59:18,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 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 16:59:18,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 16:59:18,334 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 16:59:18,334 INFO L175 Difference]: Start difference. First operand has 70 places, 138 transitions, 1640 flow. Second operand 6 states and 787 transitions. [2022-11-25 16:59:18,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 189 transitions, 2378 flow [2022-11-25 16:59:18,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 189 transitions, 2258 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:18,955 INFO L231 Difference]: Finished difference. Result has 73 places, 152 transitions, 1918 flow [2022-11-25 16:59:18,956 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1918, PETRI_PLACES=73, PETRI_TRANSITIONS=152} [2022-11-25 16:59:18,956 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2022-11-25 16:59:18,957 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 152 transitions, 1918 flow [2022-11-25 16:59:18,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:18,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:18,958 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:18,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:59:18,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash 896070810, now seen corresponding path program 4 times [2022-11-25 16:59:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:18,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210294544] [2022-11-25 16:59:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:18,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:19,455 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 16:59:19,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:19,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210294544] [2022-11-25 16:59:19,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210294544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:19,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:19,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271406492] [2022-11-25 16:59:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:19,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:19,486 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 259 [2022-11-25 16:59:19,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 152 transitions, 1918 flow. Second operand has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 16:59:19,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:19,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 259 [2022-11-25 16:59:19,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:22,119 INFO L130 PetriNetUnfolder]: 13273/18709 cut-off events. [2022-11-25 16:59:22,119 INFO L131 PetriNetUnfolder]: For 210731/213166 co-relation queries the response was YES. [2022-11-25 16:59:22,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112251 conditions, 18709 events. 13273/18709 cut-off events. For 210731/213166 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 108505 event pairs, 2445 based on Foata normal form. 1896/20121 useless extension candidates. Maximal degree in co-relation 112220. Up to 10948 conditions per place. [2022-11-25 16:59:22,271 INFO L137 encePairwiseOnDemand]: 251/259 looper letters, 117 selfloop transitions, 79 changer transitions 0/213 dead transitions. [2022-11-25 16:59:22,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 213 transitions, 2842 flow [2022-11-25 16:59:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2022-11-25 16:59:22,275 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5141570141570142 [2022-11-25 16:59:22,275 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2022-11-25 16:59:22,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2022-11-25 16:59:22,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:22,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2022-11-25 16:59:22,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 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 16:59:22,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 16:59:22,283 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 16:59:22,283 INFO L175 Difference]: Start difference. First operand has 73 places, 152 transitions, 1918 flow. Second operand 6 states and 799 transitions. [2022-11-25 16:59:22,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 213 transitions, 2842 flow [2022-11-25 16:59:22,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 213 transitions, 2765 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:22,881 INFO L231 Difference]: Finished difference. Result has 77 places, 163 transitions, 2314 flow [2022-11-25 16:59:22,881 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1841, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2314, PETRI_PLACES=77, PETRI_TRANSITIONS=163} [2022-11-25 16:59:22,882 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2022-11-25 16:59:22,882 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 163 transitions, 2314 flow [2022-11-25 16:59:22,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 16:59:22,883 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:22,883 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:22,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:59:22,883 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -776008754, now seen corresponding path program 1 times [2022-11-25 16:59:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:22,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528370450] [2022-11-25 16:59:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:22,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:59:23,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:23,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528370450] [2022-11-25 16:59:23,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528370450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:23,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:23,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:23,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186609037] [2022-11-25 16:59:23,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:23,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:23,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:23,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:23,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:23,076 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 259 [2022-11-25 16:59:23,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 163 transitions, 2314 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 16:59:23,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:23,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 259 [2022-11-25 16:59:23,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:25,271 INFO L130 PetriNetUnfolder]: 11171/15627 cut-off events. [2022-11-25 16:59:25,271 INFO L131 PetriNetUnfolder]: For 304243/309840 co-relation queries the response was YES. [2022-11-25 16:59:25,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107671 conditions, 15627 events. 11171/15627 cut-off events. For 304243/309840 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 91480 event pairs, 1554 based on Foata normal form. 3823/18504 useless extension candidates. Maximal degree in co-relation 107638. Up to 9487 conditions per place. [2022-11-25 16:59:25,371 INFO L137 encePairwiseOnDemand]: 252/259 looper letters, 357 selfloop transitions, 10 changer transitions 4/394 dead transitions. [2022-11-25 16:59:25,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 394 transitions, 6670 flow [2022-11-25 16:59:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2022-11-25 16:59:25,373 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2022-11-25 16:59:25,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2022-11-25 16:59:25,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2022-11-25 16:59:25,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:25,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2022-11-25 16:59:25,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 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 16:59:25,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:25,378 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 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 16:59:25,379 INFO L175 Difference]: Start difference. First operand has 77 places, 163 transitions, 2314 flow. Second operand 5 states and 658 transitions. [2022-11-25 16:59:25,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 394 transitions, 6670 flow [2022-11-25 16:59:25,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 394 transitions, 6184 flow, removed 166 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:25,742 INFO L231 Difference]: Finished difference. Result has 81 places, 162 transitions, 2129 flow [2022-11-25 16:59:25,742 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=2014, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2129, PETRI_PLACES=81, PETRI_TRANSITIONS=162} [2022-11-25 16:59:25,742 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2022-11-25 16:59:25,743 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 162 transitions, 2129 flow [2022-11-25 16:59:25,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 16:59:25,743 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:25,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:25,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:59:25,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1831026952, now seen corresponding path program 1 times [2022-11-25 16:59:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:25,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342437816] [2022-11-25 16:59:25,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:26,175 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 16:59:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:26,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342437816] [2022-11-25 16:59:26,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342437816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:26,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:26,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206832004] [2022-11-25 16:59:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:26,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:26,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 259 [2022-11-25 16:59:26,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 162 transitions, 2129 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 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 16:59:26,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:26,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 259 [2022-11-25 16:59:26,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:28,089 INFO L130 PetriNetUnfolder]: 8720/12396 cut-off events. [2022-11-25 16:59:28,090 INFO L131 PetriNetUnfolder]: For 201750/207312 co-relation queries the response was YES. [2022-11-25 16:59:28,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81243 conditions, 12396 events. 8720/12396 cut-off events. For 201750/207312 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 72619 event pairs, 752 based on Foata normal form. 3303/14988 useless extension candidates. Maximal degree in co-relation 81207. Up to 7139 conditions per place. [2022-11-25 16:59:28,185 INFO L137 encePairwiseOnDemand]: 252/259 looper letters, 412 selfloop transitions, 19 changer transitions 20/474 dead transitions. [2022-11-25 16:59:28,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 474 transitions, 7500 flow [2022-11-25 16:59:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:59:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:59:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2022-11-25 16:59:28,189 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5091009376723662 [2022-11-25 16:59:28,190 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2022-11-25 16:59:28,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2022-11-25 16:59:28,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:28,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2022-11-25 16:59:28,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 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 16:59:28,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 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 16:59:28,197 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 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 16:59:28,197 INFO L175 Difference]: Start difference. First operand has 81 places, 162 transitions, 2129 flow. Second operand 7 states and 923 transitions. [2022-11-25 16:59:28,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 474 transitions, 7500 flow [2022-11-25 16:59:28,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 474 transitions, 7495 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:28,709 INFO L231 Difference]: Finished difference. Result has 89 places, 151 transitions, 1980 flow [2022-11-25 16:59:28,709 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1980, PETRI_PLACES=89, PETRI_TRANSITIONS=151} [2022-11-25 16:59:28,709 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2022-11-25 16:59:28,710 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 151 transitions, 1980 flow [2022-11-25 16:59:28,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 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 16:59:28,710 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:28,710 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:28,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:59:28,711 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1275524459, now seen corresponding path program 1 times [2022-11-25 16:59:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:28,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295684318] [2022-11-25 16:59:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:28,938 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 16:59:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:28,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295684318] [2022-11-25 16:59:28,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295684318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:28,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:28,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:59:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941390122] [2022-11-25 16:59:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:28,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:28,958 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 259 [2022-11-25 16:59:28,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 151 transitions, 1980 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 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 16:59:28,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:28,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 259 [2022-11-25 16:59:28,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:31,447 INFO L130 PetriNetUnfolder]: 8185/11567 cut-off events. [2022-11-25 16:59:31,447 INFO L131 PetriNetUnfolder]: For 193119/198447 co-relation queries the response was YES. [2022-11-25 16:59:31,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79125 conditions, 11567 events. 8185/11567 cut-off events. For 193119/198447 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 67412 event pairs, 600 based on Foata normal form. 2679/13543 useless extension candidates. Maximal degree in co-relation 79085. Up to 6558 conditions per place. [2022-11-25 16:59:31,538 INFO L137 encePairwiseOnDemand]: 252/259 looper letters, 413 selfloop transitions, 28 changer transitions 36/500 dead transitions. [2022-11-25 16:59:31,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 500 transitions, 7925 flow [2022-11-25 16:59:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:59:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 16:59:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1186 transitions. [2022-11-25 16:59:31,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5087945087945088 [2022-11-25 16:59:31,543 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1186 transitions. [2022-11-25 16:59:31,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1186 transitions. [2022-11-25 16:59:31,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:31,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1186 transitions. [2022-11-25 16:59:31,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.77777777777777) internal successors, (1186), 9 states have internal predecessors, (1186), 0 states have call successors, (0), 0 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 16:59:31,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 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 16:59:31,552 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 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 16:59:31,552 INFO L175 Difference]: Start difference. First operand has 89 places, 151 transitions, 1980 flow. Second operand 9 states and 1186 transitions. [2022-11-25 16:59:31,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 500 transitions, 7925 flow [2022-11-25 16:59:32,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 500 transitions, 6933 flow, removed 369 selfloop flow, removed 8 redundant places. [2022-11-25 16:59:32,268 INFO L231 Difference]: Finished difference. Result has 92 places, 149 transitions, 1742 flow [2022-11-25 16:59:32,268 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1742, PETRI_PLACES=92, PETRI_TRANSITIONS=149} [2022-11-25 16:59:32,268 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2022-11-25 16:59:32,269 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 149 transitions, 1742 flow [2022-11-25 16:59:32,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 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 16:59:32,269 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:32,270 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:32,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:59:32,270 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1937808482, now seen corresponding path program 1 times [2022-11-25 16:59:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:32,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910248316] [2022-11-25 16:59:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:32,670 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 16:59:32,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:32,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910248316] [2022-11-25 16:59:32,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910248316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:32,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:32,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385092360] [2022-11-25 16:59:32,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:32,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:32,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:32,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:32,736 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 259 [2022-11-25 16:59:32,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 149 transitions, 1742 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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 16:59:32,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:32,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 259 [2022-11-25 16:59:32,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:36,402 INFO L130 PetriNetUnfolder]: 14019/20135 cut-off events. [2022-11-25 16:59:36,403 INFO L131 PetriNetUnfolder]: For 153776/155342 co-relation queries the response was YES. [2022-11-25 16:59:36,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120490 conditions, 20135 events. 14019/20135 cut-off events. For 153776/155342 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 121596 event pairs, 2293 based on Foata normal form. 1361/21458 useless extension candidates. Maximal degree in co-relation 120449. Up to 10664 conditions per place. [2022-11-25 16:59:36,537 INFO L137 encePairwiseOnDemand]: 245/259 looper letters, 143 selfloop transitions, 98 changer transitions 140/387 dead transitions. [2022-11-25 16:59:36,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 387 transitions, 5038 flow [2022-11-25 16:59:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2022-11-25 16:59:36,541 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4877734877734878 [2022-11-25 16:59:36,541 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 758 transitions. [2022-11-25 16:59:36,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions. [2022-11-25 16:59:36,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:36,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions. [2022-11-25 16:59:36,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 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 16:59:36,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 16:59:36,547 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 16:59:36,548 INFO L175 Difference]: Start difference. First operand has 92 places, 149 transitions, 1742 flow. Second operand 6 states and 758 transitions. [2022-11-25 16:59:36,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 387 transitions, 5038 flow [2022-11-25 16:59:38,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 387 transitions, 4677 flow, removed 122 selfloop flow, removed 4 redundant places. [2022-11-25 16:59:38,342 INFO L231 Difference]: Finished difference. Result has 97 places, 175 transitions, 2361 flow [2022-11-25 16:59:38,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2361, PETRI_PLACES=97, PETRI_TRANSITIONS=175} [2022-11-25 16:59:38,343 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2022-11-25 16:59:38,343 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 175 transitions, 2361 flow [2022-11-25 16:59:38,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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 16:59:38,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:38,344 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:38,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:59:38,344 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 557249048, now seen corresponding path program 2 times [2022-11-25 16:59:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:38,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441580199] [2022-11-25 16:59:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:38,627 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 16:59:38,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:38,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441580199] [2022-11-25 16:59:38,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441580199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:38,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:38,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:59:38,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879201563] [2022-11-25 16:59:38,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:38,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:59:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:38,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:59:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:59:38,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 259 [2022-11-25 16:59:38,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 175 transitions, 2361 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 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 16:59:38,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:38,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 259 [2022-11-25 16:59:38,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:41,119 INFO L130 PetriNetUnfolder]: 7672/11102 cut-off events. [2022-11-25 16:59:41,120 INFO L131 PetriNetUnfolder]: For 131064/134742 co-relation queries the response was YES. [2022-11-25 16:59:41,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70153 conditions, 11102 events. 7672/11102 cut-off events. For 131064/134742 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 67303 event pairs, 596 based on Foata normal form. 1775/12400 useless extension candidates. Maximal degree in co-relation 70107. Up to 6540 conditions per place. [2022-11-25 16:59:41,200 INFO L137 encePairwiseOnDemand]: 252/259 looper letters, 366 selfloop transitions, 21 changer transitions 146/559 dead transitions. [2022-11-25 16:59:41,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 559 transitions, 8888 flow [2022-11-25 16:59:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:59:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 16:59:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1409 transitions. [2022-11-25 16:59:41,205 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49455949455949455 [2022-11-25 16:59:41,206 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1409 transitions. [2022-11-25 16:59:41,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1409 transitions. [2022-11-25 16:59:41,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:41,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1409 transitions. [2022-11-25 16:59:41,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.0909090909091) internal successors, (1409), 11 states have internal predecessors, (1409), 0 states have call successors, (0), 0 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 16:59:41,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 259.0) internal successors, (3108), 12 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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 16:59:41,216 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 259.0) internal successors, (3108), 12 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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 16:59:41,216 INFO L175 Difference]: Start difference. First operand has 97 places, 175 transitions, 2361 flow. Second operand 11 states and 1409 transitions. [2022-11-25 16:59:41,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 559 transitions, 8888 flow [2022-11-25 16:59:41,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 559 transitions, 8647 flow, removed 86 selfloop flow, removed 5 redundant places. [2022-11-25 16:59:41,628 INFO L231 Difference]: Finished difference. Result has 103 places, 141 transitions, 1805 flow [2022-11-25 16:59:41,628 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1805, PETRI_PLACES=103, PETRI_TRANSITIONS=141} [2022-11-25 16:59:41,628 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2022-11-25 16:59:41,628 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 141 transitions, 1805 flow [2022-11-25 16:59:41,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 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 16:59:41,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:41,629 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:41,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:59:41,630 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash 936424969, now seen corresponding path program 1 times [2022-11-25 16:59:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:41,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059834163] [2022-11-25 16:59:41,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:41,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:42,310 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 16:59:42,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:42,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059834163] [2022-11-25 16:59:42,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059834163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:42,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:42,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:59:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349553189] [2022-11-25 16:59:42,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:42,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:59:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:42,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:59:42,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:59:42,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 259 [2022-11-25 16:59:42,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 141 transitions, 1805 flow. Second operand has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 0 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 16:59:42,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:42,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 259 [2022-11-25 16:59:42,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:45,209 INFO L130 PetriNetUnfolder]: 8845/13067 cut-off events. [2022-11-25 16:59:45,209 INFO L131 PetriNetUnfolder]: For 87539/89178 co-relation queries the response was YES. [2022-11-25 16:59:45,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81686 conditions, 13067 events. 8845/13067 cut-off events. For 87539/89178 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 80845 event pairs, 658 based on Foata normal form. 1321/14354 useless extension candidates. Maximal degree in co-relation 81651. Up to 6313 conditions per place. [2022-11-25 16:59:45,283 INFO L137 encePairwiseOnDemand]: 246/259 looper letters, 114 selfloop transitions, 41 changer transitions 251/410 dead transitions. [2022-11-25 16:59:45,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 410 transitions, 5678 flow [2022-11-25 16:59:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:59:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 16:59:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2022-11-25 16:59:45,288 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4723294723294723 [2022-11-25 16:59:45,289 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2022-11-25 16:59:45,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2022-11-25 16:59:45,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:45,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2022-11-25 16:59:45,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 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 16:59:45,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 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 16:59:45,298 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 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 16:59:45,298 INFO L175 Difference]: Start difference. First operand has 103 places, 141 transitions, 1805 flow. Second operand 9 states and 1101 transitions. [2022-11-25 16:59:45,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 410 transitions, 5678 flow [2022-11-25 16:59:45,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 410 transitions, 5373 flow, removed 62 selfloop flow, removed 9 redundant places. [2022-11-25 16:59:45,638 INFO L231 Difference]: Finished difference. Result has 104 places, 106 transitions, 1400 flow [2022-11-25 16:59:45,638 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1400, PETRI_PLACES=104, PETRI_TRANSITIONS=106} [2022-11-25 16:59:45,638 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2022-11-25 16:59:45,639 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 106 transitions, 1400 flow [2022-11-25 16:59:45,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 0 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 16:59:45,639 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:45,639 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:45,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:59:45,639 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1616742207, now seen corresponding path program 2 times [2022-11-25 16:59:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:45,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016891938] [2022-11-25 16:59:45,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:45,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:46,076 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 16:59:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:46,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016891938] [2022-11-25 16:59:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016891938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:46,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:46,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338643175] [2022-11-25 16:59:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:46,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:46,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:46,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:46,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2022-11-25 16:59:46,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 106 transitions, 1400 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 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 16:59:46,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:46,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2022-11-25 16:59:46,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:47,671 INFO L130 PetriNetUnfolder]: 7046/10818 cut-off events. [2022-11-25 16:59:47,671 INFO L131 PetriNetUnfolder]: For 91587/92762 co-relation queries the response was YES. [2022-11-25 16:59:47,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68237 conditions, 10818 events. 7046/10818 cut-off events. For 91587/92762 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 69719 event pairs, 2125 based on Foata normal form. 944/11736 useless extension candidates. Maximal degree in co-relation 68191. Up to 5804 conditions per place. [2022-11-25 16:59:47,710 INFO L137 encePairwiseOnDemand]: 254/259 looper letters, 57 selfloop transitions, 5 changer transitions 92/156 dead transitions. [2022-11-25 16:59:47,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 156 transitions, 2149 flow [2022-11-25 16:59:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2022-11-25 16:59:47,712 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2022-11-25 16:59:47,712 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2022-11-25 16:59:47,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2022-11-25 16:59:47,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:47,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2022-11-25 16:59:47,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 16:59:47,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 16:59:47,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 16:59:47,717 INFO L175 Difference]: Start difference. First operand has 104 places, 106 transitions, 1400 flow. Second operand 4 states and 497 transitions. [2022-11-25 16:59:47,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 156 transitions, 2149 flow [2022-11-25 16:59:48,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 156 transitions, 1907 flow, removed 61 selfloop flow, removed 10 redundant places. [2022-11-25 16:59:48,077 INFO L231 Difference]: Finished difference. Result has 91 places, 52 transitions, 429 flow [2022-11-25 16:59:48,077 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=91, PETRI_TRANSITIONS=52} [2022-11-25 16:59:48,078 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2022-11-25 16:59:48,078 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 52 transitions, 429 flow [2022-11-25 16:59:48,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 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 16:59:48,078 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:48,078 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:48,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 16:59:48,079 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1812940697, now seen corresponding path program 3 times [2022-11-25 16:59:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:48,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501799714] [2022-11-25 16:59:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:49,423 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 16:59:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:49,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501799714] [2022-11-25 16:59:49,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501799714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:49,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:49,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:59:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534007630] [2022-11-25 16:59:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:49,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 16:59:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 16:59:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:59:49,551 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 259 [2022-11-25 16:59:49,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 52 transitions, 429 flow. Second operand has 10 states, 10 states have (on average 119.4) internal successors, (1194), 10 states have internal predecessors, (1194), 0 states have call successors, (0), 0 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 16:59:49,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:49,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 259 [2022-11-25 16:59:49,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:50,223 INFO L130 PetriNetUnfolder]: 1266/2097 cut-off events. [2022-11-25 16:59:50,224 INFO L131 PetriNetUnfolder]: For 10395/10443 co-relation queries the response was YES. [2022-11-25 16:59:50,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10849 conditions, 2097 events. 1266/2097 cut-off events. For 10395/10443 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10556 event pairs, 237 based on Foata normal form. 12/2052 useless extension candidates. Maximal degree in co-relation 10818. Up to 837 conditions per place. [2022-11-25 16:59:50,240 INFO L137 encePairwiseOnDemand]: 251/259 looper letters, 57 selfloop transitions, 4 changer transitions 57/122 dead transitions. [2022-11-25 16:59:50,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 122 transitions, 1128 flow [2022-11-25 16:59:50,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:59:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:59:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions. [2022-11-25 16:59:50,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49034749034749037 [2022-11-25 16:59:50,259 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions. [2022-11-25 16:59:50,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions. [2022-11-25 16:59:50,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:50,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions. [2022-11-25 16:59:50,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 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 16:59:50,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 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 16:59:50,279 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 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 16:59:50,281 INFO L175 Difference]: Start difference. First operand has 91 places, 52 transitions, 429 flow. Second operand 7 states and 889 transitions. [2022-11-25 16:59:50,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 122 transitions, 1128 flow [2022-11-25 16:59:50,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 122 transitions, 931 flow, removed 55 selfloop flow, removed 21 redundant places. [2022-11-25 16:59:50,356 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 308 flow [2022-11-25 16:59:50,356 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2022-11-25 16:59:50,356 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2022-11-25 16:59:50,357 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 308 flow [2022-11-25 16:59:50,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 119.4) internal successors, (1194), 10 states have internal predecessors, (1194), 0 states have call successors, (0), 0 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 16:59:50,358 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:50,358 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:50,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 16:59:50,358 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:59:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2114243543, now seen corresponding path program 4 times [2022-11-25 16:59:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:50,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030180378] [2022-11-25 16:59:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:50,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:59:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:50,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:59:50,494 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:59:50,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 16:59:50,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 16:59:50,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 16:59:50,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 16:59:50,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 16:59:50,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 16:59:50,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 16:59:50,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 16:59:50,504 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:50,513 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:59:50,513 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:59:50,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:59:50 BasicIcfg [2022-11-25 16:59:50,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:59:50,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:59:50,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:59:50,653 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:59:50,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:38" (3/4) ... [2022-11-25 16:59:50,656 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:59:50,768 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:59:50,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:59:50,771 INFO L158 Benchmark]: Toolchain (without parser) took 73974.39ms. Allocated memory was 174.1MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 131.1MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-25 16:59:50,771 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 115.3MB. Free memory was 78.8MB in the beginning and 78.8MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:59:50,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 772.64ms. Allocated memory is still 174.1MB. Free memory was 131.1MB in the beginning and 102.5MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 16:59:50,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.43ms. Allocated memory is still 174.1MB. Free memory was 102.5MB in the beginning and 143.7MB in the end (delta: -41.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-11-25 16:59:50,774 INFO L158 Benchmark]: Boogie Preprocessor took 68.96ms. Allocated memory is still 174.1MB. Free memory was 143.7MB in the beginning and 141.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:59:50,774 INFO L158 Benchmark]: RCFGBuilder took 862.85ms. Allocated memory is still 174.1MB. Free memory was 141.9MB in the beginning and 104.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-25 16:59:50,775 INFO L158 Benchmark]: TraceAbstraction took 72008.52ms. Allocated memory was 174.1MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 103.2MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 994.5MB. Max. memory is 16.1GB. [2022-11-25 16:59:50,775 INFO L158 Benchmark]: Witness Printer took 117.33ms. Allocated memory is still 5.8GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 16:59:50,777 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 115.3MB. Free memory was 78.8MB in the beginning and 78.8MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 772.64ms. Allocated memory is still 174.1MB. Free memory was 131.1MB in the beginning and 102.5MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.43ms. Allocated memory is still 174.1MB. Free memory was 102.5MB in the beginning and 143.7MB in the end (delta: -41.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.96ms. Allocated memory is still 174.1MB. Free memory was 143.7MB in the beginning and 141.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 862.85ms. Allocated memory is still 174.1MB. Free memory was 141.9MB in the beginning and 104.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 72008.52ms. Allocated memory was 174.1MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 103.2MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 994.5MB. Max. memory is 16.1GB. * Witness Printer took 117.33ms. Allocated memory is still 5.8GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 146 PlacesBefore, 43 PlacesAfterwards, 135 TransitionsBefore, 31 TransitionsAfterwards, 3504 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 9554 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4444, independent: 4207, independent conditional: 0, independent unconditional: 4207, dependent: 237, dependent conditional: 0, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2570, independent: 2488, independent conditional: 0, independent unconditional: 2488, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2570, independent: 2454, independent conditional: 0, independent unconditional: 2454, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 667, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 617, dependent conditional: 0, dependent unconditional: 617, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4444, independent: 1719, independent conditional: 0, independent unconditional: 1719, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 2570, unknown conditional: 0, unknown unconditional: 2570] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-4, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=-3, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=-2, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=-1, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 71.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 53.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1450 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1244 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 347 mSDsCounter, 358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3183 IncrementalHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 358 mSolverCounterUnsat, 138 mSDtfsCounter, 3183 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2361occurred in iteration=16, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 3644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 16:59:50,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97a26bed-0c70-4529-9784-aba911f8cd28/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE