./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be50e7e5241b29f4a9e868e4f8ec6ed8a757d2cee90daca598ed21c4a5ee9d77 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 22:07:30,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:07:30,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:07:30,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:07:30,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:07:30,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:07:30,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:07:30,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:07:30,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:07:30,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:07:30,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:07:30,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:07:30,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:07:30,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:07:30,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:07:30,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:07:30,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:07:30,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:07:30,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:07:30,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:07:30,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:07:30,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:07:30,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:07:30,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:07:30,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:07:30,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:07:30,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:07:30,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:07:30,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:07:30,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:07:30,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:07:30,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:07:30,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:07:30,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:07:30,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:07:30,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:07:30,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:07:30,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:07:30,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:07:30,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:07:30,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:07:30,771 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 22:07:30,787 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:07:30,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:07:30,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:07:30,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:07:30,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:07:30,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:07:30,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:07:30,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:07:30,789 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:07:30,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:07:30,789 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:07:30,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:07:30,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:07:30,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:07:30,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:07:30,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:07:30,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:07:30,790 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:07:30,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:07:30,790 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:07:30,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:07:30,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:07:30,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:07:30,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:07:30,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:07:30,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:07:30,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:07:30,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:07:30,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:07:30,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:07:30,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:07:30,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:07:30,792 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:07:30,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:07:30,793 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:07:30,793 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_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be50e7e5241b29f4a9e868e4f8ec6ed8a757d2cee90daca598ed21c4a5ee9d77 [2022-12-13 22:07:30,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:07:30,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:07:30,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:07:30,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:07:30,979 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:07:30,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:07:33,544 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:07:33,730 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:07:33,730 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:07:33,739 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/data/ca7277d6f/d98e7ca96912480e9b494865c1645d5a/FLAG38334382b [2022-12-13 22:07:34,115 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/data/ca7277d6f/d98e7ca96912480e9b494865c1645d5a [2022-12-13 22:07:34,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:07:34,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:07:34,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:07:34,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:07:34,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:07:34,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a140035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34, skipping insertion in model container [2022-12-13 22:07:34,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:07:34,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:07:34,266 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_871306d1-f529-4b2c-9d0b-97df53a59310/sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:07:34,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:07:34,408 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:07:34,416 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_871306d1-f529-4b2c-9d0b-97df53a59310/sv-benchmarks/c/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:07:34,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:07:34,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:07:34,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:07:34,477 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:07:34,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34 WrapperNode [2022-12-13 22:07:34,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:07:34,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:07:34,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:07:34,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:07:34,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,511 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 22:07:34,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:07:34,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:07:34,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:07:34,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:07:34,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,530 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:07:34,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:07:34,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:07:34,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:07:34,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (1/1) ... [2022-12-13 22:07:34,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:07:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:07:34,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:07:34,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:07:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:07:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 22:07:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:07:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:07:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:07:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 22:07:34,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 22:07:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 22:07:34,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 22:07:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:07:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 22:07:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:07:34,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:07:34,598 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 22:07:34,704 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:07:34,706 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:07:34,973 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:07:35,076 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:07:35,076 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:07:35,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:07:35 BoogieIcfgContainer [2022-12-13 22:07:35,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:07:35,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:07:35,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:07:35,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:07:35,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:07:34" (1/3) ... [2022-12-13 22:07:35,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2190cc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:07:35, skipping insertion in model container [2022-12-13 22:07:35,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:34" (2/3) ... [2022-12-13 22:07:35,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2190cc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:07:35, skipping insertion in model container [2022-12-13 22:07:35,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:07:35" (3/3) ... [2022-12-13 22:07:35,084 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:07:35,090 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 22:07:35,098 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:07:35,098 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 22:07:35,098 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:07:35,130 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 22:07:35,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-12-13 22:07:35,183 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-12-13 22:07:35,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:07:35,187 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 57. Up to 2 conditions per place. [2022-12-13 22:07:35,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-12-13 22:07:35,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-12-13 22:07:35,193 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:07:35,200 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 95 transitions, 196 flow [2022-12-13 22:07:35,202 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 95 transitions, 196 flow [2022-12-13 22:07:35,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 196 flow [2022-12-13 22:07:35,218 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-12-13 22:07:35,218 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:07:35,219 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 57. Up to 2 conditions per place. [2022-12-13 22:07:35,219 INFO L119 LiptonReduction]: Number of co-enabled transitions 1310 [2022-12-13 22:07:38,211 INFO L134 LiptonReduction]: Checked pairs total: 3537 [2022-12-13 22:07:38,211 INFO L136 LiptonReduction]: Total number of compositions: 88 [2022-12-13 22:07:38,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:07:38,225 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;@3a982f5b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:07:38,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 22:07:38,227 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 22:07:38,227 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:07:38,228 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:38,228 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 22:07:38,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash 488693, now seen corresponding path program 1 times [2022-12-13 22:07:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:38,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348124590] [2022-12-13 22:07:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:38,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348124590] [2022-12-13 22:07:38,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348124590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:38,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:38,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:07:38,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190134400] [2022-12-13 22:07:38,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:38,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:38,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:38,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:38,499 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 185 [2022-12-13 22:07:38,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:38,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:38,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 185 [2022-12-13 22:07:38,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:38,649 INFO L130 PetriNetUnfolder]: 173/336 cut-off events. [2022-12-13 22:07:38,650 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 22:07:38,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 336 events. 173/336 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1483 event pairs, 20 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 642. Up to 250 conditions per place. [2022-12-13 22:07:38,653 INFO L137 encePairwiseOnDemand]: 182/185 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2022-12-13 22:07:38,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2022-12-13 22:07:38,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:07:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2022-12-13 22:07:38,664 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4990990990990991 [2022-12-13 22:07:38,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2022-12-13 22:07:38,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2022-12-13 22:07:38,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:38,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2022-12-13 22:07:38,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:38,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:38,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:38,679 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 277 transitions. [2022-12-13 22:07:38,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2022-12-13 22:07:38,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:07:38,682 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2022-12-13 22:07:38,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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-12-13 22:07:38,685 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-12-13 22:07:38,686 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2022-12-13 22:07:38,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:38,686 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:38,686 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:38,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:07:38,686 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash 387908895, now seen corresponding path program 1 times [2022-12-13 22:07:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:38,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965769318] [2022-12-13 22:07:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:39,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965769318] [2022-12-13 22:07:39,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965769318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:39,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:39,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:07:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265522153] [2022-12-13 22:07:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:39,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:39,401 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 185 [2022-12-13 22:07:39,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:39,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:39,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 185 [2022-12-13 22:07:39,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:39,580 INFO L130 PetriNetUnfolder]: 198/363 cut-off events. [2022-12-13 22:07:39,580 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 22:07:39,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 363 events. 198/363 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1360 event pairs, 47 based on Foata normal form. 8/371 useless extension candidates. Maximal degree in co-relation 742. Up to 297 conditions per place. [2022-12-13 22:07:39,583 INFO L137 encePairwiseOnDemand]: 176/185 looper letters, 23 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2022-12-13 22:07:39,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 148 flow [2022-12-13 22:07:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:07:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:07:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2022-12-13 22:07:39,586 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2022-12-13 22:07:39,586 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 335 transitions. [2022-12-13 22:07:39,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 335 transitions. [2022-12-13 22:07:39,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:39,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 335 transitions. [2022-12-13 22:07:39,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:39,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:39,590 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:39,590 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 4 states and 335 transitions. [2022-12-13 22:07:39,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 148 flow [2022-12-13 22:07:39,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:07:39,591 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 101 flow [2022-12-13 22:07:39,591 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-13 22:07:39,592 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-13 22:07:39,592 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 101 flow [2022-12-13 22:07:39,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:39,592 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:39,592 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:39,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:07:39,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:39,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash -859727888, now seen corresponding path program 1 times [2022-12-13 22:07:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:39,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256977966] [2022-12-13 22:07:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:40,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:40,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256977966] [2022-12-13 22:07:40,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256977966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:40,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:40,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:07:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983544746] [2022-12-13 22:07:40,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:40,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:40,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:40,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:40,145 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 185 [2022-12-13 22:07:40,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:40,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:40,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 185 [2022-12-13 22:07:40,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:40,270 INFO L130 PetriNetUnfolder]: 173/318 cut-off events. [2022-12-13 22:07:40,270 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-13 22:07:40,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 318 events. 173/318 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1122 event pairs, 59 based on Foata normal form. 13/329 useless extension candidates. Maximal degree in co-relation 891. Up to 159 conditions per place. [2022-12-13 22:07:40,272 INFO L137 encePairwiseOnDemand]: 178/185 looper letters, 27 selfloop transitions, 7 changer transitions 0/35 dead transitions. [2022-12-13 22:07:40,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 202 flow [2022-12-13 22:07:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:07:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:07:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2022-12-13 22:07:40,275 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2022-12-13 22:07:40,275 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 328 transitions. [2022-12-13 22:07:40,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 328 transitions. [2022-12-13 22:07:40,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:40,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 328 transitions. [2022-12-13 22:07:40,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:40,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:40,278 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:40,278 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 101 flow. Second operand 4 states and 328 transitions. [2022-12-13 22:07:40,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 202 flow [2022-12-13 22:07:40,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:07:40,280 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 152 flow [2022-12-13 22:07:40,280 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-13 22:07:40,280 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2022-12-13 22:07:40,280 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 152 flow [2022-12-13 22:07:40,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:40,281 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:40,281 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:40,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:07:40,281 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1987076198, now seen corresponding path program 1 times [2022-12-13 22:07:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:40,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930554132] [2022-12-13 22:07:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:40,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930554132] [2022-12-13 22:07:40,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930554132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:40,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:40,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311247228] [2022-12-13 22:07:40,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:40,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:07:40,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:40,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:07:40,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:07:40,939 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 185 [2022-12-13 22:07:40,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:40,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:40,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 185 [2022-12-13 22:07:40,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:41,091 INFO L130 PetriNetUnfolder]: 179/323 cut-off events. [2022-12-13 22:07:41,091 INFO L131 PetriNetUnfolder]: For 233/243 co-relation queries the response was YES. [2022-12-13 22:07:41,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 323 events. 179/323 cut-off events. For 233/243 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1130 event pairs, 31 based on Foata normal form. 10/329 useless extension candidates. Maximal degree in co-relation 1023. Up to 268 conditions per place. [2022-12-13 22:07:41,093 INFO L137 encePairwiseOnDemand]: 181/185 looper letters, 34 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-12-13 22:07:41,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 273 flow [2022-12-13 22:07:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:07:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:07:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2022-12-13 22:07:41,095 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2022-12-13 22:07:41,095 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 354 transitions. [2022-12-13 22:07:41,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 354 transitions. [2022-12-13 22:07:41,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:41,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 354 transitions. [2022-12-13 22:07:41,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:41,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:41,098 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:41,098 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 152 flow. Second operand 4 states and 354 transitions. [2022-12-13 22:07:41,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 273 flow [2022-12-13 22:07:41,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 263 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 22:07:41,100 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 165 flow [2022-12-13 22:07:41,100 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 22:07:41,101 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-13 22:07:41,101 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 165 flow [2022-12-13 22:07:41,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:41,101 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:41,101 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:41,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:07:41,101 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2028235533, now seen corresponding path program 1 times [2022-12-13 22:07:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:41,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622048994] [2022-12-13 22:07:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:41,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:41,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622048994] [2022-12-13 22:07:41,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622048994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:41,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:41,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:07:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623407488] [2022-12-13 22:07:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:41,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 22:07:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 22:07:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:07:41,836 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 185 [2022-12-13 22:07:41,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 165 flow. Second operand has 8 states, 8 states have (on average 75.5) internal successors, (604), 8 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:41,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:41,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 185 [2022-12-13 22:07:41,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:42,141 INFO L130 PetriNetUnfolder]: 239/428 cut-off events. [2022-12-13 22:07:42,141 INFO L131 PetriNetUnfolder]: For 301/311 co-relation queries the response was YES. [2022-12-13 22:07:42,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 428 events. 239/428 cut-off events. For 301/311 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1676 event pairs, 24 based on Foata normal form. 14/442 useless extension candidates. Maximal degree in co-relation 1446. Up to 253 conditions per place. [2022-12-13 22:07:42,143 INFO L137 encePairwiseOnDemand]: 175/185 looper letters, 46 selfloop transitions, 25 changer transitions 0/74 dead transitions. [2022-12-13 22:07:42,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 499 flow [2022-12-13 22:07:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 22:07:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 22:07:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 719 transitions. [2022-12-13 22:07:42,146 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4318318318318318 [2022-12-13 22:07:42,146 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 719 transitions. [2022-12-13 22:07:42,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 719 transitions. [2022-12-13 22:07:42,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:42,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 719 transitions. [2022-12-13 22:07:42,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.88888888888889) internal successors, (719), 9 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,152 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,152 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 165 flow. Second operand 9 states and 719 transitions. [2022-12-13 22:07:42,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 499 flow [2022-12-13 22:07:42,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:07:42,157 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 371 flow [2022-12-13 22:07:42,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=371, PETRI_PLACES=47, PETRI_TRANSITIONS=50} [2022-12-13 22:07:42,158 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2022-12-13 22:07:42,158 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 371 flow [2022-12-13 22:07:42,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.5) internal successors, (604), 8 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:42,159 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:42,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:07:42,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1138844503, now seen corresponding path program 2 times [2022-12-13 22:07:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004510015] [2022-12-13 22:07:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:42,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:42,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004510015] [2022-12-13 22:07:42,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004510015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:42,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:42,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186119030] [2022-12-13 22:07:42,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:42,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:07:42,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:07:42,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:07:42,602 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 185 [2022-12-13 22:07:42,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:42,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 185 [2022-12-13 22:07:42,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:42,815 INFO L130 PetriNetUnfolder]: 266/475 cut-off events. [2022-12-13 22:07:42,815 INFO L131 PetriNetUnfolder]: For 781/791 co-relation queries the response was YES. [2022-12-13 22:07:42,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 475 events. 266/475 cut-off events. For 781/791 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1932 event pairs, 26 based on Foata normal form. 14/489 useless extension candidates. Maximal degree in co-relation 2035. Up to 281 conditions per place. [2022-12-13 22:07:42,819 INFO L137 encePairwiseOnDemand]: 176/185 looper letters, 46 selfloop transitions, 30 changer transitions 0/79 dead transitions. [2022-12-13 22:07:42,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 696 flow [2022-12-13 22:07:42,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:07:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:07:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 583 transitions. [2022-12-13 22:07:42,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45019305019305017 [2022-12-13 22:07:42,822 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 583 transitions. [2022-12-13 22:07:42,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 583 transitions. [2022-12-13 22:07:42,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:42,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 583 transitions. [2022-12-13 22:07:42,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,826 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,826 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 371 flow. Second operand 7 states and 583 transitions. [2022-12-13 22:07:42,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 696 flow [2022-12-13 22:07:42,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 684 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 22:07:42,833 INFO L231 Difference]: Finished difference. Result has 53 places, 61 transitions, 583 flow [2022-12-13 22:07:42,833 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=583, PETRI_PLACES=53, PETRI_TRANSITIONS=61} [2022-12-13 22:07:42,834 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2022-12-13 22:07:42,834 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 583 flow [2022-12-13 22:07:42,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:42,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:42,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:42,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:07:42,835 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash -102991007, now seen corresponding path program 3 times [2022-12-13 22:07:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:42,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646277384] [2022-12-13 22:07:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:43,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:43,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646277384] [2022-12-13 22:07:43,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646277384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:43,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:43,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:07:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192473431] [2022-12-13 22:07:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:43,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 22:07:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:43,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 22:07:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:07:43,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 185 [2022-12-13 22:07:43,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 583 flow. Second operand has 8 states, 8 states have (on average 72.5) internal successors, (580), 8 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:43,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:43,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 185 [2022-12-13 22:07:43,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:43,671 INFO L130 PetriNetUnfolder]: 272/487 cut-off events. [2022-12-13 22:07:43,671 INFO L131 PetriNetUnfolder]: For 1560/1570 co-relation queries the response was YES. [2022-12-13 22:07:43,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 487 events. 272/487 cut-off events. For 1560/1570 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2016 event pairs, 52 based on Foata normal form. 11/498 useless extension candidates. Maximal degree in co-relation 2442. Up to 390 conditions per place. [2022-12-13 22:07:43,674 INFO L137 encePairwiseOnDemand]: 175/185 looper letters, 66 selfloop transitions, 28 changer transitions 0/97 dead transitions. [2022-12-13 22:07:43,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 97 transitions, 1020 flow [2022-12-13 22:07:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:07:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:07:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 546 transitions. [2022-12-13 22:07:43,676 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42162162162162165 [2022-12-13 22:07:43,676 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 546 transitions. [2022-12-13 22:07:43,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 546 transitions. [2022-12-13 22:07:43,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:43,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 546 transitions. [2022-12-13 22:07:43,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:43,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:43,679 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:43,679 INFO L175 Difference]: Start difference. First operand has 53 places, 61 transitions, 583 flow. Second operand 7 states and 546 transitions. [2022-12-13 22:07:43,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 97 transitions, 1020 flow [2022-12-13 22:07:43,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 97 transitions, 995 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 22:07:43,684 INFO L231 Difference]: Finished difference. Result has 61 places, 81 transitions, 878 flow [2022-12-13 22:07:43,685 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=878, PETRI_PLACES=61, PETRI_TRANSITIONS=81} [2022-12-13 22:07:43,685 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2022-12-13 22:07:43,685 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 81 transitions, 878 flow [2022-12-13 22:07:43,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.5) internal successors, (580), 8 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:43,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:43,686 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:43,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:07:43,686 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:43,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:43,686 INFO L85 PathProgramCache]: Analyzing trace with hash -179569997, now seen corresponding path program 4 times [2022-12-13 22:07:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:43,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364806316] [2022-12-13 22:07:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:44,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:44,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364806316] [2022-12-13 22:07:44,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364806316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:44,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:44,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:07:44,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313747418] [2022-12-13 22:07:44,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:44,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 22:07:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:44,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 22:07:44,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:07:44,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 185 [2022-12-13 22:07:44,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 81 transitions, 878 flow. Second operand has 9 states, 9 states have (on average 72.33333333333333) internal successors, (651), 9 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:44,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:44,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 185 [2022-12-13 22:07:44,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:44,792 INFO L130 PetriNetUnfolder]: 284/513 cut-off events. [2022-12-13 22:07:44,792 INFO L131 PetriNetUnfolder]: For 2429/2439 co-relation queries the response was YES. [2022-12-13 22:07:44,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 513 events. 284/513 cut-off events. For 2429/2439 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2178 event pairs, 51 based on Foata normal form. 12/525 useless extension candidates. Maximal degree in co-relation 2913. Up to 375 conditions per place. [2022-12-13 22:07:44,795 INFO L137 encePairwiseOnDemand]: 175/185 looper letters, 65 selfloop transitions, 63 changer transitions 0/131 dead transitions. [2022-12-13 22:07:44,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1601 flow [2022-12-13 22:07:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 22:07:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 22:07:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 916 transitions. [2022-12-13 22:07:44,798 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4126126126126126 [2022-12-13 22:07:44,798 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 916 transitions. [2022-12-13 22:07:44,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 916 transitions. [2022-12-13 22:07:44,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:44,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 916 transitions. [2022-12-13 22:07:44,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 76.33333333333333) internal successors, (916), 12 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:44,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 185.0) internal successors, (2405), 13 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:44,802 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 185.0) internal successors, (2405), 13 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:44,802 INFO L175 Difference]: Start difference. First operand has 61 places, 81 transitions, 878 flow. Second operand 12 states and 916 transitions. [2022-12-13 22:07:44,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1601 flow [2022-12-13 22:07:44,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 131 transitions, 1556 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 22:07:44,811 INFO L231 Difference]: Finished difference. Result has 72 places, 115 transitions, 1459 flow [2022-12-13 22:07:44,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1459, PETRI_PLACES=72, PETRI_TRANSITIONS=115} [2022-12-13 22:07:44,811 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2022-12-13 22:07:44,812 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 115 transitions, 1459 flow [2022-12-13 22:07:44,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.33333333333333) internal successors, (651), 9 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:44,812 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:44,812 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:44,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:07:44,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash -179534657, now seen corresponding path program 5 times [2022-12-13 22:07:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:44,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447329890] [2022-12-13 22:07:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:45,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:45,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447329890] [2022-12-13 22:07:45,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447329890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:45,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:45,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:07:45,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561594091] [2022-12-13 22:07:45,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:45,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 22:07:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:45,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 22:07:45,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:07:45,566 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 185 [2022-12-13 22:07:45,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 115 transitions, 1459 flow. Second operand has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:45,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:45,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 185 [2022-12-13 22:07:45,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:45,898 INFO L130 PetriNetUnfolder]: 291/532 cut-off events. [2022-12-13 22:07:45,898 INFO L131 PetriNetUnfolder]: For 3388/3398 co-relation queries the response was YES. [2022-12-13 22:07:45,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3286 conditions, 532 events. 291/532 cut-off events. For 3388/3398 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2327 event pairs, 52 based on Foata normal form. 15/547 useless extension candidates. Maximal degree in co-relation 3252. Up to 367 conditions per place. [2022-12-13 22:07:45,903 INFO L137 encePairwiseOnDemand]: 175/185 looper letters, 66 selfloop transitions, 65 changer transitions 0/134 dead transitions. [2022-12-13 22:07:45,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 1832 flow [2022-12-13 22:07:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:07:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:07:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 557 transitions. [2022-12-13 22:07:45,905 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4301158301158301 [2022-12-13 22:07:45,905 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 557 transitions. [2022-12-13 22:07:45,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 557 transitions. [2022-12-13 22:07:45,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:45,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 557 transitions. [2022-12-13 22:07:45,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.57142857142857) internal successors, (557), 7 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:45,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:45,909 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:45,909 INFO L175 Difference]: Start difference. First operand has 72 places, 115 transitions, 1459 flow. Second operand 7 states and 557 transitions. [2022-12-13 22:07:45,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 1832 flow [2022-12-13 22:07:45,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 134 transitions, 1726 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-13 22:07:45,924 INFO L231 Difference]: Finished difference. Result has 75 places, 119 transitions, 1614 flow [2022-12-13 22:07:45,924 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1614, PETRI_PLACES=75, PETRI_TRANSITIONS=119} [2022-12-13 22:07:45,925 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 49 predicate places. [2022-12-13 22:07:45,925 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 119 transitions, 1614 flow [2022-12-13 22:07:45,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:45,925 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:45,925 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:45,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:07:45,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 870259425, now seen corresponding path program 1 times [2022-12-13 22:07:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:45,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785508199] [2022-12-13 22:07:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:47,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785508199] [2022-12-13 22:07:47,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785508199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:47,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:47,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:07:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184591458] [2022-12-13 22:07:47,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:47,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 22:07:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:47,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 22:07:47,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:07:47,105 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 185 [2022-12-13 22:07:47,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 119 transitions, 1614 flow. Second operand has 9 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:47,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:47,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 185 [2022-12-13 22:07:47,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:47,621 INFO L130 PetriNetUnfolder]: 349/657 cut-off events. [2022-12-13 22:07:47,621 INFO L131 PetriNetUnfolder]: For 4243/4260 co-relation queries the response was YES. [2022-12-13 22:07:47,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4003 conditions, 657 events. 349/657 cut-off events. For 4243/4260 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3125 event pairs, 17 based on Foata normal form. 25/682 useless extension candidates. Maximal degree in co-relation 3968. Up to 351 conditions per place. [2022-12-13 22:07:47,624 INFO L137 encePairwiseOnDemand]: 175/185 looper letters, 91 selfloop transitions, 57 changer transitions 14/165 dead transitions. [2022-12-13 22:07:47,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 165 transitions, 2260 flow [2022-12-13 22:07:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 22:07:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 22:07:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 856 transitions. [2022-12-13 22:07:47,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42063882063882063 [2022-12-13 22:07:47,626 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 856 transitions. [2022-12-13 22:07:47,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 856 transitions. [2022-12-13 22:07:47,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:47,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 856 transitions. [2022-12-13 22:07:47,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.81818181818181) internal successors, (856), 11 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:47,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 185.0) internal successors, (2220), 12 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:47,630 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 185.0) internal successors, (2220), 12 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:47,630 INFO L175 Difference]: Start difference. First operand has 75 places, 119 transitions, 1614 flow. Second operand 11 states and 856 transitions. [2022-12-13 22:07:47,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 165 transitions, 2260 flow [2022-12-13 22:07:47,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 165 transitions, 2205 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 22:07:47,640 INFO L231 Difference]: Finished difference. Result has 86 places, 121 transitions, 1743 flow [2022-12-13 22:07:47,640 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1743, PETRI_PLACES=86, PETRI_TRANSITIONS=121} [2022-12-13 22:07:47,641 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 60 predicate places. [2022-12-13 22:07:47,641 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 121 transitions, 1743 flow [2022-12-13 22:07:47,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:47,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:47,641 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:47,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:07:47,641 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1270609281, now seen corresponding path program 2 times [2022-12-13 22:07:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441067792] [2022-12-13 22:07:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:48,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:48,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441067792] [2022-12-13 22:07:48,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441067792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:48,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:48,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:07:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543833632] [2022-12-13 22:07:48,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:48,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 22:07:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 22:07:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:07:48,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 185 [2022-12-13 22:07:48,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 121 transitions, 1743 flow. Second operand has 8 states, 8 states have (on average 74.625) internal successors, (597), 8 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:48,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:48,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 185 [2022-12-13 22:07:48,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:48,618 INFO L130 PetriNetUnfolder]: 330/629 cut-off events. [2022-12-13 22:07:48,619 INFO L131 PetriNetUnfolder]: For 6437/6456 co-relation queries the response was YES. [2022-12-13 22:07:48,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 629 events. 330/629 cut-off events. For 6437/6456 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3014 event pairs, 56 based on Foata normal form. 23/652 useless extension candidates. Maximal degree in co-relation 4179. Up to 478 conditions per place. [2022-12-13 22:07:48,622 INFO L137 encePairwiseOnDemand]: 177/185 looper letters, 105 selfloop transitions, 37 changer transitions 0/145 dead transitions. [2022-12-13 22:07:48,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 145 transitions, 2234 flow [2022-12-13 22:07:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:07:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:07:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 556 transitions. [2022-12-13 22:07:48,624 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42934362934362935 [2022-12-13 22:07:48,624 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 556 transitions. [2022-12-13 22:07:48,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 556 transitions. [2022-12-13 22:07:48,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:48,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 556 transitions. [2022-12-13 22:07:48,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.42857142857143) internal successors, (556), 7 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:48,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:48,626 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:48,626 INFO L175 Difference]: Start difference. First operand has 86 places, 121 transitions, 1743 flow. Second operand 7 states and 556 transitions. [2022-12-13 22:07:48,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 145 transitions, 2234 flow [2022-12-13 22:07:48,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 145 transitions, 2161 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-12-13 22:07:48,641 INFO L231 Difference]: Finished difference. Result has 84 places, 131 transitions, 1946 flow [2022-12-13 22:07:48,641 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1946, PETRI_PLACES=84, PETRI_TRANSITIONS=131} [2022-12-13 22:07:48,641 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 58 predicate places. [2022-12-13 22:07:48,641 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 131 transitions, 1946 flow [2022-12-13 22:07:48,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.625) internal successors, (597), 8 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:48,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:48,642 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:48,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:07:48,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1271704821, now seen corresponding path program 3 times [2022-12-13 22:07:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:48,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486969158] [2022-12-13 22:07:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:48,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:49,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486969158] [2022-12-13 22:07:49,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486969158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:49,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:49,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 22:07:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620592687] [2022-12-13 22:07:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 22:07:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:49,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 22:07:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 22:07:49,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 185 [2022-12-13 22:07:49,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 131 transitions, 1946 flow. Second operand has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:49,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:49,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 185 [2022-12-13 22:07:49,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:49,943 INFO L130 PetriNetUnfolder]: 324/617 cut-off events. [2022-12-13 22:07:49,943 INFO L131 PetriNetUnfolder]: For 6686/6723 co-relation queries the response was YES. [2022-12-13 22:07:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4165 conditions, 617 events. 324/617 cut-off events. For 6686/6723 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2942 event pairs, 57 based on Foata normal form. 27/644 useless extension candidates. Maximal degree in co-relation 4126. Up to 413 conditions per place. [2022-12-13 22:07:49,947 INFO L137 encePairwiseOnDemand]: 176/185 looper letters, 82 selfloop transitions, 61 changer transitions 0/146 dead transitions. [2022-12-13 22:07:49,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 146 transitions, 2299 flow [2022-12-13 22:07:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:07:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:07:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 552 transitions. [2022-12-13 22:07:49,948 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42625482625482625 [2022-12-13 22:07:49,949 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 552 transitions. [2022-12-13 22:07:49,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 552 transitions. [2022-12-13 22:07:49,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:49,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 552 transitions. [2022-12-13 22:07:49,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:49,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:49,951 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:49,951 INFO L175 Difference]: Start difference. First operand has 84 places, 131 transitions, 1946 flow. Second operand 7 states and 552 transitions. [2022-12-13 22:07:49,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 146 transitions, 2299 flow [2022-12-13 22:07:49,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 146 transitions, 2225 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 22:07:49,966 INFO L231 Difference]: Finished difference. Result has 85 places, 131 transitions, 2014 flow [2022-12-13 22:07:49,966 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2014, PETRI_PLACES=85, PETRI_TRANSITIONS=131} [2022-12-13 22:07:49,967 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 59 predicate places. [2022-12-13 22:07:49,967 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 131 transitions, 2014 flow [2022-12-13 22:07:49,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:49,967 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:49,967 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:49,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:07:49,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1862455590, now seen corresponding path program 1 times [2022-12-13 22:07:49,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:49,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141625540] [2022-12-13 22:07:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:50,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141625540] [2022-12-13 22:07:50,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141625540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:50,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:50,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976297459] [2022-12-13 22:07:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:50,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:50,073 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 185 [2022-12-13 22:07:50,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 131 transitions, 2014 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:50,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 185 [2022-12-13 22:07:50,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:50,228 INFO L130 PetriNetUnfolder]: 173/365 cut-off events. [2022-12-13 22:07:50,228 INFO L131 PetriNetUnfolder]: For 6108/6159 co-relation queries the response was YES. [2022-12-13 22:07:50,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 365 events. 173/365 cut-off events. For 6108/6159 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1771 event pairs, 10 based on Foata normal form. 127/491 useless extension candidates. Maximal degree in co-relation 2396. Up to 189 conditions per place. [2022-12-13 22:07:50,230 INFO L137 encePairwiseOnDemand]: 180/185 looper letters, 87 selfloop transitions, 4 changer transitions 69/167 dead transitions. [2022-12-13 22:07:50,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 167 transitions, 2790 flow [2022-12-13 22:07:50,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:07:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:07:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-12-13 22:07:50,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46378378378378377 [2022-12-13 22:07:50,231 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 429 transitions. [2022-12-13 22:07:50,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 429 transitions. [2022-12-13 22:07:50,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:50,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 429 transitions. [2022-12-13 22:07:50,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,233 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,233 INFO L175 Difference]: Start difference. First operand has 85 places, 131 transitions, 2014 flow. Second operand 5 states and 429 transitions. [2022-12-13 22:07:50,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 167 transitions, 2790 flow [2022-12-13 22:07:50,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 167 transitions, 2502 flow, removed 59 selfloop flow, removed 14 redundant places. [2022-12-13 22:07:50,241 INFO L231 Difference]: Finished difference. Result has 75 places, 83 transitions, 1106 flow [2022-12-13 22:07:50,241 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1106, PETRI_PLACES=75, PETRI_TRANSITIONS=83} [2022-12-13 22:07:50,242 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 49 predicate places. [2022-12-13 22:07:50,242 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 1106 flow [2022-12-13 22:07:50,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,242 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:50,242 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:50,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:07:50,242 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1482673004, now seen corresponding path program 1 times [2022-12-13 22:07:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:50,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30658005] [2022-12-13 22:07:50,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:50,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:50,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30658005] [2022-12-13 22:07:50,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30658005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:50,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:50,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818032595] [2022-12-13 22:07:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:50,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:07:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:07:50,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:07:50,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 185 [2022-12-13 22:07:50,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 1106 flow. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:50,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 185 [2022-12-13 22:07:50,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:50,460 INFO L130 PetriNetUnfolder]: 67/174 cut-off events. [2022-12-13 22:07:50,460 INFO L131 PetriNetUnfolder]: For 2156/2170 co-relation queries the response was YES. [2022-12-13 22:07:50,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 174 events. 67/174 cut-off events. For 2156/2170 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 699 event pairs, 5 based on Foata normal form. 38/211 useless extension candidates. Maximal degree in co-relation 1125. Up to 81 conditions per place. [2022-12-13 22:07:50,462 INFO L137 encePairwiseOnDemand]: 180/185 looper letters, 68 selfloop transitions, 6 changer transitions 21/101 dead transitions. [2022-12-13 22:07:50,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 101 transitions, 1484 flow [2022-12-13 22:07:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:07:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:07:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 498 transitions. [2022-12-13 22:07:50,468 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2022-12-13 22:07:50,468 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 498 transitions. [2022-12-13 22:07:50,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 498 transitions. [2022-12-13 22:07:50,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:50,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 498 transitions. [2022-12-13 22:07:50,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,470 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,470 INFO L175 Difference]: Start difference. First operand has 75 places, 83 transitions, 1106 flow. Second operand 6 states and 498 transitions. [2022-12-13 22:07:50,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 101 transitions, 1484 flow [2022-12-13 22:07:50,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 1355 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-12-13 22:07:50,474 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 800 flow [2022-12-13 22:07:50,475 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=800, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2022-12-13 22:07:50,475 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 48 predicate places. [2022-12-13 22:07:50,475 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 800 flow [2022-12-13 22:07:50,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:50,475 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:50,475 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:50,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 22:07:50,475 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1950472297, now seen corresponding path program 1 times [2022-12-13 22:07:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:50,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541659393] [2022-12-13 22:07:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541659393] [2022-12-13 22:07:51,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541659393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:51,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:51,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 22:07:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487243420] [2022-12-13 22:07:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:51,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 22:07:51,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 22:07:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 22:07:51,356 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 185 [2022-12-13 22:07:51,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 800 flow. Second operand has 10 states, 10 states have (on average 75.6) internal successors, (756), 10 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:51,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:07:51,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 185 [2022-12-13 22:07:51,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:07:51,620 INFO L130 PetriNetUnfolder]: 50/156 cut-off events. [2022-12-13 22:07:51,620 INFO L131 PetriNetUnfolder]: For 1445/1455 co-relation queries the response was YES. [2022-12-13 22:07:51,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 156 events. 50/156 cut-off events. For 1445/1455 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 625 event pairs, 2 based on Foata normal form. 12/168 useless extension candidates. Maximal degree in co-relation 983. Up to 64 conditions per place. [2022-12-13 22:07:51,621 INFO L137 encePairwiseOnDemand]: 178/185 looper letters, 38 selfloop transitions, 23 changer transitions 27/91 dead transitions. [2022-12-13 22:07:51,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 1211 flow [2022-12-13 22:07:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 22:07:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 22:07:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 796 transitions. [2022-12-13 22:07:51,623 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43027027027027026 [2022-12-13 22:07:51,623 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 796 transitions. [2022-12-13 22:07:51,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 796 transitions. [2022-12-13 22:07:51,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:07:51,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 796 transitions. [2022-12-13 22:07:51,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.6) internal successors, (796), 10 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:51,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 185.0) internal successors, (2035), 11 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:51,628 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 185.0) internal successors, (2035), 11 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:51,628 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 800 flow. Second operand 10 states and 796 transitions. [2022-12-13 22:07:51,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 1211 flow [2022-12-13 22:07:51,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 1081 flow, removed 33 selfloop flow, removed 9 redundant places. [2022-12-13 22:07:51,633 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 672 flow [2022-12-13 22:07:51,633 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=672, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2022-12-13 22:07:51,633 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 48 predicate places. [2022-12-13 22:07:51,633 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 672 flow [2022-12-13 22:07:51,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.6) internal successors, (756), 10 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:51,634 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:07:51,634 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:51,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 22:07:51,634 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 22:07:51,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:51,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1113039883, now seen corresponding path program 2 times [2022-12-13 22:07:51,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:51,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242287309] [2022-12-13 22:07:51,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:07:51,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:07:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:07:51,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:07:51,739 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:07:51,740 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 22:07:51,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 22:07:51,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 22:07:51,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 22:07:51,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 22:07:51,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 22:07:51,743 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:51,748 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 22:07:51,748 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:07:51,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:07:51 BasicIcfg [2022-12-13 22:07:51,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:07:51,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:07:51,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:07:51,792 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:07:51,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:07:35" (3/4) ... [2022-12-13 22:07:51,793 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 22:07:51,852 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 22:07:51,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:07:51,852 INFO L158 Benchmark]: Toolchain (without parser) took 17734.82ms. Allocated memory was 136.3MB in the beginning and 285.2MB in the end (delta: 148.9MB). Free memory was 99.8MB in the beginning and 100.3MB in the end (delta: -484.2kB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. [2022-12-13 22:07:51,853 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 136.3MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:07:51,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.84ms. Allocated memory is still 136.3MB. Free memory was 99.3MB in the beginning and 72.1MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 22:07:51,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.97ms. Allocated memory is still 136.3MB. Free memory was 71.7MB in the beginning and 69.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:07:51,853 INFO L158 Benchmark]: Boogie Preprocessor took 21.64ms. Allocated memory is still 136.3MB. Free memory was 69.0MB in the beginning and 67.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:07:51,854 INFO L158 Benchmark]: RCFGBuilder took 543.88ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 67.0MB in the beginning and 99.6MB in the end (delta: -32.6MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2022-12-13 22:07:51,854 INFO L158 Benchmark]: TraceAbstraction took 16711.40ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 98.7MB in the beginning and 107.6MB in the end (delta: -8.9MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2022-12-13 22:07:51,854 INFO L158 Benchmark]: Witness Printer took 60.59ms. Allocated memory is still 285.2MB. Free memory was 107.6MB in the beginning and 100.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 22:07:51,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 136.3MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.84ms. Allocated memory is still 136.3MB. Free memory was 99.3MB in the beginning and 72.1MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.97ms. Allocated memory is still 136.3MB. Free memory was 71.7MB in the beginning and 69.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.64ms. Allocated memory is still 136.3MB. Free memory was 69.0MB in the beginning and 67.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.88ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 67.0MB in the beginning and 99.6MB in the end (delta: -32.6MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16711.40ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 98.7MB in the beginning and 107.6MB in the end (delta: -8.9MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. * Witness Printer took 60.59ms. Allocated memory is still 285.2MB. Free memory was 107.6MB in the beginning and 100.3MB in the end (delta: 7.3MB). 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: 3.0s, 100 PlacesBefore, 26 PlacesAfterwards, 95 TransitionsBefore, 19 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 3537 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1637, independent: 1474, independent conditional: 0, independent unconditional: 1474, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 741, independent: 698, independent conditional: 0, independent unconditional: 698, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1637, independent: 776, independent conditional: 0, independent unconditional: 776, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 741, unknown conditional: 0, unknown unconditional: 741] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1585; [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-1, t1585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1586; [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1586, ((void *)0), P1, ((void *)0))=0, t1585={5:0}, t1586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 __unbuffered_p1_EBX = y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=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=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 827]: 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: 829]: 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, 117 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: 16.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1023 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 815 mSDsluCounter, 940 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 756 mSDsCounter, 569 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1862 IncrementalHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 569 mSolverCounterUnsat, 184 mSDtfsCounter, 1862 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2014occurred in iteration=12, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 3248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 22:07:51,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_871306d1-f529-4b2c-9d0b-97df53a59310/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE