./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040.opt.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_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/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_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/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_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/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 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e --- 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 22:11:42,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:11:42,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:11:42,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:11:42,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:11:42,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:11:42,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:11:42,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:11:42,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:11:42,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:11:42,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:11:42,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:11:42,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:11:42,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:11:42,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:11:42,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:11:42,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:11:42,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:11:42,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:11:42,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:11:42,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:11:42,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:11:42,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:11:42,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:11:42,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:11:42,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:11:42,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:11:42,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:11:42,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:11:42,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:11:42,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:11:42,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:11:42,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:11:42,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:11:42,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:11:42,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:11:42,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:11:42,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:11:42,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:11:42,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:11:42,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:11:42,210 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 22:11:42,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:11:42,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:11:42,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:11:42,225 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:11:42,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:11:42,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:11:42,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:11:42,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:11:42,226 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:11:42,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:11:42,227 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:11:42,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:11:42,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:11:42,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:11:42,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:11:42,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:11:42,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:11:42,228 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:11:42,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:11:42,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:11:42,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:11:42,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:11:42,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:11:42,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:11:42,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:11:42,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:11:42,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:11:42,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:11:42,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:11:42,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:11:42,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:11:42,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:11:42,230 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:11:42,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:11:42,231 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:11:42,231 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_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/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_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/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 -> 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e [2022-12-13 22:11:42,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:11:42,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:11:42,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:11:42,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:11:42,419 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:11:42,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix040.opt.i [2022-12-13 22:11:45,079 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:11:45,235 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:11:45,236 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/sv-benchmarks/c/pthread-wmm/mix040.opt.i [2022-12-13 22:11:45,244 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/data/9fd1ff932/f07c241af0624bd3a39b1ec9ae0e8b2e/FLAG0426c185b [2022-12-13 22:11:45,255 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/data/9fd1ff932/f07c241af0624bd3a39b1ec9ae0e8b2e [2022-12-13 22:11:45,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:11:45,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:11:45,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:11:45,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:11:45,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:11:45,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452a5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45, skipping insertion in model container [2022-12-13 22:11:45,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:11:45,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:11:45,411 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_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2022-12-13 22:11:45,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:11:45,544 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:11:45,553 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_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2022-12-13 22:11:45,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:11:45,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:11:45,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:11:45,608 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:11:45,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45 WrapperNode [2022-12-13 22:11:45,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:11:45,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:11:45,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:11:45,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:11:45,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,651 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-12-13 22:11:45,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:11:45,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:11:45,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:11:45,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:11:45,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,669 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:11:45,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:11:45,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:11:45,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:11:45,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (1/1) ... [2022-12-13 22:11:45,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:11:45,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:11:45,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:11:45,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:11:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:11:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 22:11:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:11:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:11:45,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:11:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 22:11:45,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 22:11:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 22:11:45,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 22:11:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 22:11:45,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 22:11:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 22:11:45,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 22:11:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:11:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 22:11:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:11:45,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:11:45,727 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 22:11:45,821 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:11:45,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:11:46,048 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:11:46,155 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:11:46,155 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:11:46,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:11:46 BoogieIcfgContainer [2022-12-13 22:11:46,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:11:46,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:11:46,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:11:46,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:11:46,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:11:45" (1/3) ... [2022-12-13 22:11:46,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238e36b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:11:46, skipping insertion in model container [2022-12-13 22:11:46,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:11:45" (2/3) ... [2022-12-13 22:11:46,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238e36b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:11:46, skipping insertion in model container [2022-12-13 22:11:46,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:11:46" (3/3) ... [2022-12-13 22:11:46,166 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2022-12-13 22:11:46,175 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 22:11:46,184 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:11:46,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 22:11:46,185 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:11:46,248 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 22:11:46,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-12-13 22:11:46,326 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 22:11:46,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:11:46,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 22:11:46,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-12-13 22:11:46,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-12-13 22:11:46,336 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:11:46,343 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2022-12-13 22:11:46,345 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2022-12-13 22:11:46,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2022-12-13 22:11:46,365 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 22:11:46,365 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:11:46,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 22:11:46,367 INFO L119 LiptonReduction]: Number of co-enabled transitions 3040 [2022-12-13 22:11:49,375 INFO L134 LiptonReduction]: Checked pairs total: 7126 [2022-12-13 22:11:49,375 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-12-13 22:11:49,386 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:11:49,390 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;@81ece10, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:11:49,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 22:11:49,393 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 22:11:49,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:11:49,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:49,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:49,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1403029215, now seen corresponding path program 1 times [2022-12-13 22:11:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485348541] [2022-12-13 22:11:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:49,765 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 22:11:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485348541] [2022-12-13 22:11:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485348541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:49,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:49,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:11:49,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511595031] [2022-12-13 22:11:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:49,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:11:49,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:49,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:11:49,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:11:49,803 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 254 [2022-12-13 22:11:49,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 22:11:49,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:49,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 254 [2022-12-13 22:11:49,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:50,179 INFO L130 PetriNetUnfolder]: 2075/3257 cut-off events. [2022-12-13 22:11:50,179 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 22:11:50,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6253 conditions, 3257 events. 2075/3257 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 18329 event pairs, 518 based on Foata normal form. 0/3109 useless extension candidates. Maximal degree in co-relation 6241. Up to 2098 conditions per place. [2022-12-13 22:11:50,194 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2022-12-13 22:11:50,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 152 flow [2022-12-13 22:11:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:11:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:11:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2022-12-13 22:11:50,204 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.531496062992126 [2022-12-13 22:11:50,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2022-12-13 22:11:50,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2022-12-13 22:11:50,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:50,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2022-12-13 22:11:50,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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 22:11:50,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:50,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:50,216 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 405 transitions. [2022-12-13 22:11:50,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 152 flow [2022-12-13 22:11:50,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 22:11:50,221 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2022-12-13 22:11:50,222 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-13 22:11:50,224 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-13 22:11:50,225 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2022-12-13 22:11:50,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 22:11:50,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:50,225 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:50,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:11:50,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:50,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash -308566163, now seen corresponding path program 1 times [2022-12-13 22:11:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:50,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153875622] [2022-12-13 22:11:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:50,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 22:11:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:50,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153875622] [2022-12-13 22:11:50,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153875622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:50,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:50,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:11:50,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049012117] [2022-12-13 22:11:50,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:50,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:11:50,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:11:50,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:11:50,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-12-13 22:11:50,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 22:11:50,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:50,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-12-13 22:11:50,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:51,174 INFO L130 PetriNetUnfolder]: 7369/10218 cut-off events. [2022-12-13 22:11:51,174 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-12-13 22:11:51,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21094 conditions, 10218 events. 7369/10218 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 51299 event pairs, 2585 based on Foata normal form. 292/10510 useless extension candidates. Maximal degree in co-relation 21084. Up to 6285 conditions per place. [2022-12-13 22:11:51,234 INFO L137 encePairwiseOnDemand]: 245/254 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2022-12-13 22:11:51,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2022-12-13 22:11:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:11:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:11:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-12-13 22:11:51,237 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.505249343832021 [2022-12-13 22:11:51,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2022-12-13 22:11:51,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2022-12-13 22:11:51,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:51,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2022-12-13 22:11:51,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 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 22:11:51,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:51,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:51,242 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 385 transitions. [2022-12-13 22:11:51,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2022-12-13 22:11:51,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:11:51,252 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 120 flow [2022-12-13 22:11:51,252 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-13 22:11:51,253 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-13 22:11:51,253 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 120 flow [2022-12-13 22:11:51,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 22:11:51,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:51,253 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:51,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:11:51,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash -975618869, now seen corresponding path program 1 times [2022-12-13 22:11:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:51,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807573710] [2022-12-13 22:11:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:51,382 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 22:11:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:51,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807573710] [2022-12-13 22:11:51,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807573710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:51,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:51,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:11:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326195021] [2022-12-13 22:11:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:51,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:11:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:11:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:11:51,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-12-13 22:11:51,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 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 22:11:51,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:51,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-12-13 22:11:51,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:52,273 INFO L130 PetriNetUnfolder]: 7109/9866 cut-off events. [2022-12-13 22:11:52,273 INFO L131 PetriNetUnfolder]: For 3943/3943 co-relation queries the response was YES. [2022-12-13 22:11:52,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26108 conditions, 9866 events. 7109/9866 cut-off events. For 3943/3943 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 50437 event pairs, 655 based on Foata normal form. 40/9906 useless extension candidates. Maximal degree in co-relation 26096. Up to 5657 conditions per place. [2022-12-13 22:11:52,318 INFO L137 encePairwiseOnDemand]: 245/254 looper letters, 54 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2022-12-13 22:11:52,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 362 flow [2022-12-13 22:11:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:11:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:11:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2022-12-13 22:11:52,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5049212598425197 [2022-12-13 22:11:52,321 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2022-12-13 22:11:52,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2022-12-13 22:11:52,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:52,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2022-12-13 22:11:52,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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 22:11:52,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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 22:11:52,324 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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 22:11:52,324 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 120 flow. Second operand 4 states and 513 transitions. [2022-12-13 22:11:52,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 362 flow [2022-12-13 22:11:52,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:11:52,343 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 198 flow [2022-12-13 22:11:52,343 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-13 22:11:52,344 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2022-12-13 22:11:52,344 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 198 flow [2022-12-13 22:11:52,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 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 22:11:52,344 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:52,344 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:52,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:11:52,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:52,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash -975618094, now seen corresponding path program 1 times [2022-12-13 22:11:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:52,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914307861] [2022-12-13 22:11:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:52,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:52,462 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 22:11:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:52,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914307861] [2022-12-13 22:11:52,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914307861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:52,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:52,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:11:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495068023] [2022-12-13 22:11:52,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:52,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:11:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:11:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:11:52,469 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 254 [2022-12-13 22:11:52,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 22:11:52,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:52,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 254 [2022-12-13 22:11:52,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:53,147 INFO L130 PetriNetUnfolder]: 5507/8036 cut-off events. [2022-12-13 22:11:53,147 INFO L131 PetriNetUnfolder]: For 8173/8281 co-relation queries the response was YES. [2022-12-13 22:11:53,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22772 conditions, 8036 events. 5507/8036 cut-off events. For 8173/8281 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 44980 event pairs, 2027 based on Foata normal form. 130/7900 useless extension candidates. Maximal degree in co-relation 22757. Up to 6892 conditions per place. [2022-12-13 22:11:53,174 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 45 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2022-12-13 22:11:53,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 380 flow [2022-12-13 22:11:53,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:11:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:11:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-12-13 22:11:53,176 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5288713910761155 [2022-12-13 22:11:53,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2022-12-13 22:11:53,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2022-12-13 22:11:53,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:53,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2022-12-13 22:11:53,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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 22:11:53,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:53,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:53,178 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 198 flow. Second operand 3 states and 403 transitions. [2022-12-13 22:11:53,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 380 flow [2022-12-13 22:11:53,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:11:53,195 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 256 flow [2022-12-13 22:11:53,196 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-13 22:11:53,196 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2022-12-13 22:11:53,196 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 256 flow [2022-12-13 22:11:53,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 22:11:53,196 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:53,197 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:53,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:11:53,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash -179415500, now seen corresponding path program 1 times [2022-12-13 22:11:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:53,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501835650] [2022-12-13 22:11:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:53,345 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 22:11:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501835650] [2022-12-13 22:11:53,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501835650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:53,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:53,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:11:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007035158] [2022-12-13 22:11:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:53,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:11:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:53,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:11:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:11:53,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-12-13 22:11:53,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 22:11:53,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:53,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-12-13 22:11:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:54,224 INFO L130 PetriNetUnfolder]: 6533/9074 cut-off events. [2022-12-13 22:11:54,224 INFO L131 PetriNetUnfolder]: For 12077/12077 co-relation queries the response was YES. [2022-12-13 22:11:54,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27740 conditions, 9074 events. 6533/9074 cut-off events. For 12077/12077 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 43042 event pairs, 1641 based on Foata normal form. 84/9158 useless extension candidates. Maximal degree in co-relation 27722. Up to 4039 conditions per place. [2022-12-13 22:11:54,260 INFO L137 encePairwiseOnDemand]: 245/254 looper letters, 59 selfloop transitions, 17 changer transitions 0/76 dead transitions. [2022-12-13 22:11:54,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 566 flow [2022-12-13 22:11:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:11:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:11:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2022-12-13 22:11:54,263 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4950787401574803 [2022-12-13 22:11:54,263 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2022-12-13 22:11:54,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2022-12-13 22:11:54,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:54,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2022-12-13 22:11:54,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 22:11:54,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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 22:11:54,267 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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 22:11:54,267 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 256 flow. Second operand 4 states and 503 transitions. [2022-12-13 22:11:54,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 566 flow [2022-12-13 22:11:54,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:11:54,292 INFO L231 Difference]: Finished difference. Result has 50 places, 55 transitions, 424 flow [2022-12-13 22:11:54,293 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=50, PETRI_TRANSITIONS=55} [2022-12-13 22:11:54,293 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2022-12-13 22:11:54,293 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 55 transitions, 424 flow [2022-12-13 22:11:54,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 22:11:54,294 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:54,294 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:54,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:11:54,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1193476915, now seen corresponding path program 1 times [2022-12-13 22:11:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:54,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907575012] [2022-12-13 22:11:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:54,425 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 22:11:54,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:54,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907575012] [2022-12-13 22:11:54,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907575012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:54,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:54,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:11:54,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23404096] [2022-12-13 22:11:54,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:54,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:11:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:54,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:11:54,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:11:54,432 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 254 [2022-12-13 22:11:54,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 22:11:54,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:54,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 254 [2022-12-13 22:11:54,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:55,199 INFO L130 PetriNetUnfolder]: 6590/9530 cut-off events. [2022-12-13 22:11:55,199 INFO L131 PetriNetUnfolder]: For 21495/22008 co-relation queries the response was YES. [2022-12-13 22:11:55,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30282 conditions, 9530 events. 6590/9530 cut-off events. For 21495/22008 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 54136 event pairs, 2578 based on Foata normal form. 314/9267 useless extension candidates. Maximal degree in co-relation 30260. Up to 4985 conditions per place. [2022-12-13 22:11:55,249 INFO L137 encePairwiseOnDemand]: 251/254 looper letters, 46 selfloop transitions, 8 changer transitions 2/71 dead transitions. [2022-12-13 22:11:55,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 592 flow [2022-12-13 22:11:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:11:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:11:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-12-13 22:11:55,250 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.526246719160105 [2022-12-13 22:11:55,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2022-12-13 22:11:55,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2022-12-13 22:11:55,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:55,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2022-12-13 22:11:55,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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 22:11:55,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:55,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:55,253 INFO L175 Difference]: Start difference. First operand has 50 places, 55 transitions, 424 flow. Second operand 3 states and 401 transitions. [2022-12-13 22:11:55,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 592 flow [2022-12-13 22:11:55,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:11:55,306 INFO L231 Difference]: Finished difference. Result has 52 places, 54 transitions, 436 flow [2022-12-13 22:11:55,306 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=52, PETRI_TRANSITIONS=54} [2022-12-13 22:11:55,307 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2022-12-13 22:11:55,307 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 436 flow [2022-12-13 22:11:55,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 22:11:55,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:55,307 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:55,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:11:55,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1937098640, now seen corresponding path program 1 times [2022-12-13 22:11:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:55,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452699734] [2022-12-13 22:11:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:55,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:55,462 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 22:11:55,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:55,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452699734] [2022-12-13 22:11:55,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452699734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:55,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:55,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:11:55,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612288239] [2022-12-13 22:11:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:55,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:11:55,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:55,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:11:55,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:11:55,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2022-12-13 22:11:55,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 436 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:55,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:55,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2022-12-13 22:11:55,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:56,230 INFO L130 PetriNetUnfolder]: 5530/8254 cut-off events. [2022-12-13 22:11:56,230 INFO L131 PetriNetUnfolder]: For 19244/20076 co-relation queries the response was YES. [2022-12-13 22:11:56,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25597 conditions, 8254 events. 5530/8254 cut-off events. For 19244/20076 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 51026 event pairs, 1065 based on Foata normal form. 969/8750 useless extension candidates. Maximal degree in co-relation 25574. Up to 5480 conditions per place. [2022-12-13 22:11:56,254 INFO L137 encePairwiseOnDemand]: 247/254 looper letters, 91 selfloop transitions, 10 changer transitions 7/128 dead transitions. [2022-12-13 22:11:56,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 128 transitions, 1169 flow [2022-12-13 22:11:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:11:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:11:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2022-12-13 22:11:56,256 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5118110236220472 [2022-12-13 22:11:56,256 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2022-12-13 22:11:56,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2022-12-13 22:11:56,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:56,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2022-12-13 22:11:56,258 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 22:11:56,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 22:11:56,261 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 22:11:56,261 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 436 flow. Second operand 5 states and 650 transitions. [2022-12-13 22:11:56,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 128 transitions, 1169 flow [2022-12-13 22:11:56,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 128 transitions, 1144 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 22:11:56,282 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 501 flow [2022-12-13 22:11:56,282 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=501, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2022-12-13 22:11:56,283 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2022-12-13 22:11:56,283 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 501 flow [2022-12-13 22:11:56,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:56,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:56,284 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:56,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:11:56,284 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1012914228, now seen corresponding path program 1 times [2022-12-13 22:11:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890934998] [2022-12-13 22:11:56,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:56,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:56,417 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 22:11:56,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:56,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890934998] [2022-12-13 22:11:56,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890934998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:56,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:56,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:11:56,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840432296] [2022-12-13 22:11:56,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:56,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:11:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:56,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:11:56,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:11:56,422 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 254 [2022-12-13 22:11:56,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 22:11:56,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:56,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 254 [2022-12-13 22:11:56,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:57,447 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L830-->L837: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= (ite .cse0 v_~z$w_buff0~0_37 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_51)) v_~z~0_50) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_51} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][79], [Black: 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 139#L837true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(= ~__unbuffered_cnt~0 0), Black: 162#(<= ~y~0 0), Black: 163#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 63#P2EXITtrue, 186#true, 108#P0EXITtrue, 173#true, Black: 170#(<= ~x~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 183#(= ~y~0 1), 34#L771true, P0Thread1of1ForFork1InUse, Black: 175#(<= ~__unbuffered_p3_EAX~0 0), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P2Thread1of1ForFork0InUse, 160#true, 198#(= ~x~0 1), 82#L872true, Black: 156#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2022-12-13 22:11:57,447 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,447 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,447 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,447 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,458 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L830-->L837: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= (ite .cse0 v_~z$w_buff0~0_37 (ite .cse1 v_~z$w_buff1~0_42 v_~z~0_51)) v_~z~0_50) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= (ite .cse0 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_51} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][79], [139#L837true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(= ~__unbuffered_cnt~0 0), 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 114#P1EXITtrue, Black: 162#(<= ~y~0 0), Black: 163#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 63#P2EXITtrue, 108#P0EXITtrue, 71#L2true, Black: 170#(<= ~x~0 0), 173#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 175#(<= ~__unbuffered_p3_EAX~0 0), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P2Thread1of1ForFork0InUse, 160#true, Black: 183#(= ~y~0 1), 198#(= ~x~0 1), Black: 156#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2022-12-13 22:11:57,458 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,458 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,458 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,458 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,471 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([476] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0][43], [Black: 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 114#P1EXITtrue, Black: 188#(= ~__unbuffered_cnt~0 0), Black: 162#(<= ~y~0 0), Black: 160#true, 63#P2EXITtrue, 186#true, 108#P0EXITtrue, Black: 170#(<= ~x~0 0), 52#L830true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 183#(= ~y~0 1), P0Thread1of1ForFork1InUse, Black: 175#(<= ~__unbuffered_p3_EAX~0 0), Black: 173#true, P2Thread1of1ForFork0InUse, 198#(= ~x~0 1), 82#L872true, 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 154#true, 163#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2022-12-13 22:11:57,471 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,472 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,472 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,472 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:11:57,528 INFO L130 PetriNetUnfolder]: 7427/11388 cut-off events. [2022-12-13 22:11:57,528 INFO L131 PetriNetUnfolder]: For 35563/36297 co-relation queries the response was YES. [2022-12-13 22:11:57,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45954 conditions, 11388 events. 7427/11388 cut-off events. For 35563/36297 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 74963 event pairs, 3043 based on Foata normal form. 397/11221 useless extension candidates. Maximal degree in co-relation 45927. Up to 5402 conditions per place. [2022-12-13 22:11:57,562 INFO L137 encePairwiseOnDemand]: 251/254 looper letters, 56 selfloop transitions, 11 changer transitions 16/93 dead transitions. [2022-12-13 22:11:57,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 837 flow [2022-12-13 22:11:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:11:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:11:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-12-13 22:11:57,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5288713910761155 [2022-12-13 22:11:57,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2022-12-13 22:11:57,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2022-12-13 22:11:57,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:57,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2022-12-13 22:11:57,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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 22:11:57,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:57,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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 22:11:57,566 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 501 flow. Second operand 3 states and 403 transitions. [2022-12-13 22:11:57,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 837 flow [2022-12-13 22:11:57,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 828 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:11:57,602 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 463 flow [2022-12-13 22:11:57,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2022-12-13 22:11:57,603 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2022-12-13 22:11:57,603 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 463 flow [2022-12-13 22:11:57,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 22:11:57,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:57,603 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:57,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:11:57,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1265802580, now seen corresponding path program 1 times [2022-12-13 22:11:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:57,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224253971] [2022-12-13 22:11:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:57,757 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 22:11:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:57,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224253971] [2022-12-13 22:11:57,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224253971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:57,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:57,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:11:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487941880] [2022-12-13 22:11:57,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:57,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:11:57,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:57,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:11:57,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:11:57,774 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2022-12-13 22:11:57,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 463 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:57,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:57,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2022-12-13 22:11:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:58,482 INFO L130 PetriNetUnfolder]: 4147/6550 cut-off events. [2022-12-13 22:11:58,483 INFO L131 PetriNetUnfolder]: For 18858/19997 co-relation queries the response was YES. [2022-12-13 22:11:58,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25630 conditions, 6550 events. 4147/6550 cut-off events. For 18858/19997 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 42257 event pairs, 430 based on Foata normal form. 1021/7346 useless extension candidates. Maximal degree in co-relation 25602. Up to 2851 conditions per place. [2022-12-13 22:11:58,504 INFO L137 encePairwiseOnDemand]: 247/254 looper letters, 114 selfloop transitions, 15 changer transitions 18/163 dead transitions. [2022-12-13 22:11:58,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 163 transitions, 1630 flow [2022-12-13 22:11:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:11:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:11:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2022-12-13 22:11:58,506 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5101237345331834 [2022-12-13 22:11:58,506 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2022-12-13 22:11:58,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2022-12-13 22:11:58,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:58,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2022-12-13 22:11:58,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 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 22:11:58,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 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 22:11:58,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 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 22:11:58,510 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 463 flow. Second operand 7 states and 907 transitions. [2022-12-13 22:11:58,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 163 transitions, 1630 flow [2022-12-13 22:11:58,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 163 transitions, 1562 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 22:11:58,560 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 566 flow [2022-12-13 22:11:58,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=566, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2022-12-13 22:11:58,561 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2022-12-13 22:11:58,561 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 566 flow [2022-12-13 22:11:58,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:58,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:58,561 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 22:11:58,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:11:58,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:58,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash -845587551, now seen corresponding path program 1 times [2022-12-13 22:11:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:58,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412456723] [2022-12-13 22:11:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:58,707 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 22:11:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:58,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412456723] [2022-12-13 22:11:58,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412456723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:58,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:58,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:11:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180167702] [2022-12-13 22:11:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:58,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:11:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:58,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:11:58,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:11:58,721 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2022-12-13 22:11:58,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:58,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:58,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2022-12-13 22:11:58,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:11:59,406 INFO L130 PetriNetUnfolder]: 3640/5827 cut-off events. [2022-12-13 22:11:59,407 INFO L131 PetriNetUnfolder]: For 20605/22362 co-relation queries the response was YES. [2022-12-13 22:11:59,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26752 conditions, 5827 events. 3640/5827 cut-off events. For 20605/22362 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 37696 event pairs, 238 based on Foata normal form. 1016/6649 useless extension candidates. Maximal degree in co-relation 26721. Up to 2618 conditions per place. [2022-12-13 22:11:59,423 INFO L137 encePairwiseOnDemand]: 247/254 looper letters, 113 selfloop transitions, 23 changer transitions 41/192 dead transitions. [2022-12-13 22:11:59,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 192 transitions, 1922 flow [2022-12-13 22:11:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 22:11:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 22:11:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1166 transitions. [2022-12-13 22:11:59,425 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.510061242344707 [2022-12-13 22:11:59,425 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1166 transitions. [2022-12-13 22:11:59,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1166 transitions. [2022-12-13 22:11:59,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:11:59,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1166 transitions. [2022-12-13 22:11:59,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.55555555555554) internal successors, (1166), 9 states have internal predecessors, (1166), 0 states have call successors, (0), 0 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 22:11:59,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 254.0) internal successors, (2540), 10 states have internal predecessors, (2540), 0 states have call successors, (0), 0 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 22:11:59,429 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 254.0) internal successors, (2540), 10 states have internal predecessors, (2540), 0 states have call successors, (0), 0 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 22:11:59,429 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 566 flow. Second operand 9 states and 1166 transitions. [2022-12-13 22:11:59,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 192 transitions, 1922 flow [2022-12-13 22:11:59,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 192 transitions, 1877 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 22:11:59,615 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 671 flow [2022-12-13 22:11:59,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=671, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2022-12-13 22:11:59,616 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2022-12-13 22:11:59,616 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 671 flow [2022-12-13 22:11:59,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:11:59,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:11:59,616 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 22:11:59,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:11:59,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:11:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash -433946981, now seen corresponding path program 1 times [2022-12-13 22:11:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:11:59,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869237426] [2022-12-13 22:11:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:11:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:11:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:11:59,761 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 22:11:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:11:59,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869237426] [2022-12-13 22:11:59,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869237426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:11:59,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:11:59,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:11:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094422292] [2022-12-13 22:11:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:11:59,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:11:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:11:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:11:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:11:59,773 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 254 [2022-12-13 22:11:59,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 671 flow. Second operand has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 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 22:11:59,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:11:59,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 254 [2022-12-13 22:11:59,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:12:00,481 INFO L130 PetriNetUnfolder]: 3430/5545 cut-off events. [2022-12-13 22:12:00,481 INFO L131 PetriNetUnfolder]: For 23102/24193 co-relation queries the response was YES. [2022-12-13 22:12:00,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25873 conditions, 5545 events. 3430/5545 cut-off events. For 23102/24193 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 36465 event pairs, 222 based on Foata normal form. 676/6029 useless extension candidates. Maximal degree in co-relation 25839. Up to 1708 conditions per place. [2022-12-13 22:12:00,495 INFO L137 encePairwiseOnDemand]: 247/254 looper letters, 67 selfloop transitions, 22 changer transitions 92/191 dead transitions. [2022-12-13 22:12:00,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 191 transitions, 1959 flow [2022-12-13 22:12:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 22:12:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 22:12:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1402 transitions. [2022-12-13 22:12:00,497 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5017895490336435 [2022-12-13 22:12:00,497 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1402 transitions. [2022-12-13 22:12:00,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1402 transitions. [2022-12-13 22:12:00,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:12:00,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1402 transitions. [2022-12-13 22:12:00,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.45454545454545) internal successors, (1402), 11 states have internal predecessors, (1402), 0 states have call successors, (0), 0 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 22:12:00,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 254.0) internal successors, (3048), 12 states have internal predecessors, (3048), 0 states have call successors, (0), 0 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 22:12:00,502 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 254.0) internal successors, (3048), 12 states have internal predecessors, (3048), 0 states have call successors, (0), 0 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 22:12:00,502 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 671 flow. Second operand 11 states and 1402 transitions. [2022-12-13 22:12:00,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 191 transitions, 1959 flow [2022-12-13 22:12:00,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 191 transitions, 1850 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-12-13 22:12:00,814 INFO L231 Difference]: Finished difference. Result has 83 places, 52 transitions, 442 flow [2022-12-13 22:12:00,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=442, PETRI_PLACES=83, PETRI_TRANSITIONS=52} [2022-12-13 22:12:00,814 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2022-12-13 22:12:00,814 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 52 transitions, 442 flow [2022-12-13 22:12:00,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 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 22:12:00,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:12:00,815 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 22:12:00,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:12:00,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:12:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:12:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1904246684, now seen corresponding path program 1 times [2022-12-13 22:12:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:12:00,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659125629] [2022-12-13 22:12:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:12:00,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:12:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:12:00,926 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 22:12:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:12:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659125629] [2022-12-13 22:12:00,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659125629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:12:00,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:12:00,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:12:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606334451] [2022-12-13 22:12:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:12:00,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:12:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:12:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:12:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:12:00,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 254 [2022-12-13 22:12:00,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 52 transitions, 442 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:00,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:12:00,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 254 [2022-12-13 22:12:00,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:12:01,112 INFO L130 PetriNetUnfolder]: 636/1150 cut-off events. [2022-12-13 22:12:01,112 INFO L131 PetriNetUnfolder]: For 4802/4848 co-relation queries the response was YES. [2022-12-13 22:12:01,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5369 conditions, 1150 events. 636/1150 cut-off events. For 4802/4848 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5823 event pairs, 120 based on Foata normal form. 29/1154 useless extension candidates. Maximal degree in co-relation 5333. Up to 634 conditions per place. [2022-12-13 22:12:01,115 INFO L137 encePairwiseOnDemand]: 251/254 looper letters, 35 selfloop transitions, 1 changer transitions 54/93 dead transitions. [2022-12-13 22:12:01,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 940 flow [2022-12-13 22:12:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:12:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:12:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2022-12-13 22:12:01,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.515748031496063 [2022-12-13 22:12:01,117 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2022-12-13 22:12:01,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2022-12-13 22:12:01,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:12:01,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2022-12-13 22:12:01,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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 22:12:01,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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 22:12:01,119 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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 22:12:01,119 INFO L175 Difference]: Start difference. First operand has 83 places, 52 transitions, 442 flow. Second operand 4 states and 524 transitions. [2022-12-13 22:12:01,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 940 flow [2022-12-13 22:12:01,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 717 flow, removed 54 selfloop flow, removed 17 redundant places. [2022-12-13 22:12:01,130 INFO L231 Difference]: Finished difference. Result has 68 places, 37 transitions, 209 flow [2022-12-13 22:12:01,130 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2022-12-13 22:12:01,130 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2022-12-13 22:12:01,130 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 37 transitions, 209 flow [2022-12-13 22:12:01,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:12:01,130 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:12:01,131 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 22:12:01,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:12:01,131 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:12:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:12:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1926237556, now seen corresponding path program 2 times [2022-12-13 22:12:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:12:01,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587762714] [2022-12-13 22:12:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:12:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:12:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:12:01,353 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 22:12:01,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:12:01,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587762714] [2022-12-13 22:12:01,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587762714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:12:01,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:12:01,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:12:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186217907] [2022-12-13 22:12:01,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:12:01,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:12:01,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:12:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:12:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:12:01,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 254 [2022-12-13 22:12:01,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 37 transitions, 209 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 22:12:01,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:12:01,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 254 [2022-12-13 22:12:01,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:12:01,470 INFO L130 PetriNetUnfolder]: 115/233 cut-off events. [2022-12-13 22:12:01,471 INFO L131 PetriNetUnfolder]: For 572/577 co-relation queries the response was YES. [2022-12-13 22:12:01,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 233 events. 115/233 cut-off events. For 572/577 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 738 event pairs, 18 based on Foata normal form. 2/233 useless extension candidates. Maximal degree in co-relation 899. Up to 97 conditions per place. [2022-12-13 22:12:01,474 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 35 selfloop transitions, 2 changer transitions 33/74 dead transitions. [2022-12-13 22:12:01,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 571 flow [2022-12-13 22:12:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:12:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:12:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 753 transitions. [2022-12-13 22:12:01,476 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4940944881889764 [2022-12-13 22:12:01,476 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 753 transitions. [2022-12-13 22:12:01,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 753 transitions. [2022-12-13 22:12:01,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:12:01,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 753 transitions. [2022-12-13 22:12:01,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 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 22:12:01,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 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 22:12:01,479 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 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 22:12:01,479 INFO L175 Difference]: Start difference. First operand has 68 places, 37 transitions, 209 flow. Second operand 6 states and 753 transitions. [2022-12-13 22:12:01,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 571 flow [2022-12-13 22:12:01,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 496 flow, removed 12 selfloop flow, removed 14 redundant places. [2022-12-13 22:12:01,481 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 172 flow [2022-12-13 22:12:01,481 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-12-13 22:12:01,481 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2022-12-13 22:12:01,481 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 172 flow [2022-12-13 22:12:01,482 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 22:12:01,482 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:12:01,482 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 22:12:01,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:12:01,482 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 22:12:01,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:12:01,482 INFO L85 PathProgramCache]: Analyzing trace with hash -179708932, now seen corresponding path program 3 times [2022-12-13 22:12:01,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:12:01,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336076473] [2022-12-13 22:12:01,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:12:01,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:12:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:12:01,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:12:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:12:01,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:12:01,550 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:12:01,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 22:12:01,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 22:12:01,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 22:12:01,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 22:12:01,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 22:12:01,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 22:12:01,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 22:12:01,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 22:12:01,553 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:12:01,558 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 22:12:01,558 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:12:01,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:12:01 BasicIcfg [2022-12-13 22:12:01,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:12:01,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:12:01,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:12:01,603 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:12:01,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:11:46" (3/4) ... [2022-12-13 22:12:01,605 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 22:12:01,658 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 22:12:01,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:12:01,658 INFO L158 Benchmark]: Toolchain (without parser) took 16400.49ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 126.4MB in the beginning and 899.1MB in the end (delta: -772.7MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. [2022-12-13 22:12:01,659 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory was 85.8MB in the beginning and 85.6MB in the end (delta: 153.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:12:01,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.28ms. Allocated memory is still 161.5MB. Free memory was 126.4MB in the beginning and 99.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 22:12:01,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.88ms. Allocated memory is still 161.5MB. Free memory was 99.1MB in the beginning and 96.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:12:01,659 INFO L158 Benchmark]: Boogie Preprocessor took 20.41ms. Allocated memory is still 161.5MB. Free memory was 96.3MB in the beginning and 94.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:12:01,659 INFO L158 Benchmark]: RCFGBuilder took 485.17ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 62.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-12-13 22:12:01,660 INFO L158 Benchmark]: TraceAbstraction took 15442.49ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 62.2MB in the beginning and 913.8MB in the end (delta: -851.5MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2022-12-13 22:12:01,660 INFO L158 Benchmark]: Witness Printer took 54.73ms. Allocated memory is still 1.1GB. Free memory was 913.8MB in the beginning and 899.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 22:12:01,661 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.13ms. Allocated memory is still 113.2MB. Free memory was 85.8MB in the beginning and 85.6MB in the end (delta: 153.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.28ms. Allocated memory is still 161.5MB. Free memory was 126.4MB in the beginning and 99.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.88ms. Allocated memory is still 161.5MB. Free memory was 99.1MB in the beginning and 96.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.41ms. Allocated memory is still 161.5MB. Free memory was 96.3MB in the beginning and 94.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 485.17ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 62.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15442.49ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 62.2MB in the beginning and 913.8MB in the end (delta: -851.5MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Witness Printer took 54.73ms. Allocated memory is still 1.1GB. Free memory was 913.8MB in the beginning and 899.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 143 PlacesBefore, 40 PlacesAfterwards, 132 TransitionsBefore, 28 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 7126 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3464, independent: 3265, independent conditional: 0, independent unconditional: 3265, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1699, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3464, independent: 1614, independent conditional: 0, independent unconditional: 1614, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 1699, unknown conditional: 0, unknown unconditional: 1699] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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 main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((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, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1061, ((void *)0), P0, ((void *)0))=9, t1061={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1062, ((void *)0), P1, ((void *)0))=10, t1061={6:0}, t1062={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1063, ((void *)0), P2, ((void *)0))=11, t1061={6:0}, t1062={7:0}, t1063={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((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, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1064, ((void *)0), P3, ((void *)0))=12, t1061={6:0}, t1062={7:0}, t1063={8:0}, t1064={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$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}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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, main$tmp_guard0=1, main$tmp_guard1=0, t1061={6:0}, t1062={7:0}, t1063={8:0}, t1064={5:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_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, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 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: 15.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 612 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 504 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1164 IncrementalHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 44 mSDtfsCounter, 1164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=671occurred in iteration=10, InterpolantAutomatonStates: 65, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 882 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 22:12:01,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29da7e9e-ece2-4d2c-99e5-d34e0d3e461d/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