./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/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_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/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_75ecb7fb-0479-4142-8640-9bb1b684acd3/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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- 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:23:34,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:23:34,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:23:34,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:23:34,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:23:34,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:23:34,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:23:34,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:23:34,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:23:34,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:23:34,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:23:34,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:23:34,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:23:34,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:23:34,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:23:34,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:23:34,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:23:34,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:23:34,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:23:34,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:23:34,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:23:34,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:23:34,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:23:34,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:23:34,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:23:34,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:23:34,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:23:34,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:23:34,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:23:34,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:23:34,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:23:34,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:23:34,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:23:34,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:23:34,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:23:34,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:23:34,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:23:34,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:23:34,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:23:34,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:23:34,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:23:34,936 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:23:34,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:23:34,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:23:34,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:23:34,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:23:34,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:23:34,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:23:34,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:23:34,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:23:34,978 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:23:34,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:23:34,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:23:34,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:23:34,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:23:34,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:23:34,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:23:34,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:23:34,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:23:34,981 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:23:34,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:23:34,982 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:23:34,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:23:34,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:23:34,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:23:34,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:23:34,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:23:34,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:23:34,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:23:34,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:23:34,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:23:34,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:23:34,984 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:23:34,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:23:34,985 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:23:34,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:23:34,985 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_75ecb7fb-0479-4142-8640-9bb1b684acd3/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_75ecb7fb-0479-4142-8640-9bb1b684acd3/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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2022-11-25 17:23:35,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:23:35,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:23:35,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:23:35,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:23:35,341 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:23:35,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:23:38,397 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:23:38,731 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:23:38,732 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:23:38,751 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/data/c5f55064d/800bdd58a2064597829ce8be639cd666/FLAGbff467c12 [2022-11-25 17:23:38,785 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/data/c5f55064d/800bdd58a2064597829ce8be639cd666 [2022-11-25 17:23:38,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:23:38,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:23:38,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:23:38,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:23:38,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:23:38,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:38" (1/1) ... [2022-11-25 17:23:38,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d2057e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:38, skipping insertion in model container [2022-11-25 17:23:38,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:38" (1/1) ... [2022-11-25 17:23:38,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:23:38,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:23:39,004 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_75ecb7fb-0479-4142-8640-9bb1b684acd3/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-11-25 17:23:39,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:23:39,314 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:23:39,334 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_75ecb7fb-0479-4142-8640-9bb1b684acd3/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-11-25 17:23:39,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:39,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:39,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:23:39,418 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:23:39,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39 WrapperNode [2022-11-25 17:23:39,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:23:39,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:23:39,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:23:39,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:23:39,427 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:23:39" (1/1) ... [2022-11-25 17:23:39,440 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:23:39" (1/1) ... [2022-11-25 17:23:39,464 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2022-11-25 17:23:39,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:23:39,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:23:39,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:23:39,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:23:39,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,505 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:23:39,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:23:39,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:23:39,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:23:39,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:23:39,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:39,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:23:39,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:23:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:23:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:23:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:23:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:23:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:23:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:23:39,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:23:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:23:39,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:23:39,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:23:39,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:23:39,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:23:39,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:23:39,595 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:23:39,824 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:23:39,826 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:23:40,201 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:23:40,420 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:23:40,420 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:23:40,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:40 BoogieIcfgContainer [2022-11-25 17:23:40,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:23:40,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:23:40,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:23:40,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:23:40,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:23:38" (1/3) ... [2022-11-25 17:23:40,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371327a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:23:40, skipping insertion in model container [2022-11-25 17:23:40,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39" (2/3) ... [2022-11-25 17:23:40,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371327a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:23:40, skipping insertion in model container [2022-11-25 17:23:40,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:40" (3/3) ... [2022-11-25 17:23:40,433 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:23:40,442 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:23:40,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:23:40,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:23:40,453 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:23:40,530 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:23:40,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-11-25 17:23:40,666 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-11-25 17:23:40,666 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:40,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-25 17:23:40,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-11-25 17:23:40,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-11-25 17:23:40,683 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:23:40,716 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 95 transitions, 196 flow [2022-11-25 17:23:40,729 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 95 transitions, 196 flow [2022-11-25 17:23:40,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 196 flow [2022-11-25 17:23:40,781 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-11-25 17:23:40,781 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:40,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-25 17:23:40,783 INFO L119 LiptonReduction]: Number of co-enabled transitions 1196 [2022-11-25 17:23:45,054 INFO L134 LiptonReduction]: Checked pairs total: 2969 [2022-11-25 17:23:45,054 INFO L136 LiptonReduction]: Total number of compositions: 87 [2022-11-25 17:23:45,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:23:45,090 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;@3b44b4c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:23:45,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 17:23:45,100 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 17:23:45,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:45,100 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:45,101 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:23:45,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:45,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash 401963483, now seen corresponding path program 1 times [2022-11-25 17:23:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:45,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623219692] [2022-11-25 17:23:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:45,607 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:23:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:45,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623219692] [2022-11-25 17:23:45,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623219692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:45,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:45,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:23:45,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663732429] [2022-11-25 17:23:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:45,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:23:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:45,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:23:45,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:23:45,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 184 [2022-11-25 17:23:45,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:23:45,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:45,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 184 [2022-11-25 17:23:45,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:45,830 INFO L130 PetriNetUnfolder]: 135/312 cut-off events. [2022-11-25 17:23:45,831 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-25 17:23:45,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 312 events. 135/312 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1392 event pairs, 21 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 556. Up to 187 conditions per place. [2022-11-25 17:23:45,836 INFO L137 encePairwiseOnDemand]: 180/184 looper letters, 19 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2022-11-25 17:23:45,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 104 flow [2022-11-25 17:23:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:23:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:23:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2022-11-25 17:23:45,860 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5144927536231884 [2022-11-25 17:23:45,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2022-11-25 17:23:45,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2022-11-25 17:23:45,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:45,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2022-11-25 17:23:45,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:23:45,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 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:23:45,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 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:23:45,884 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 284 transitions. [2022-11-25 17:23:45,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 104 flow [2022-11-25 17:23:45,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:23:45,889 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2022-11-25 17:23:45,891 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-11-25 17:23:45,894 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-11-25 17:23:45,895 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2022-11-25 17:23:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:23:45,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:45,896 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:45,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:23:45,897 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash 526005686, now seen corresponding path program 1 times [2022-11-25 17:23:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:45,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614546059] [2022-11-25 17:23:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:46,232 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:23:46,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:46,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614546059] [2022-11-25 17:23:46,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614546059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:46,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:46,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:23:46,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291004088] [2022-11-25 17:23:46,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:46,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:46,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:46,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:46,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 184 [2022-11-25 17:23:46,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:23:46,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:46,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 184 [2022-11-25 17:23:46,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:46,539 INFO L130 PetriNetUnfolder]: 304/557 cut-off events. [2022-11-25 17:23:46,539 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-25 17:23:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 557 events. 304/557 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2537 event pairs, 70 based on Foata normal form. 43/600 useless extension candidates. Maximal degree in co-relation 1140. Up to 258 conditions per place. [2022-11-25 17:23:46,546 INFO L137 encePairwiseOnDemand]: 176/184 looper letters, 24 selfloop transitions, 6 changer transitions 18/48 dead transitions. [2022-11-25 17:23:46,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 48 transitions, 208 flow [2022-11-25 17:23:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:23:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 435 transitions. [2022-11-25 17:23:46,550 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47282608695652173 [2022-11-25 17:23:46,551 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 435 transitions. [2022-11-25 17:23:46,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 435 transitions. [2022-11-25 17:23:46,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:46,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 435 transitions. [2022-11-25 17:23:46,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 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:23:46,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 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:23:46,558 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 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:23:46,558 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 5 states and 435 transitions. [2022-11-25 17:23:46,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 48 transitions, 208 flow [2022-11-25 17:23:46,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:23:46,560 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2022-11-25 17:23:46,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-11-25 17:23:46,561 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-11-25 17:23:46,561 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2022-11-25 17:23:46,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:23:46,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:46,562 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:46,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:23:46,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash -873698309, now seen corresponding path program 1 times [2022-11-25 17:23:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:46,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137448794] [2022-11-25 17:23:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:46,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:46,791 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:23:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:46,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137448794] [2022-11-25 17:23:46,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137448794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:46,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:46,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770782753] [2022-11-25 17:23:46,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:46,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:46,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:46,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:46,831 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 184 [2022-11-25 17:23:46,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:23:46,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:46,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 184 [2022-11-25 17:23:46,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:47,048 INFO L130 PetriNetUnfolder]: 238/450 cut-off events. [2022-11-25 17:23:47,048 INFO L131 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-11-25 17:23:47,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 450 events. 238/450 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1864 event pairs, 58 based on Foata normal form. 32/482 useless extension candidates. Maximal degree in co-relation 1281. Up to 149 conditions per place. [2022-11-25 17:23:47,054 INFO L137 encePairwiseOnDemand]: 177/184 looper letters, 24 selfloop transitions, 6 changer transitions 20/50 dead transitions. [2022-11-25 17:23:47,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 300 flow [2022-11-25 17:23:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 587 transitions. [2022-11-25 17:23:47,057 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4557453416149068 [2022-11-25 17:23:47,062 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 587 transitions. [2022-11-25 17:23:47,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 587 transitions. [2022-11-25 17:23:47,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:47,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 587 transitions. [2022-11-25 17:23:47,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 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:23:47,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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:23:47,067 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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:23:47,068 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 7 states and 587 transitions. [2022-11-25 17:23:47,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 300 flow [2022-11-25 17:23:47,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 50 transitions, 268 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 17:23:47,075 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 110 flow [2022-11-25 17:23:47,076 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2022-11-25 17:23:47,077 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-11-25 17:23:47,077 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 110 flow [2022-11-25 17:23:47,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:23:47,078 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:47,078 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:47,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:23:47,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash -827856765, now seen corresponding path program 1 times [2022-11-25 17:23:47,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:47,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598878455] [2022-11-25 17:23:47,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:47,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:47,275 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:23:47,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:47,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598878455] [2022-11-25 17:23:47,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598878455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:47,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:47,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:47,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749738216] [2022-11-25 17:23:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:47,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:47,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:47,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:47,301 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 184 [2022-11-25 17:23:47,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 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:23:47,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:47,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 184 [2022-11-25 17:23:47,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:47,489 INFO L130 PetriNetUnfolder]: 195/369 cut-off events. [2022-11-25 17:23:47,489 INFO L131 PetriNetUnfolder]: For 538/538 co-relation queries the response was YES. [2022-11-25 17:23:47,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 369 events. 195/369 cut-off events. For 538/538 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1402 event pairs, 69 based on Foata normal form. 18/387 useless extension candidates. Maximal degree in co-relation 1097. Up to 150 conditions per place. [2022-11-25 17:23:47,492 INFO L137 encePairwiseOnDemand]: 178/184 looper letters, 24 selfloop transitions, 5 changer transitions 15/44 dead transitions. [2022-11-25 17:23:47,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 274 flow [2022-11-25 17:23:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 581 transitions. [2022-11-25 17:23:47,494 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45108695652173914 [2022-11-25 17:23:47,494 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 581 transitions. [2022-11-25 17:23:47,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 581 transitions. [2022-11-25 17:23:47,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:47,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 581 transitions. [2022-11-25 17:23:47,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 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:23:47,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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:23:47,500 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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:23:47,500 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 110 flow. Second operand 7 states and 581 transitions. [2022-11-25 17:23:47,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 274 flow [2022-11-25 17:23:47,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 261 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-25 17:23:47,504 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 131 flow [2022-11-25 17:23:47,504 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2022-11-25 17:23:47,505 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2022-11-25 17:23:47,505 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 131 flow [2022-11-25 17:23:47,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 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:23:47,506 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:47,506 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:47,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:23:47,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 105047030, now seen corresponding path program 1 times [2022-11-25 17:23:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:47,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91099892] [2022-11-25 17:23:47,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:47,726 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:23:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:47,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91099892] [2022-11-25 17:23:47,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91099892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:47,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:47,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:47,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974060690] [2022-11-25 17:23:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:47,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:47,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:47,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:47,738 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 184 [2022-11-25 17:23:47,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 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:23:47,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:47,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 184 [2022-11-25 17:23:47,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:47,867 INFO L130 PetriNetUnfolder]: 86/213 cut-off events. [2022-11-25 17:23:47,867 INFO L131 PetriNetUnfolder]: For 213/214 co-relation queries the response was YES. [2022-11-25 17:23:47,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 213 events. 86/213 cut-off events. For 213/214 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 855 event pairs, 28 based on Foata normal form. 32/245 useless extension candidates. Maximal degree in co-relation 653. Up to 73 conditions per place. [2022-11-25 17:23:47,869 INFO L137 encePairwiseOnDemand]: 179/184 looper letters, 26 selfloop transitions, 4 changer transitions 4/40 dead transitions. [2022-11-25 17:23:47,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 275 flow [2022-11-25 17:23:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:23:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:23:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2022-11-25 17:23:47,871 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48777173913043476 [2022-11-25 17:23:47,871 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 359 transitions. [2022-11-25 17:23:47,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 359 transitions. [2022-11-25 17:23:47,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:47,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 359 transitions. [2022-11-25 17:23:47,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:23:47,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 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:23:47,875 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 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:23:47,875 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 131 flow. Second operand 4 states and 359 transitions. [2022-11-25 17:23:47,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 275 flow [2022-11-25 17:23:47,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 254 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-25 17:23:47,878 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 144 flow [2022-11-25 17:23:47,878 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-11-25 17:23:47,879 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-11-25 17:23:47,879 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 144 flow [2022-11-25 17:23:47,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 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:23:47,880 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:47,880 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:47,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:23:47,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash -284921140, now seen corresponding path program 1 times [2022-11-25 17:23:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:47,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305532474] [2022-11-25 17:23:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:48,075 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:23:48,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:48,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305532474] [2022-11-25 17:23:48,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305532474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:48,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:48,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:23:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340797465] [2022-11-25 17:23:48,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:48,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:48,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:23:48,101 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 184 [2022-11-25 17:23:48,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:23:48,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:48,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 184 [2022-11-25 17:23:48,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:48,353 INFO L130 PetriNetUnfolder]: 168/395 cut-off events. [2022-11-25 17:23:48,353 INFO L131 PetriNetUnfolder]: For 430/430 co-relation queries the response was YES. [2022-11-25 17:23:48,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 395 events. 168/395 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1954 event pairs, 35 based on Foata normal form. 4/399 useless extension candidates. Maximal degree in co-relation 1439. Up to 136 conditions per place. [2022-11-25 17:23:48,356 INFO L137 encePairwiseOnDemand]: 176/184 looper letters, 33 selfloop transitions, 5 changer transitions 27/65 dead transitions. [2022-11-25 17:23:48,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 456 flow [2022-11-25 17:23:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions. [2022-11-25 17:23:48,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4580745341614907 [2022-11-25 17:23:48,359 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 590 transitions. [2022-11-25 17:23:48,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 590 transitions. [2022-11-25 17:23:48,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:48,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 590 transitions. [2022-11-25 17:23:48,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 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:23:48,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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:23:48,363 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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:23:48,363 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 144 flow. Second operand 7 states and 590 transitions. [2022-11-25 17:23:48,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 456 flow [2022-11-25 17:23:48,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:23:48,367 INFO L231 Difference]: Finished difference. Result has 44 places, 22 transitions, 129 flow [2022-11-25 17:23:48,367 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=44, PETRI_TRANSITIONS=22} [2022-11-25 17:23:48,368 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2022-11-25 17:23:48,368 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 22 transitions, 129 flow [2022-11-25 17:23:48,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:23:48,369 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:48,369 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:48,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:23:48,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1344877640, now seen corresponding path program 2 times [2022-11-25 17:23:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:48,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987874249] [2022-11-25 17:23:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:48,589 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:23:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:48,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987874249] [2022-11-25 17:23:48,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987874249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:48,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:48,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994476726] [2022-11-25 17:23:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:48,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:48,606 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 184 [2022-11-25 17:23:48,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 22 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:23:48,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:48,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 184 [2022-11-25 17:23:48,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:48,708 INFO L130 PetriNetUnfolder]: 61/170 cut-off events. [2022-11-25 17:23:48,709 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-11-25 17:23:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 170 events. 61/170 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 642 event pairs, 28 based on Foata normal form. 4/174 useless extension candidates. Maximal degree in co-relation 617. Up to 91 conditions per place. [2022-11-25 17:23:48,710 INFO L137 encePairwiseOnDemand]: 180/184 looper letters, 19 selfloop transitions, 2 changer transitions 11/34 dead transitions. [2022-11-25 17:23:48,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 251 flow [2022-11-25 17:23:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:23:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:23:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2022-11-25 17:23:48,712 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48233695652173914 [2022-11-25 17:23:48,712 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 355 transitions. [2022-11-25 17:23:48,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 355 transitions. [2022-11-25 17:23:48,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:48,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 355 transitions. [2022-11-25 17:23:48,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 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:23:48,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 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:23:48,716 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 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:23:48,716 INFO L175 Difference]: Start difference. First operand has 44 places, 22 transitions, 129 flow. Second operand 4 states and 355 transitions. [2022-11-25 17:23:48,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 251 flow [2022-11-25 17:23:48,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 214 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-11-25 17:23:48,719 INFO L231 Difference]: Finished difference. Result has 37 places, 19 transitions, 92 flow [2022-11-25 17:23:48,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=19} [2022-11-25 17:23:48,719 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-11-25 17:23:48,720 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 92 flow [2022-11-25 17:23:48,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:23:48,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:48,720 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:48,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:23:48,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -605480278, now seen corresponding path program 3 times [2022-11-25 17:23:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:48,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940929654] [2022-11-25 17:23:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:48,915 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:23:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:48,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940929654] [2022-11-25 17:23:48,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940929654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:48,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:48,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80381663] [2022-11-25 17:23:48,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:48,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:48,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:48,927 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 184 [2022-11-25 17:23:48,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 19 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 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:23:48,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:48,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 184 [2022-11-25 17:23:48,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:48,997 INFO L130 PetriNetUnfolder]: 10/39 cut-off events. [2022-11-25 17:23:48,997 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-25 17:23:48,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 39 events. 10/39 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 2 based on Foata normal form. 6/45 useless extension candidates. Maximal degree in co-relation 130. Up to 16 conditions per place. [2022-11-25 17:23:48,998 INFO L137 encePairwiseOnDemand]: 179/184 looper letters, 13 selfloop transitions, 6 changer transitions 1/23 dead transitions. [2022-11-25 17:23:48,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 23 transitions, 153 flow [2022-11-25 17:23:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:23:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-11-25 17:23:49,000 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46956521739130436 [2022-11-25 17:23:49,001 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 432 transitions. [2022-11-25 17:23:49,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 432 transitions. [2022-11-25 17:23:49,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:49,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 432 transitions. [2022-11-25 17:23:49,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:23:49,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 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:23:49,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 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:23:49,005 INFO L175 Difference]: Start difference. First operand has 37 places, 19 transitions, 92 flow. Second operand 5 states and 432 transitions. [2022-11-25 17:23:49,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 23 transitions, 153 flow [2022-11-25 17:23:49,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 105 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-11-25 17:23:49,006 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 79 flow [2022-11-25 17:23:49,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-11-25 17:23:49,007 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-11-25 17:23:49,007 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 79 flow [2022-11-25 17:23:49,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 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:23:49,008 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:49,008 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:23:49,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:23:49,008 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:49,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash 16859979, now seen corresponding path program 1 times [2022-11-25 17:23:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:49,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050479305] [2022-11-25 17:23:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:49,488 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:23:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:49,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050479305] [2022-11-25 17:23:49,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050479305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:49,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:49,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:23:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144448769] [2022-11-25 17:23:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:49,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:49,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:49,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:23:49,523 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 184 [2022-11-25 17:23:49,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 79 flow. Second operand has 6 states, 6 states have (on average 82.33333333333333) internal successors, (494), 6 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:49,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:49,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 184 [2022-11-25 17:23:49,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:49,636 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-11-25 17:23:49,637 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-25 17:23:49,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 36 events. 6/36 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 113. Up to 17 conditions per place. [2022-11-25 17:23:49,637 INFO L137 encePairwiseOnDemand]: 178/184 looper letters, 14 selfloop transitions, 2 changer transitions 11/30 dead transitions. [2022-11-25 17:23:49,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 195 flow [2022-11-25 17:23:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 584 transitions. [2022-11-25 17:23:49,640 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.453416149068323 [2022-11-25 17:23:49,640 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 584 transitions. [2022-11-25 17:23:49,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 584 transitions. [2022-11-25 17:23:49,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:49,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 584 transitions. [2022-11-25 17:23:49,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:23:49,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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:23:49,644 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 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:23:49,644 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 79 flow. Second operand 7 states and 584 transitions. [2022-11-25 17:23:49,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 195 flow [2022-11-25 17:23:49,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 138 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-11-25 17:23:49,645 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 65 flow [2022-11-25 17:23:49,646 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=25, 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=7, PETRI_FLOW=65, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2022-11-25 17:23:49,646 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-11-25 17:23:49,646 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 65 flow [2022-11-25 17:23:49,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.33333333333333) internal successors, (494), 6 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:49,647 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:49,647 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:23:49,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:23:49,647 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 17:23:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:49,648 INFO L85 PathProgramCache]: Analyzing trace with hash -939939989, now seen corresponding path program 2 times [2022-11-25 17:23:49,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:49,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272245347] [2022-11-25 17:23:49,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:23:49,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:23:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:23:49,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:23:49,734 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:23:49,735 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-25 17:23:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-25 17:23:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-25 17:23:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-25 17:23:49,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-25 17:23:49,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:23:49,738 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-11-25 17:23:49,744 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:23:49,745 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:23:49,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:23:49 BasicIcfg [2022-11-25 17:23:49,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:23:49,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:23:49,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:23:49,798 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:23:49,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:40" (3/4) ... [2022-11-25 17:23:49,801 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:23:49,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:23:49,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:23:49,885 INFO L158 Benchmark]: Toolchain (without parser) took 11095.70ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 136.5MB in the beginning and 76.0MB in the end (delta: 60.5MB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,885 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 125.8MB. Free memory was 68.4MB in the beginning and 68.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:23:49,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.79ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 110.6MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.61ms. Allocated memory is still 169.9MB. Free memory was 110.6MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,886 INFO L158 Benchmark]: Boogie Preprocessor took 44.71ms. Allocated memory is still 169.9MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,887 INFO L158 Benchmark]: RCFGBuilder took 911.42ms. Allocated memory is still 169.9MB. Free memory was 106.4MB in the beginning and 77.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,887 INFO L158 Benchmark]: TraceAbstraction took 9372.04ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 76.6MB in the beginning and 84.3MB in the end (delta: -7.7MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,888 INFO L158 Benchmark]: Witness Printer took 86.26ms. Allocated memory is still 247.5MB. Free memory was 84.3MB in the beginning and 76.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 17:23:49,890 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.33ms. Allocated memory is still 125.8MB. Free memory was 68.4MB in the beginning and 68.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.79ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 110.6MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.61ms. Allocated memory is still 169.9MB. Free memory was 110.6MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.71ms. Allocated memory is still 169.9MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 911.42ms. Allocated memory is still 169.9MB. Free memory was 106.4MB in the beginning and 77.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9372.04ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 76.6MB in the beginning and 84.3MB in the end (delta: -7.7MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. * Witness Printer took 86.26ms. Allocated memory is still 247.5MB. Free memory was 84.3MB in the beginning and 76.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 100 PlacesBefore, 26 PlacesAfterwards, 95 TransitionsBefore, 20 TransitionsAfterwards, 1196 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 2969 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1493, independent: 1376, independent conditional: 0, independent unconditional: 1376, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 861, independent: 825, independent conditional: 0, independent unconditional: 825, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 861, independent: 812, independent conditional: 0, independent unconditional: 812, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 276, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1493, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 861, unknown conditional: 0, unknown unconditional: 861] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1633, ((void *)0), P0, ((void *)0))=-1, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1634, ((void *)0), P1, ((void *)0))=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 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) [L751] 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)) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 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 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 116 locations, 5 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: 9.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 32 mSDtfsCounter, 668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=5, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:23:49,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75ecb7fb-0479-4142-8640-9bb1b684acd3/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