./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8 --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 a72b3b3683b5d2b2d35965fc1a3189152678e29fe154c9fbeb2d06d1447980e3 --- 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-2329fc7 [2022-12-13 20:55:53,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:55:53,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:55:53,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:55:53,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:55:53,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:55:53,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:55:53,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:55:53,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:55:53,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:55:53,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:55:53,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:55:53,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:55:53,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:55:53,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:55:53,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:55:53,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:55:53,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:55:53,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:55:53,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:55:53,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:55:53,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:55:53,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:55:53,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:55:53,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:55:53,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:55:53,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:55:53,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:55:53,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:55:53,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:55:53,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:55:53,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:55:53,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:55:53,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:55:53,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:55:53,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:55:53,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:55:53,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:55:53,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:55:53,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:55:53,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:55:53,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:55:53,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:55:53,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:55:53,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:55:53,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:55:53,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:55:53,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:55:53,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:55:53,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:55:53,085 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:55:53,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:55:53,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:55:53,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:55:53,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:55:53,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:55:53,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:55:53,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:55:53,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:55:53,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:55:53,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:55:53,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:55:53,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:55:53,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:55:53,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:55:53,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:55:53,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:55:53,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:55:53,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:55:53,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:55:53,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:55:53,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:55:53,089 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:55:53,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:55:53,089 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:55:53,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:55:53,090 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:55:53,090 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_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/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_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8 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 -> a72b3b3683b5d2b2d35965fc1a3189152678e29fe154c9fbeb2d06d1447980e3 [2022-12-13 20:55:53,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:55:53,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:55:53,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:55:53,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:55:53,280 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:55:53,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 20:55:55,889 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:55:56,086 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:55:56,087 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 20:55:56,096 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/data/af28ddea9/ce55a045929243008804b78762a09a9e/FLAG502553798 [2022-12-13 20:55:56,108 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/data/af28ddea9/ce55a045929243008804b78762a09a9e [2022-12-13 20:55:56,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:55:56,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:55:56,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:55:56,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:55:56,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:55:56,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383af1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56, skipping insertion in model container [2022-12-13 20:55:56,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:55:56,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:55:56,312 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_d0157f59-35ff-4c3b-848c-8a339c93982d/sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 20:55:56,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:55:56,493 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:55:56,504 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_d0157f59-35ff-4c3b-848c-8a339c93982d/sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 20:55:56,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:55:56,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:55:56,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:55:56,589 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:55:56,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56 WrapperNode [2022-12-13 20:55:56,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:55:56,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:55:56,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:55:56,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:55:56,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,625 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 20:55:56,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:55:56,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:55:56,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:55:56,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:55:56,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,653 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:55:56,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:55:56,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:55:56,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:55:56,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (1/1) ... [2022-12-13 20:55:56,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:55:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:55:56,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:55:56,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:55:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:55:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 20:55:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:55:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:55:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:55:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 20:55:56,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 20:55:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 20:55:56,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 20:55:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 20:55:56,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 20:55:56,732 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 20:55:56,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 20:55:56,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:55:56,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 20:55:56,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:55:56,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:55:56,735 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 20:55:56,864 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:55:56,866 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:55:57,144 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:55:57,220 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:55:57,220 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:55:57,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:55:57 BoogieIcfgContainer [2022-12-13 20:55:57,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:55:57,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:55:57,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:55:57,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:55:57,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:55:56" (1/3) ... [2022-12-13 20:55:57,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e346b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:55:57, skipping insertion in model container [2022-12-13 20:55:57,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:55:56" (2/3) ... [2022-12-13 20:55:57,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e346b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:55:57, skipping insertion in model container [2022-12-13 20:55:57,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:55:57" (3/3) ... [2022-12-13 20:55:57,227 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 20:55:57,234 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 20:55:57,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:55:57,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 20:55:57,242 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:55:57,287 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 20:55:57,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-12-13 20:55:57,373 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-12-13 20:55:57,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:55:57,378 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 73 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-12-13 20:55:57,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2022-12-13 20:55:57,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2022-12-13 20:55:57,387 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:55:57,397 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 282 flow [2022-12-13 20:55:57,400 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 282 flow [2022-12-13 20:55:57,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 282 flow [2022-12-13 20:55:57,432 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-12-13 20:55:57,433 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:55:57,434 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 73 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-12-13 20:55:57,436 INFO L119 LiptonReduction]: Number of co-enabled transitions 3518 [2022-12-13 20:56:00,701 INFO L134 LiptonReduction]: Checked pairs total: 10158 [2022-12-13 20:56:00,701 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-12-13 20:56:00,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:56:00,715 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;@705e945b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:56:00,715 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 20:56:00,717 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 20:56:00,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:56:00,718 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:00,718 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 20:56:00,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:00,722 INFO L85 PathProgramCache]: Analyzing trace with hash 573137, now seen corresponding path program 1 times [2022-12-13 20:56:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:00,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487859372] [2022-12-13 20:56:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:00,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487859372] [2022-12-13 20:56:00,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487859372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:00,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:00,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:56:00,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528586241] [2022-12-13 20:56:00,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:01,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:01,007 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 255 [2022-12-13 20:56:01,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:01,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:01,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 255 [2022-12-13 20:56:01,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:02,161 INFO L130 PetriNetUnfolder]: 8247/11290 cut-off events. [2022-12-13 20:56:02,161 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-13 20:56:02,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22570 conditions, 11290 events. 8247/11290 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 58647 event pairs, 3119 based on Foata normal form. 384/10901 useless extension candidates. Maximal degree in co-relation 22558. Up to 8863 conditions per place. [2022-12-13 20:56:02,209 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 45 selfloop transitions, 2 changer transitions 4/54 dead transitions. [2022-12-13 20:56:02,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 231 flow [2022-12-13 20:56:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:56:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-12-13 20:56:02,220 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5529411764705883 [2022-12-13 20:56:02,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2022-12-13 20:56:02,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2022-12-13 20:56:02,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:02,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2022-12-13 20:56:02,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:02,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:02,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:02,232 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 423 transitions. [2022-12-13 20:56:02,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 231 flow [2022-12-13 20:56:02,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 20:56:02,236 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-12-13 20:56:02,237 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 20:56:02,240 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2022-12-13 20:56:02,241 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-12-13 20:56:02,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:02,241 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:02,241 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:02,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:56:02,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash -51293540, now seen corresponding path program 1 times [2022-12-13 20:56:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:02,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166146667] [2022-12-13 20:56:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:02,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166146667] [2022-12-13 20:56:02,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166146667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:02,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:02,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:56:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211688643] [2022-12-13 20:56:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:02,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:02,446 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2022-12-13 20:56:02,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:02,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:02,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2022-12-13 20:56:02,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:05,088 INFO L130 PetriNetUnfolder]: 24071/32606 cut-off events. [2022-12-13 20:56:05,089 INFO L131 PetriNetUnfolder]: For 1485/1485 co-relation queries the response was YES. [2022-12-13 20:56:05,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67194 conditions, 32606 events. 24071/32606 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 180466 event pairs, 7406 based on Foata normal form. 1344/33950 useless extension candidates. Maximal degree in co-relation 67184. Up to 16320 conditions per place. [2022-12-13 20:56:05,197 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 45 selfloop transitions, 8 changer transitions 35/88 dead transitions. [2022-12-13 20:56:05,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 374 flow [2022-12-13 20:56:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:56:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:56:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2022-12-13 20:56:05,199 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-13 20:56:05,200 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2022-12-13 20:56:05,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2022-12-13 20:56:05,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:05,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2022-12-13 20:56:05,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:05,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:05,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:05,204 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 650 transitions. [2022-12-13 20:56:05,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 374 flow [2022-12-13 20:56:05,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:56:05,205 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 146 flow [2022-12-13 20:56:05,205 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-13 20:56:05,206 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2022-12-13 20:56:05,206 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 146 flow [2022-12-13 20:56:05,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:05,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:05,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:05,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:56:05,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:05,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:05,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1590157164, now seen corresponding path program 1 times [2022-12-13 20:56:05,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:05,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302024394] [2022-12-13 20:56:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:05,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:05,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302024394] [2022-12-13 20:56:05,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302024394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:05,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:05,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:56:05,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987950723] [2022-12-13 20:56:05,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:05,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:05,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:05,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:05,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:05,371 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 255 [2022-12-13 20:56:05,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:05,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:05,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 255 [2022-12-13 20:56:05,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:07,773 INFO L130 PetriNetUnfolder]: 19758/27685 cut-off events. [2022-12-13 20:56:07,773 INFO L131 PetriNetUnfolder]: For 21511/21642 co-relation queries the response was YES. [2022-12-13 20:56:07,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73822 conditions, 27685 events. 19758/27685 cut-off events. For 21511/21642 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 167495 event pairs, 5234 based on Foata normal form. 1266/28648 useless extension candidates. Maximal degree in co-relation 73808. Up to 21791 conditions per place. [2022-12-13 20:56:07,901 INFO L137 encePairwiseOnDemand]: 250/255 looper letters, 49 selfloop transitions, 5 changer transitions 37/95 dead transitions. [2022-12-13 20:56:07,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 95 transitions, 572 flow [2022-12-13 20:56:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:56:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:56:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2022-12-13 20:56:07,903 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.527843137254902 [2022-12-13 20:56:07,903 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2022-12-13 20:56:07,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2022-12-13 20:56:07,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:07,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2022-12-13 20:56:07,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:07,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:07,908 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:07,908 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 146 flow. Second operand 5 states and 673 transitions. [2022-12-13 20:56:07,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 95 transitions, 572 flow [2022-12-13 20:56:07,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 95 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:56:07,951 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 187 flow [2022-12-13 20:56:07,951 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-13 20:56:07,952 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2022-12-13 20:56:07,952 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 187 flow [2022-12-13 20:56:07,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:07,952 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:07,953 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:07,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:56:07,953 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1590127373, now seen corresponding path program 1 times [2022-12-13 20:56:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:07,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146037217] [2022-12-13 20:56:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:08,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146037217] [2022-12-13 20:56:08,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146037217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:08,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:08,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:56:08,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534658294] [2022-12-13 20:56:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:08,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:08,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:08,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:08,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:08,076 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2022-12-13 20:56:08,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 187 flow. Second operand has 4 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-12-13 20:56:08,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:08,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2022-12-13 20:56:08,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:10,136 INFO L130 PetriNetUnfolder]: 16053/22634 cut-off events. [2022-12-13 20:56:10,136 INFO L131 PetriNetUnfolder]: For 27285/27758 co-relation queries the response was YES. [2022-12-13 20:56:10,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60719 conditions, 22634 events. 16053/22634 cut-off events. For 27285/27758 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 133265 event pairs, 4932 based on Foata normal form. 1138/23225 useless extension candidates. Maximal degree in co-relation 60702. Up to 14049 conditions per place. [2022-12-13 20:56:10,226 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 43 selfloop transitions, 3 changer transitions 26/80 dead transitions. [2022-12-13 20:56:10,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 463 flow [2022-12-13 20:56:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:56:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:56:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2022-12-13 20:56:10,228 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5223529411764706 [2022-12-13 20:56:10,228 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2022-12-13 20:56:10,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2022-12-13 20:56:10,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:10,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2022-12-13 20:56:10,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:10,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:10,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:10,231 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 187 flow. Second operand 5 states and 666 transitions. [2022-12-13 20:56:10,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 463 flow [2022-12-13 20:56:10,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 454 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 20:56:10,284 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 195 flow [2022-12-13 20:56:10,284 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-13 20:56:10,285 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2022-12-13 20:56:10,285 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 195 flow [2022-12-13 20:56:10,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-12-13 20:56:10,285 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:10,285 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:10,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:56:10,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash 13134223, now seen corresponding path program 1 times [2022-12-13 20:56:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:10,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986391974] [2022-12-13 20:56:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:10,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:10,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986391974] [2022-12-13 20:56:10,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986391974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:10,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:10,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:56:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657845947] [2022-12-13 20:56:10,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:10,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:10,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:10,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:10,376 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 255 [2022-12-13 20:56:10,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:10,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:10,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 255 [2022-12-13 20:56:10,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:12,355 INFO L130 PetriNetUnfolder]: 15992/22612 cut-off events. [2022-12-13 20:56:12,355 INFO L131 PetriNetUnfolder]: For 34618/34769 co-relation queries the response was YES. [2022-12-13 20:56:12,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63140 conditions, 22612 events. 15992/22612 cut-off events. For 34618/34769 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 130764 event pairs, 7734 based on Foata normal form. 770/23353 useless extension candidates. Maximal degree in co-relation 63120. Up to 18954 conditions per place. [2022-12-13 20:56:12,455 INFO L137 encePairwiseOnDemand]: 250/255 looper letters, 52 selfloop transitions, 5 changer transitions 24/87 dead transitions. [2022-12-13 20:56:12,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 87 transitions, 529 flow [2022-12-13 20:56:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:56:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:56:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2022-12-13 20:56:12,457 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5247058823529411 [2022-12-13 20:56:12,457 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2022-12-13 20:56:12,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2022-12-13 20:56:12,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:12,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2022-12-13 20:56:12,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:12,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:12,461 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:12,461 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 195 flow. Second operand 5 states and 669 transitions. [2022-12-13 20:56:12,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 87 transitions, 529 flow [2022-12-13 20:56:12,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 515 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 20:56:12,605 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 238 flow [2022-12-13 20:56:12,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-13 20:56:12,605 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2022-12-13 20:56:12,606 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 238 flow [2022-12-13 20:56:12,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:12,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:12,606 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:12,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:56:12,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1192689095, now seen corresponding path program 1 times [2022-12-13 20:56:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:12,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062736082] [2022-12-13 20:56:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:12,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:12,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062736082] [2022-12-13 20:56:12,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062736082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:12,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:12,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:12,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807910574] [2022-12-13 20:56:12,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:12,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:56:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:12,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:56:12,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:12,759 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2022-12-13 20:56:12,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:12,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:12,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2022-12-13 20:56:12,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:16,124 INFO L130 PetriNetUnfolder]: 24728/33965 cut-off events. [2022-12-13 20:56:16,124 INFO L131 PetriNetUnfolder]: For 51022/51022 co-relation queries the response was YES. [2022-12-13 20:56:16,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97636 conditions, 33965 events. 24728/33965 cut-off events. For 51022/51022 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 194886 event pairs, 4539 based on Foata normal form. 864/34829 useless extension candidates. Maximal degree in co-relation 97615. Up to 14073 conditions per place. [2022-12-13 20:56:16,257 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 69 selfloop transitions, 15 changer transitions 40/124 dead transitions. [2022-12-13 20:56:16,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 124 transitions, 758 flow [2022-12-13 20:56:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:56:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:56:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 898 transitions. [2022-12-13 20:56:16,260 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5030812324929972 [2022-12-13 20:56:16,260 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 898 transitions. [2022-12-13 20:56:16,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 898 transitions. [2022-12-13 20:56:16,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:16,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 898 transitions. [2022-12-13 20:56:16,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:16,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:16,263 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:16,264 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 238 flow. Second operand 7 states and 898 transitions. [2022-12-13 20:56:16,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 124 transitions, 758 flow [2022-12-13 20:56:16,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 124 transitions, 737 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 20:56:16,439 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 328 flow [2022-12-13 20:56:16,439 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2022-12-13 20:56:16,440 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2022-12-13 20:56:16,440 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 328 flow [2022-12-13 20:56:16,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:16,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:16,440 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:16,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:56:16,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1194774465, now seen corresponding path program 1 times [2022-12-13 20:56:16,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:16,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241410688] [2022-12-13 20:56:16,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:16,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241410688] [2022-12-13 20:56:16,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241410688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:16,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:16,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:56:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305531498] [2022-12-13 20:56:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:56:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:56:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:56:16,558 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 20:56:16,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:16,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:16,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 20:56:16,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:18,077 INFO L130 PetriNetUnfolder]: 11334/16713 cut-off events. [2022-12-13 20:56:18,077 INFO L131 PetriNetUnfolder]: For 36871/37490 co-relation queries the response was YES. [2022-12-13 20:56:18,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49970 conditions, 16713 events. 11334/16713 cut-off events. For 36871/37490 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 103143 event pairs, 2800 based on Foata normal form. 695/17198 useless extension candidates. Maximal degree in co-relation 49943. Up to 14166 conditions per place. [2022-12-13 20:56:18,145 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 60 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2022-12-13 20:56:18,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 609 flow [2022-12-13 20:56:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:56:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:56:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2022-12-13 20:56:18,147 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5281045751633987 [2022-12-13 20:56:18,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2022-12-13 20:56:18,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2022-12-13 20:56:18,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:18,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2022-12-13 20:56:18,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:18,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:18,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:18,149 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 328 flow. Second operand 3 states and 404 transitions. [2022-12-13 20:56:18,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 609 flow [2022-12-13 20:56:18,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 593 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 20:56:18,206 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 349 flow [2022-12-13 20:56:18,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2022-12-13 20:56:18,207 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2022-12-13 20:56:18,207 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 349 flow [2022-12-13 20:56:18,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:18,207 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:18,207 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:18,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:56:18,207 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1583241064, now seen corresponding path program 1 times [2022-12-13 20:56:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:18,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928165373] [2022-12-13 20:56:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:18,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928165373] [2022-12-13 20:56:18,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928165373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:18,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:18,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683787764] [2022-12-13 20:56:18,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:18,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:56:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:18,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:56:18,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:18,383 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2022-12-13 20:56:18,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:18,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:18,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2022-12-13 20:56:18,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:21,117 INFO L130 PetriNetUnfolder]: 20596/29745 cut-off events. [2022-12-13 20:56:21,117 INFO L131 PetriNetUnfolder]: For 64865/64865 co-relation queries the response was YES. [2022-12-13 20:56:21,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100549 conditions, 29745 events. 20596/29745 cut-off events. For 64865/64865 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 184721 event pairs, 5798 based on Foata normal form. 528/30273 useless extension candidates. Maximal degree in co-relation 100521. Up to 13563 conditions per place. [2022-12-13 20:56:21,223 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 84 selfloop transitions, 17 changer transitions 43/144 dead transitions. [2022-12-13 20:56:21,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 144 transitions, 1080 flow [2022-12-13 20:56:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:56:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:56:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 897 transitions. [2022-12-13 20:56:21,226 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5025210084033613 [2022-12-13 20:56:21,226 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 897 transitions. [2022-12-13 20:56:21,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 897 transitions. [2022-12-13 20:56:21,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:21,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 897 transitions. [2022-12-13 20:56:21,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:21,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:21,230 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:21,230 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 349 flow. Second operand 7 states and 897 transitions. [2022-12-13 20:56:21,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 144 transitions, 1080 flow [2022-12-13 20:56:21,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 144 transitions, 1063 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 20:56:21,310 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 471 flow [2022-12-13 20:56:21,310 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=471, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2022-12-13 20:56:21,310 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2022-12-13 20:56:21,310 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 471 flow [2022-12-13 20:56:21,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:21,311 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:21,311 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:21,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:56:21,311 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash 288297421, now seen corresponding path program 1 times [2022-12-13 20:56:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:21,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744804028] [2022-12-13 20:56:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:21,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:21,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744804028] [2022-12-13 20:56:21,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744804028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:21,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:21,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:56:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383576914] [2022-12-13 20:56:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:21,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:56:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:21,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:56:21,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:56:21,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 20:56:21,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 471 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:21,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:21,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 20:56:21,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:22,755 INFO L130 PetriNetUnfolder]: 7818/12276 cut-off events. [2022-12-13 20:56:22,755 INFO L131 PetriNetUnfolder]: For 27888/28426 co-relation queries the response was YES. [2022-12-13 20:56:22,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40054 conditions, 12276 events. 7818/12276 cut-off events. For 27888/28426 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 81312 event pairs, 1650 based on Foata normal form. 1029/13122 useless extension candidates. Maximal degree in co-relation 40019. Up to 5980 conditions per place. [2022-12-13 20:56:22,790 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 85 selfloop transitions, 9 changer transitions 5/110 dead transitions. [2022-12-13 20:56:22,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 110 transitions, 1021 flow [2022-12-13 20:56:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:56:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:56:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-12-13 20:56:22,792 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5303921568627451 [2022-12-13 20:56:22,792 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2022-12-13 20:56:22,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2022-12-13 20:56:22,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:22,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2022-12-13 20:56:22,793 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-12-13 20:56:22,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:22,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:22,794 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 471 flow. Second operand 4 states and 541 transitions. [2022-12-13 20:56:22,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 110 transitions, 1021 flow [2022-12-13 20:56:22,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 110 transitions, 989 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 20:56:22,830 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 469 flow [2022-12-13 20:56:22,830 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=469, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2022-12-13 20:56:22,830 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2022-12-13 20:56:22,830 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 469 flow [2022-12-13 20:56:22,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:22,831 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:22,831 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:22,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:56:22,831 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash -201635167, now seen corresponding path program 1 times [2022-12-13 20:56:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:22,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747248798] [2022-12-13 20:56:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747248798] [2022-12-13 20:56:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747248798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:22,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:22,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447065523] [2022-12-13 20:56:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:22,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:56:22,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:22,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:56:22,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:22,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 20:56:22,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:22,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:22,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 20:56:22,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:24,841 INFO L130 PetriNetUnfolder]: 11403/17889 cut-off events. [2022-12-13 20:56:24,841 INFO L131 PetriNetUnfolder]: For 46281/46630 co-relation queries the response was YES. [2022-12-13 20:56:24,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65447 conditions, 17889 events. 11403/17889 cut-off events. For 46281/46630 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 122993 event pairs, 2677 based on Foata normal form. 231/18042 useless extension candidates. Maximal degree in co-relation 65412. Up to 8233 conditions per place. [2022-12-13 20:56:24,888 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 82 selfloop transitions, 4 changer transitions 31/125 dead transitions. [2022-12-13 20:56:24,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 125 transitions, 1164 flow [2022-12-13 20:56:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:56:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:56:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2022-12-13 20:56:24,890 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5184313725490196 [2022-12-13 20:56:24,890 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2022-12-13 20:56:24,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2022-12-13 20:56:24,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:24,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2022-12-13 20:56:24,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:24,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:24,892 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:24,892 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 469 flow. Second operand 5 states and 661 transitions. [2022-12-13 20:56:24,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 125 transitions, 1164 flow [2022-12-13 20:56:24,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 1058 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 20:56:24,958 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 464 flow [2022-12-13 20:56:24,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=464, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2022-12-13 20:56:24,959 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2022-12-13 20:56:24,959 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 464 flow [2022-12-13 20:56:24,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:24,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:24,959 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:24,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:56:24,959 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2040675837, now seen corresponding path program 2 times [2022-12-13 20:56:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:24,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055767588] [2022-12-13 20:56:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:25,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055767588] [2022-12-13 20:56:25,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055767588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:25,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:25,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:56:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211861341] [2022-12-13 20:56:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:25,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:56:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:56:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:56:25,079 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 20:56:25,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 464 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:25,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:25,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 20:56:25,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:26,332 INFO L130 PetriNetUnfolder]: 7488/11829 cut-off events. [2022-12-13 20:56:26,332 INFO L131 PetriNetUnfolder]: For 18399/18557 co-relation queries the response was YES. [2022-12-13 20:56:26,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39839 conditions, 11829 events. 7488/11829 cut-off events. For 18399/18557 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 80495 event pairs, 1547 based on Foata normal form. 766/12429 useless extension candidates. Maximal degree in co-relation 39804. Up to 4610 conditions per place. [2022-12-13 20:56:26,374 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 94 selfloop transitions, 13 changer transitions 13/130 dead transitions. [2022-12-13 20:56:26,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 130 transitions, 1119 flow [2022-12-13 20:56:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:56:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:56:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2022-12-13 20:56:26,376 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5301960784313725 [2022-12-13 20:56:26,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2022-12-13 20:56:26,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2022-12-13 20:56:26,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:26,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2022-12-13 20:56:26,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:26,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:26,379 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:26,379 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 464 flow. Second operand 5 states and 676 transitions. [2022-12-13 20:56:26,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 130 transitions, 1119 flow [2022-12-13 20:56:26,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 130 transitions, 1109 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 20:56:26,417 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 468 flow [2022-12-13 20:56:26,417 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=468, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2022-12-13 20:56:26,418 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2022-12-13 20:56:26,418 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 468 flow [2022-12-13 20:56:26,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:26,418 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:26,418 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:26,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:56:26,418 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:26,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:26,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1778125959, now seen corresponding path program 1 times [2022-12-13 20:56:26,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:26,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269755150] [2022-12-13 20:56:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:26,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269755150] [2022-12-13 20:56:26,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269755150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:26,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:26,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:56:26,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386797114] [2022-12-13 20:56:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:26,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:56:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:56:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:56:26,580 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 20:56:26,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:26,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:26,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 20:56:26,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:28,005 INFO L130 PetriNetUnfolder]: 6880/10807 cut-off events. [2022-12-13 20:56:28,005 INFO L131 PetriNetUnfolder]: For 20189/20338 co-relation queries the response was YES. [2022-12-13 20:56:28,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40048 conditions, 10807 events. 6880/10807 cut-off events. For 20189/20338 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 73472 event pairs, 1499 based on Foata normal form. 227/10876 useless extension candidates. Maximal degree in co-relation 40012. Up to 4491 conditions per place. [2022-12-13 20:56:28,038 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 57 selfloop transitions, 17 changer transitions 46/123 dead transitions. [2022-12-13 20:56:28,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 1074 flow [2022-12-13 20:56:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:56:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:56:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions. [2022-12-13 20:56:28,040 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5196078431372549 [2022-12-13 20:56:28,041 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 795 transitions. [2022-12-13 20:56:28,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions. [2022-12-13 20:56:28,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:28,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions. [2022-12-13 20:56:28,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:28,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:28,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:28,045 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 468 flow. Second operand 6 states and 795 transitions. [2022-12-13 20:56:28,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 1074 flow [2022-12-13 20:56:28,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 123 transitions, 966 flow, removed 22 selfloop flow, removed 9 redundant places. [2022-12-13 20:56:28,607 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 270 flow [2022-12-13 20:56:28,607 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2022-12-13 20:56:28,608 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2022-12-13 20:56:28,608 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 270 flow [2022-12-13 20:56:28,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:28,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:28,608 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:28,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:56:28,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1487574044, now seen corresponding path program 1 times [2022-12-13 20:56:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:28,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25747764] [2022-12-13 20:56:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:29,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:29,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25747764] [2022-12-13 20:56:29,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25747764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:29,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:29,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:56:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997117237] [2022-12-13 20:56:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:29,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:56:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:56:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:56:29,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 255 [2022-12-13 20:56:29,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 270 flow. Second operand has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:29,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:29,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 255 [2022-12-13 20:56:29,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:30,161 INFO L130 PetriNetUnfolder]: 1140/1838 cut-off events. [2022-12-13 20:56:30,161 INFO L131 PetriNetUnfolder]: For 3875/3875 co-relation queries the response was YES. [2022-12-13 20:56:30,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 1838 events. 1140/1838 cut-off events. For 3875/3875 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8305 event pairs, 194 based on Foata normal form. 1/1839 useless extension candidates. Maximal degree in co-relation 7083. Up to 795 conditions per place. [2022-12-13 20:56:30,166 INFO L137 encePairwiseOnDemand]: 244/255 looper letters, 60 selfloop transitions, 10 changer transitions 69/139 dead transitions. [2022-12-13 20:56:30,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 139 transitions, 1097 flow [2022-12-13 20:56:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:56:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 20:56:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1029 transitions. [2022-12-13 20:56:30,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44836601307189544 [2022-12-13 20:56:30,168 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1029 transitions. [2022-12-13 20:56:30,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1029 transitions. [2022-12-13 20:56:30,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:30,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1029 transitions. [2022-12-13 20:56:30,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.33333333333333) internal successors, (1029), 9 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:30,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:30,171 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:30,171 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 270 flow. Second operand 9 states and 1029 transitions. [2022-12-13 20:56:30,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 139 transitions, 1097 flow [2022-12-13 20:56:30,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 139 transitions, 862 flow, removed 41 selfloop flow, removed 18 redundant places. [2022-12-13 20:56:30,185 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 235 flow [2022-12-13 20:56:30,185 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2022-12-13 20:56:30,186 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2022-12-13 20:56:30,186 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 235 flow [2022-12-13 20:56:30,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:30,186 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:30,186 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:30,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:56:30,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1693972410, now seen corresponding path program 2 times [2022-12-13 20:56:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:30,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885563609] [2022-12-13 20:56:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:30,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:30,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885563609] [2022-12-13 20:56:30,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885563609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:30,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:30,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:56:30,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299415070] [2022-12-13 20:56:30,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:30,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:56:30,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:56:30,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:56:30,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-12-13 20:56:30,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 235 flow. Second operand has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:30,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:30,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-12-13 20:56:30,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:31,279 INFO L130 PetriNetUnfolder]: 636/1077 cut-off events. [2022-12-13 20:56:31,279 INFO L131 PetriNetUnfolder]: For 1519/1531 co-relation queries the response was YES. [2022-12-13 20:56:31,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 1077 events. 636/1077 cut-off events. For 1519/1531 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4561 event pairs, 98 based on Foata normal form. 1/1076 useless extension candidates. Maximal degree in co-relation 3872. Up to 564 conditions per place. [2022-12-13 20:56:31,283 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 50 selfloop transitions, 6 changer transitions 41/100 dead transitions. [2022-12-13 20:56:31,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 691 flow [2022-12-13 20:56:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:56:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:56:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2022-12-13 20:56:31,285 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4946778711484594 [2022-12-13 20:56:31,285 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2022-12-13 20:56:31,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2022-12-13 20:56:31,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:31,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2022-12-13 20:56:31,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:31,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:31,288 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:31,288 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 235 flow. Second operand 7 states and 883 transitions. [2022-12-13 20:56:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 691 flow [2022-12-13 20:56:31,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 677 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 20:56:31,295 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 266 flow [2022-12-13 20:56:31,295 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2022-12-13 20:56:31,295 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2022-12-13 20:56:31,296 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 266 flow [2022-12-13 20:56:31,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:31,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:31,296 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:31,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:56:31,296 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1796593802, now seen corresponding path program 3 times [2022-12-13 20:56:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:31,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438502610] [2022-12-13 20:56:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:56:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:56:32,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:56:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438502610] [2022-12-13 20:56:32,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438502610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:56:32,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:56:32,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:56:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398394077] [2022-12-13 20:56:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:56:32,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:56:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:56:32,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:56:32,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:56:32,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-12-13 20:56:32,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 266 flow. Second operand has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:32,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:56:32,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-12-13 20:56:32,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:56:32,558 INFO L130 PetriNetUnfolder]: 496/869 cut-off events. [2022-12-13 20:56:32,558 INFO L131 PetriNetUnfolder]: For 1394/1394 co-relation queries the response was YES. [2022-12-13 20:56:32,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 869 events. 496/869 cut-off events. For 1394/1394 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3580 event pairs, 30 based on Foata normal form. 1/870 useless extension candidates. Maximal degree in co-relation 3245. Up to 284 conditions per place. [2022-12-13 20:56:32,561 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 89 selfloop transitions, 7 changer transitions 27/126 dead transitions. [2022-12-13 20:56:32,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 126 transitions, 900 flow [2022-12-13 20:56:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:56:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 20:56:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1127 transitions. [2022-12-13 20:56:32,563 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49106753812636167 [2022-12-13 20:56:32,563 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1127 transitions. [2022-12-13 20:56:32,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1127 transitions. [2022-12-13 20:56:32,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:56:32,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1127 transitions. [2022-12-13 20:56:32,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.22222222222223) internal successors, (1127), 9 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:32,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:32,566 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:32,566 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 266 flow. Second operand 9 states and 1127 transitions. [2022-12-13 20:56:32,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 126 transitions, 900 flow [2022-12-13 20:56:32,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 126 transitions, 858 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-13 20:56:32,571 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 276 flow [2022-12-13 20:56:32,571 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=276, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2022-12-13 20:56:32,572 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2022-12-13 20:56:32,572 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 276 flow [2022-12-13 20:56:32,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:56:32,572 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:56:32,572 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:32,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:56:32,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 20:56:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:56:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1006396296, now seen corresponding path program 4 times [2022-12-13 20:56:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:56:32,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007486125] [2022-12-13 20:56:32,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:56:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:56:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:56:32,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:56:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:56:32,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:56:32,654 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:56:32,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 20:56:32,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 20:56:32,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 20:56:32,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 20:56:32,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 20:56:32,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 20:56:32,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 20:56:32,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 20:56:32,657 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:56:32,661 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 20:56:32,661 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:56:32,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:56:32 BasicIcfg [2022-12-13 20:56:32,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:56:32,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:56:32,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:56:32,714 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:56:32,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:55:57" (3/4) ... [2022-12-13 20:56:32,716 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:56:32,793 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:56:32,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:56:32,794 INFO L158 Benchmark]: Toolchain (without parser) took 36682.34ms. Allocated memory was 123.7MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 86.9MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 680.5MB. Max. memory is 16.1GB. [2022-12-13 20:56:32,794 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 123.7MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:56:32,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.51ms. Allocated memory is still 123.7MB. Free memory was 86.9MB in the beginning and 58.4MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 20:56:32,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.87ms. Allocated memory is still 123.7MB. Free memory was 58.4MB in the beginning and 55.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:56:32,795 INFO L158 Benchmark]: Boogie Preprocessor took 32.61ms. Allocated memory is still 123.7MB. Free memory was 55.9MB in the beginning and 53.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:56:32,795 INFO L158 Benchmark]: RCFGBuilder took 562.89ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 53.8MB in the beginning and 87.0MB in the end (delta: -33.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-12-13 20:56:32,795 INFO L158 Benchmark]: TraceAbstraction took 35490.82ms. Allocated memory was 148.9MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 85.9MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 635.9MB. Max. memory is 16.1GB. [2022-12-13 20:56:32,796 INFO L158 Benchmark]: Witness Printer took 78.95ms. Allocated memory is still 3.5GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 20:56:32,797 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.20ms. Allocated memory is still 123.7MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.51ms. Allocated memory is still 123.7MB. Free memory was 86.9MB in the beginning and 58.4MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.87ms. Allocated memory is still 123.7MB. Free memory was 58.4MB in the beginning and 55.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.61ms. Allocated memory is still 123.7MB. Free memory was 55.9MB in the beginning and 53.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.89ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 53.8MB in the beginning and 87.0MB in the end (delta: -33.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 35490.82ms. Allocated memory was 148.9MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 85.9MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 635.9MB. Max. memory is 16.1GB. * Witness Printer took 78.95ms. Allocated memory is still 3.5GB. Free memory was 2.8GB in the beginning and 2.8GB 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: 3.3s, 146 PlacesBefore, 45 PlacesAfterwards, 135 TransitionsBefore, 33 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 10158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4750, independent: 4495, independent conditional: 0, independent unconditional: 4495, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1894, independent: 1851, independent conditional: 0, independent unconditional: 1851, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4750, independent: 2644, independent conditional: 0, independent unconditional: 2644, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 1894, unknown conditional: 0, unknown unconditional: 1894] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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_p2_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 b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1057; [L870] FCALL, FORK 0 pthread_create(&t1057, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1057, ((void *)0), P0, ((void *)0))=-2, t1057={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1058; [L872] FCALL, FORK 0 pthread_create(&t1058, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1058, ((void *)0), P1, ((void *)0))=-1, t1057={5:0}, t1058={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1059; [L874] FCALL, FORK 0 pthread_create(&t1059, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1059, ((void *)0), P2, ((void *)0))=0, t1057={5:0}, t1058={6:0}, t1059={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1060; [L876] FCALL, FORK 0 pthread_create(&t1060, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1060, ((void *)0), P3, ((void *)0))=1, t1057={5:0}, t1058={6:0}, t1059={7:0}, t1060={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L802] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L822] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_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}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1057={5:0}, t1058={6:0}, t1059={7:0}, t1060={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] - 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: 874]: 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: 876]: 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: 872]: 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: 870]: 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: 35.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1008 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 859 mSDsluCounter, 545 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 483 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2644 IncrementalHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 62 mSDtfsCounter, 2644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 2209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-12-13 20:56:32,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0157f59-35ff-4c3b-848c-8a339c93982d/bin/uautomizer-uyxdKDjOR8/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