./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:58:13,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:58:13,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:58:13,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:58:13,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:58:13,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:58:13,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:58:13,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:58:13,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:58:13,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:58:13,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:58:13,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:58:13,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:58:13,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:58:13,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:58:13,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:58:13,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:58:13,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:58:13,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:58:13,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:58:13,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:58:13,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:58:13,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:58:13,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:58:13,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:58:13,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:58:13,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:58:13,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:58:13,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:58:13,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:58:13,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:58:13,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:58:13,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:58:13,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:58:13,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:58:13,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:58:13,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:58:13,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:58:13,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:58:13,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:58:13,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:58:13,330 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:58:13,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:58:13,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:58:13,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:58:13,377 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:58:13,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:58:13,378 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:58:13,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:58:13,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:58:13,379 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:58:13,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:58:13,381 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:58:13,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:58:13,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:58:13,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:58:13,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:58:13,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:58:13,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:58:13,383 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:58:13,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:58:13,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:58:13,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:58:13,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:58:13,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:58:13,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:58:13,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:58:13,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:58:13,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:58:13,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:58:13,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:58:13,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:58:13,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:58:13,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:58:13,387 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:58:13,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:58:13,387 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_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381 [2022-11-25 17:58:13,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:58:13,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:58:13,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:58:13,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:58:13,807 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:58:13,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2022-11-25 17:58:17,107 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:58:17,475 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:58:17,475 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i [2022-11-25 17:58:17,493 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/data/8bc6bdef0/2813772e43de4d7787c5afe0e71065cb/FLAG280dde92c [2022-11-25 17:58:17,523 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/data/8bc6bdef0/2813772e43de4d7787c5afe0e71065cb [2022-11-25 17:58:17,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:58:17,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:58:17,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:58:17,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:58:17,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:58:17,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:17" (1/1) ... [2022-11-25 17:58:17,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc8e5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17, skipping insertion in model container [2022-11-25 17:58:17,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:17" (1/1) ... [2022-11-25 17:58:17,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:58:17,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:58:17,790 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_7e07678f-a526-4e51-9e10-b8e2b274da7a/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i[987,1000] [2022-11-25 17:58:17,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:17,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:17,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:58:18,023 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:58:18,036 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_7e07678f-a526-4e51-9e10-b8e2b274da7a/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i[987,1000] [2022-11-25 17:58:18,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:58:18,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:58:18,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:58:18,198 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:58:18,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18 WrapperNode [2022-11-25 17:58:18,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:58:18,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:58:18,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:58:18,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:58:18,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,283 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-11-25 17:58:18,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:58:18,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:58:18,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:58:18,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:58:18,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,351 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:58:18,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:58:18,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:58:18,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:58:18,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (1/1) ... [2022-11-25 17:58:18,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:58:18,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:58:18,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:58:18,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:58:18,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:58:18,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:58:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:58:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:58:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:58:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:58:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:58:18,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:58:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:58:18,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:58:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:58:18,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:58:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:58:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:58:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:58:18,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:58:18,458 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:58:18,609 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:58:18,611 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:58:19,238 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:58:19,493 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:58:19,494 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:58:19,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:19 BoogieIcfgContainer [2022-11-25 17:58:19,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:58:19,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:58:19,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:58:19,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:58:19,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:58:17" (1/3) ... [2022-11-25 17:58:19,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ef0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:19, skipping insertion in model container [2022-11-25 17:58:19,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:18" (2/3) ... [2022-11-25 17:58:19,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ef0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:19, skipping insertion in model container [2022-11-25 17:58:19,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:19" (3/3) ... [2022-11-25 17:58:19,509 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2022-11-25 17:58:19,519 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:58:19,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:58:19,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:58:19,528 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:58:19,587 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:58:19,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-11-25 17:58:19,697 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-11-25 17:58:19,697 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:58:19,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-11-25 17:58:19,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 131 transitions, 277 flow [2022-11-25 17:58:19,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 114 transitions, 237 flow [2022-11-25 17:58:19,711 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:58:19,725 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 114 transitions, 237 flow [2022-11-25 17:58:19,728 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 114 transitions, 237 flow [2022-11-25 17:58:19,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 114 transitions, 237 flow [2022-11-25 17:58:19,762 INFO L130 PetriNetUnfolder]: 1/114 cut-off events. [2022-11-25 17:58:19,762 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:58:19,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 1/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-25 17:58:19,765 INFO L119 LiptonReduction]: Number of co-enabled transitions 1228 [2022-11-25 17:58:29,902 INFO L134 LiptonReduction]: Checked pairs total: 2820 [2022-11-25 17:58:29,902 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-11-25 17:58:29,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:58:29,927 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;@446bbe9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:58:29,927 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 17:58:29,936 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-11-25 17:58:29,936 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:58:29,936 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:58:29,937 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:29,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 17:58:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -674232024, now seen corresponding path program 1 times [2022-11-25 17:58:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:29,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653971596] [2022-11-25 17:58:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:58:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:30,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653971596] [2022-11-25 17:58:30,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653971596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:30,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:30,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:58:30,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099676640] [2022-11-25 17:58:30,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:30,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:30,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:30,837 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 229 [2022-11-25 17:58:30,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 47 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:30,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:58:30,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 229 [2022-11-25 17:58:30,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:58:31,136 INFO L130 PetriNetUnfolder]: 367/634 cut-off events. [2022-11-25 17:58:31,136 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-25 17:58:31,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 634 events. 367/634 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2956 event pairs, 79 based on Foata normal form. 16/649 useless extension candidates. Maximal degree in co-relation 1234. Up to 453 conditions per place. [2022-11-25 17:58:31,147 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 27 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-11-25 17:58:31,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 135 flow [2022-11-25 17:58:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:58:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2022-11-25 17:58:31,170 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5676855895196506 [2022-11-25 17:58:31,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2022-11-25 17:58:31,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2022-11-25 17:58:31,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:58:31,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2022-11-25 17:58:31,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,191 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states and 390 transitions. [2022-11-25 17:58:31,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 135 flow [2022-11-25 17:58:31,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:58:31,199 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-11-25 17:58:31,201 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-11-25 17:58:31,209 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-11-25 17:58:31,210 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-11-25 17:58:31,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,211 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:58:31,211 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:31,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:58:31,212 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 17:58:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash 573643050, now seen corresponding path program 1 times [2022-11-25 17:58:31,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:31,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620591335] [2022-11-25 17:58:31,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:58:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:31,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620591335] [2022-11-25 17:58:31,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620591335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:31,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:31,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:58:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649726834] [2022-11-25 17:58:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:31,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:31,581 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 229 [2022-11-25 17:58:31,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:58:31,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 229 [2022-11-25 17:58:31,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:58:31,879 INFO L130 PetriNetUnfolder]: 516/849 cut-off events. [2022-11-25 17:58:31,879 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-11-25 17:58:31,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 849 events. 516/849 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3715 event pairs, 117 based on Foata normal form. 4/853 useless extension candidates. Maximal degree in co-relation 1838. Up to 734 conditions per place. [2022-11-25 17:58:31,890 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-11-25 17:58:31,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 143 flow [2022-11-25 17:58:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:58:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-11-25 17:58:31,898 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5560407569141194 [2022-11-25 17:58:31,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-11-25 17:58:31,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-11-25 17:58:31,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:58:31,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-11-25 17:58:31,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,909 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 382 transitions. [2022-11-25 17:58:31,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 143 flow [2022-11-25 17:58:31,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:58:31,912 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 67 flow [2022-11-25 17:58:31,912 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-11-25 17:58:31,913 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-11-25 17:58:31,914 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 67 flow [2022-11-25 17:58:31,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:31,915 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:58:31,915 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:31,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:58:31,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 17:58:31,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1102562792, now seen corresponding path program 1 times [2022-11-25 17:58:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:31,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845855546] [2022-11-25 17:58:31,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:31,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:58:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:32,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845855546] [2022-11-25 17:58:32,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845855546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:32,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:32,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:58:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849843330] [2022-11-25 17:58:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:32,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:32,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:32,258 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 229 [2022-11-25 17:58:32,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:32,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:58:32,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 229 [2022-11-25 17:58:32,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:58:32,532 INFO L130 PetriNetUnfolder]: 541/851 cut-off events. [2022-11-25 17:58:32,532 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-11-25 17:58:32,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 851 events. 541/851 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3474 event pairs, 176 based on Foata normal form. 20/870 useless extension candidates. Maximal degree in co-relation 1971. Up to 580 conditions per place. [2022-11-25 17:58:32,544 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-11-25 17:58:32,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 144 flow [2022-11-25 17:58:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:58:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-11-25 17:58:32,547 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5560407569141194 [2022-11-25 17:58:32,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-11-25 17:58:32,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-11-25 17:58:32,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:58:32,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-11-25 17:58:32,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:32,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:32,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:32,552 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 67 flow. Second operand 3 states and 382 transitions. [2022-11-25 17:58:32,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 144 flow [2022-11-25 17:58:32,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:58:32,555 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 72 flow [2022-11-25 17:58:32,555 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-11-25 17:58:32,558 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-11-25 17:58:32,558 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 72 flow [2022-11-25 17:58:32,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:32,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:58:32,559 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:32,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:58:32,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 17:58:32,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash 839910988, now seen corresponding path program 1 times [2022-11-25 17:58:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:32,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429376725] [2022-11-25 17:58:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:58:34,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:34,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429376725] [2022-11-25 17:58:34,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429376725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:34,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:34,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:58:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236353016] [2022-11-25 17:58:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:34,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:58:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:34,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:58:34,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:58:34,197 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 229 [2022-11-25 17:58:34,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:34,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:58:34,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 229 [2022-11-25 17:58:34,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:58:34,575 INFO L130 PetriNetUnfolder]: 419/682 cut-off events. [2022-11-25 17:58:34,575 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-11-25 17:58:34,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 682 events. 419/682 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2916 event pairs, 45 based on Foata normal form. 9/690 useless extension candidates. Maximal degree in co-relation 1603. Up to 478 conditions per place. [2022-11-25 17:58:34,581 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 32 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2022-11-25 17:58:34,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 191 flow [2022-11-25 17:58:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:58:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:58:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2022-11-25 17:58:34,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5185589519650655 [2022-11-25 17:58:34,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2022-11-25 17:58:34,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2022-11-25 17:58:34,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:58:34,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2022-11-25 17:58:34,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:34,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:34,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:34,590 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 72 flow. Second operand 4 states and 475 transitions. [2022-11-25 17:58:34,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 191 flow [2022-11-25 17:58:34,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 187 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:58:34,595 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 90 flow [2022-11-25 17:58:34,595 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-11-25 17:58:34,597 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-11-25 17:58:34,597 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 90 flow [2022-11-25 17:58:34,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:34,598 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:58:34,598 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:34,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:58:34,598 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 17:58:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash -810649770, now seen corresponding path program 1 times [2022-11-25 17:58:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:34,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808845889] [2022-11-25 17:58:34,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:58:34,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:34,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808845889] [2022-11-25 17:58:34,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808845889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:34,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:34,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:34,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803650250] [2022-11-25 17:58:34,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:34,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:58:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:58:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:58:34,899 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 229 [2022-11-25 17:58:34,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:34,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:58:34,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 229 [2022-11-25 17:58:34,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:58:35,187 INFO L130 PetriNetUnfolder]: 343/599 cut-off events. [2022-11-25 17:58:35,188 INFO L131 PetriNetUnfolder]: For 321/322 co-relation queries the response was YES. [2022-11-25 17:58:35,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 599 events. 343/599 cut-off events. For 321/322 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2683 event pairs, 66 based on Foata normal form. 60/655 useless extension candidates. Maximal degree in co-relation 1580. Up to 351 conditions per place. [2022-11-25 17:58:35,192 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 47 selfloop transitions, 7 changer transitions 4/61 dead transitions. [2022-11-25 17:58:35,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 61 transitions, 340 flow [2022-11-25 17:58:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:58:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:58:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2022-11-25 17:58:35,196 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5441048034934498 [2022-11-25 17:58:35,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2022-11-25 17:58:35,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2022-11-25 17:58:35,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:58:35,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2022-11-25 17:58:35,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,203 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,204 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 90 flow. Second operand 5 states and 623 transitions. [2022-11-25 17:58:35,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 61 transitions, 340 flow [2022-11-25 17:58:35,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 331 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:58:35,207 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 141 flow [2022-11-25 17:58:35,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-11-25 17:58:35,208 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-11-25 17:58:35,209 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 141 flow [2022-11-25 17:58:35,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:58:35,210 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:35,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:58:35,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 17:58:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1591983357, now seen corresponding path program 1 times [2022-11-25 17:58:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:35,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088888378] [2022-11-25 17:58:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:58:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:35,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088888378] [2022-11-25 17:58:35,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088888378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:35,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:35,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:58:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307808085] [2022-11-25 17:58:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:35,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:58:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:35,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:58:35,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:58:35,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 229 [2022-11-25 17:58:35,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:58:35,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 229 [2022-11-25 17:58:35,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:58:35,818 INFO L130 PetriNetUnfolder]: 251/470 cut-off events. [2022-11-25 17:58:35,818 INFO L131 PetriNetUnfolder]: For 414/415 co-relation queries the response was YES. [2022-11-25 17:58:35,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 470 events. 251/470 cut-off events. For 414/415 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2121 event pairs, 37 based on Foata normal form. 36/502 useless extension candidates. Maximal degree in co-relation 1561. Up to 171 conditions per place. [2022-11-25 17:58:35,822 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 53 selfloop transitions, 13 changer transitions 10/79 dead transitions. [2022-11-25 17:58:35,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 79 transitions, 499 flow [2022-11-25 17:58:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:58:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:58:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2022-11-25 17:58:35,827 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5433562071116657 [2022-11-25 17:58:35,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2022-11-25 17:58:35,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2022-11-25 17:58:35,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:58:35,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2022-11-25 17:58:35,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,835 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,835 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 141 flow. Second operand 7 states and 871 transitions. [2022-11-25 17:58:35,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 79 transitions, 499 flow [2022-11-25 17:58:35,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:58:35,844 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 225 flow [2022-11-25 17:58:35,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-11-25 17:58:35,846 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2022-11-25 17:58:35,847 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 225 flow [2022-11-25 17:58:35,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:35,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:58:35,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:35,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:58:35,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 17:58:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1297286448, now seen corresponding path program 1 times [2022-11-25 17:58:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:35,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24220868] [2022-11-25 17:58:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:58:36,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:36,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24220868] [2022-11-25 17:58:36,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24220868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:36,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:36,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:58:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513265164] [2022-11-25 17:58:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:36,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:58:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:58:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:58:36,298 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 229 [2022-11-25 17:58:36,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:36,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:58:36,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 229 [2022-11-25 17:58:36,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:58:36,616 INFO L130 PetriNetUnfolder]: 222/421 cut-off events. [2022-11-25 17:58:36,616 INFO L131 PetriNetUnfolder]: For 707/708 co-relation queries the response was YES. [2022-11-25 17:58:36,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1592 conditions, 421 events. 222/421 cut-off events. For 707/708 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1907 event pairs, 34 based on Foata normal form. 10/427 useless extension candidates. Maximal degree in co-relation 1568. Up to 149 conditions per place. [2022-11-25 17:58:36,620 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 50 selfloop transitions, 17 changer transitions 9/79 dead transitions. [2022-11-25 17:58:36,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 557 flow [2022-11-25 17:58:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:58:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:58:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2022-11-25 17:58:36,624 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5342066957787481 [2022-11-25 17:58:36,624 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2022-11-25 17:58:36,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2022-11-25 17:58:36,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:58:36,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2022-11-25 17:58:36,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:36,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:36,632 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:36,633 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 225 flow. Second operand 9 states and 1101 transitions. [2022-11-25 17:58:36,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 557 flow [2022-11-25 17:58:36,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 496 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-11-25 17:58:36,641 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 236 flow [2022-11-25 17:58:36,641 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2022-11-25 17:58:36,642 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2022-11-25 17:58:36,642 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 236 flow [2022-11-25 17:58:36,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:58:36,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:58:36,643 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:36,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:58:36,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-25 17:58:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1003470320, now seen corresponding path program 1 times [2022-11-25 17:58:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:36,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437494775] [2022-11-25 17:58:36,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:58:36,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:58:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:58:36,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:58:36,838 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:58:36,839 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-25 17:58:36,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-25 17:58:36,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-25 17:58:36,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-25 17:58:36,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:58:36,843 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:36,849 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:58:36,850 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:58:36,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:58:36 BasicIcfg [2022-11-25 17:58:36,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:58:36,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:58:36,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:58:36,937 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:58:36,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:19" (3/4) ... [2022-11-25 17:58:36,940 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:58:37,040 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:58:37,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:58:37,042 INFO L158 Benchmark]: Toolchain (without parser) took 19512.59ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 151.3MB in the beginning and 123.2MB in the end (delta: 28.1MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2022-11-25 17:58:37,042 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:58:37,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.44ms. Allocated memory is still 184.5MB. Free memory was 150.8MB in the beginning and 124.1MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:58:37,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.93ms. Allocated memory is still 184.5MB. Free memory was 124.1MB in the beginning and 121.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:58:37,043 INFO L158 Benchmark]: Boogie Preprocessor took 72.19ms. Allocated memory is still 184.5MB. Free memory was 121.5MB in the beginning and 119.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:58:37,044 INFO L158 Benchmark]: RCFGBuilder took 1139.68ms. Allocated memory is still 184.5MB. Free memory was 119.4MB in the beginning and 111.8MB in the end (delta: 7.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-11-25 17:58:37,044 INFO L158 Benchmark]: TraceAbstraction took 17435.64ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 110.7MB in the beginning and 137.9MB in the end (delta: -27.1MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2022-11-25 17:58:37,045 INFO L158 Benchmark]: Witness Printer took 103.87ms. Allocated memory is still 268.4MB. Free memory was 137.9MB in the beginning and 123.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 17:58:37,047 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.31ms. Allocated memory is still 134.2MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 665.44ms. Allocated memory is still 184.5MB. Free memory was 150.8MB in the beginning and 124.1MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.93ms. Allocated memory is still 184.5MB. Free memory was 124.1MB in the beginning and 121.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.19ms. Allocated memory is still 184.5MB. Free memory was 121.5MB in the beginning and 119.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1139.68ms. Allocated memory is still 184.5MB. Free memory was 119.4MB in the beginning and 111.8MB in the end (delta: 7.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17435.64ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 110.7MB in the beginning and 137.9MB in the end (delta: -27.1MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * Witness Printer took 103.87ms. Allocated memory is still 268.4MB. Free memory was 137.9MB in the beginning and 123.2MB 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: 10.2s, 123 PlacesBefore, 29 PlacesAfterwards, 114 TransitionsBefore, 19 TransitionsAfterwards, 1228 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 2820 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1250, independent: 1105, independent conditional: 0, independent unconditional: 1105, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 788, independent: 740, independent conditional: 0, independent unconditional: 740, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 788, independent: 730, independent conditional: 0, independent unconditional: 730, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 768, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 733, dependent conditional: 0, dependent unconditional: 733, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 365, independent conditional: 0, independent unconditional: 365, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 788, unknown conditional: 0, unknown unconditional: 788] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1693; [L848] FCALL, FORK 0 pthread_create(&t1693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1693, ((void *)0), P0, ((void *)0))=-2, t1693={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t1694; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 \read(x) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t1694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1694, ((void *)0), P1, ((void *)0))=-1, t1693={7:0}, t1694={8:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t1695; [L779] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] EXPR 2 \read(x) [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L852] FCALL, FORK 0 pthread_create(&t1695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1695, ((void *)0), P2, ((void *)0))=0, t1693={7:0}, t1694={8:0}, t1695={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L822] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 2 return 0; [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L856] RET 0 assume_abort_if_not(main$tmp_guard0) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 \read(x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693={7:0}, t1694={8:0}, t1695={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 848]: 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: 852]: 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: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 4 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: 17.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 14 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=7, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:58:37,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e07678f-a526-4e51-9e10-b8e2b274da7a/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE