./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc --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 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 --- 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-5e519f3 [2022-11-02 20:12:01,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:12:01,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:12:01,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:12:01,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:12:01,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:12:01,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:12:01,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:12:01,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:12:01,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:12:01,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:12:01,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:12:01,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:12:01,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:12:01,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:12:01,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:12:01,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:12:01,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:12:01,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:12:01,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:12:01,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:12:01,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:12:01,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:12:01,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:12:01,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:12:01,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:12:01,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:12:01,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:12:01,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:12:01,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:12:01,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:12:01,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:12:01,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:12:01,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:12:01,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:12:01,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:12:01,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:12:01,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:12:01,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:12:01,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:12:01,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:12:01,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:12:01,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:12:01,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:12:01,746 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:12:01,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:12:01,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:12:01,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:12:01,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:12:01,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:12:01,749 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:12:01,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:12:01,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:12:01,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:12:01,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:12:01,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:12:01,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:12:01,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:12:01,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:12:01,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:12:01,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:12:01,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:12:01,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:12:01,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:12:01,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:12:01,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:12:01,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:12:01,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:12:01,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:12:01,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:12:01,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:12:01,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:12:01,754 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:12:01,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:12:01,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:12:01,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/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_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc 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 -> 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 [2022-11-02 20:12:02,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:12:02,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:12:02,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:12:02,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:12:02,143 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:12:02,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-11-02 20:12:02,222 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/data/56b05b9e2/ecfef8124787422ca0033d74e5d45294/FLAG72741da54 [2022-11-02 20:12:03,000 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:12:03,001 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-11-02 20:12:03,019 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/data/56b05b9e2/ecfef8124787422ca0033d74e5d45294/FLAG72741da54 [2022-11-02 20:12:03,248 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/data/56b05b9e2/ecfef8124787422ca0033d74e5d45294 [2022-11-02 20:12:03,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:12:03,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:12:03,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:12:03,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:12:03,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:12:03,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:12:03" (1/1) ... [2022-11-02 20:12:03,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148ee128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:03, skipping insertion in model container [2022-11-02 20:12:03,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:12:03" (1/1) ... [2022-11-02 20:12:03,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:12:03,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:12:03,599 WARN L230 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_eccfdc26-741a-45c7-8813-3fb8ba200675/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-11-02 20:12:03,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:12:03,869 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:12:03,884 WARN L230 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_eccfdc26-741a-45c7-8813-3fb8ba200675/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-11-02 20:12:03,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:12:04,058 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:12:04,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04 WrapperNode [2022-11-02 20:12:04,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:12:04,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:12:04,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:12:04,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:12:04,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,123 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2022-11-02 20:12:04,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:12:04,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:12:04,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:12:04,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:12:04,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,157 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:12:04,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:12:04,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:12:04,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:12:04,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (1/1) ... [2022-11-02 20:12:04,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:12:04,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:04,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:12:04,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:12:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:12:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:12:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:12:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:12:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:12:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:12:04,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:12:04,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:12:04,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:12:04,279 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 20:12:04,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 20:12:04,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:12:04,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:12:04,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:12:04,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:12:04,283 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:12:04,569 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:12:04,572 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:12:05,392 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:12:05,961 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:12:05,962 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:12:05,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:05 BoogieIcfgContainer [2022-11-02 20:12:05,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:12:05,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:12:05,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:12:05,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:12:05,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:12:03" (1/3) ... [2022-11-02 20:12:05,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c470a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:12:05, skipping insertion in model container [2022-11-02 20:12:05,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:04" (2/3) ... [2022-11-02 20:12:05,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c470a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:12:05, skipping insertion in model container [2022-11-02 20:12:05,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:05" (3/3) ... [2022-11-02 20:12:05,977 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2022-11-02 20:12:05,988 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:12:06,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:12:06,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:12:06,002 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:12:06,125 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:12:06,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-02 20:12:06,262 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-02 20:12:06,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:12:06,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-02 20:12:06,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-02 20:12:06,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-02 20:12:06,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:12:06,294 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;@b29ad10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:12:06,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 20:12:06,316 INFO L130 PetriNetUnfolder]: 0/60 cut-off events. [2022-11-02 20:12:06,317 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:12:06,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:06,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:06,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash -284253320, now seen corresponding path program 1 times [2022-11-02 20:12:06,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:06,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877419533] [2022-11-02 20:12:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:06,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:07,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877419533] [2022-11-02 20:12:07,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877419533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:07,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:07,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632697323] [2022-11-02 20:12:07,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:07,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:07,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:07,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:07,169 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2022-11-02 20:12:07,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 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-11-02 20:12:07,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:07,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2022-11-02 20:12:07,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:07,418 INFO L130 PetriNetUnfolder]: 57/324 cut-off events. [2022-11-02 20:12:07,418 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:12:07,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 324 events. 57/324 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1320 event pairs, 11 based on Foata normal form. 12/319 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2022-11-02 20:12:07,428 INFO L137 encePairwiseOnDemand]: 110/115 looper letters, 13 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-02 20:12:07,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 113 transitions, 268 flow [2022-11-02 20:12:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2022-11-02 20:12:07,457 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.936231884057971 [2022-11-02 20:12:07,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2022-11-02 20:12:07,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2022-11-02 20:12:07,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:07,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2022-11-02 20:12:07,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:07,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:07,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:07,489 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 323 transitions. [2022-11-02 20:12:07,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 113 transitions, 268 flow [2022-11-02 20:12:07,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 113 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:12:07,505 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-11-02 20:12:07,507 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-11-02 20:12:07,512 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-11-02 20:12:07,512 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-11-02 20:12:07,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 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-11-02 20:12:07,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:07,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:07,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:12:07,515 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2047081111, now seen corresponding path program 1 times [2022-11-02 20:12:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:07,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206363817] [2022-11-02 20:12:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:08,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206363817] [2022-11-02 20:12:08,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206363817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:08,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:08,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:12:08,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498852176] [2022-11-02 20:12:08,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:08,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:12:08,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:08,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:12:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:12:08,326 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2022-11-02 20:12:08,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:08,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:08,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2022-11-02 20:12:08,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:09,144 INFO L130 PetriNetUnfolder]: 330/1069 cut-off events. [2022-11-02 20:12:09,144 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-02 20:12:09,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 1069 events. 330/1069 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7105 event pairs, 59 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1645. Up to 257 conditions per place. [2022-11-02 20:12:09,154 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 18 selfloop transitions, 2 changer transitions 45/145 dead transitions. [2022-11-02 20:12:09,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 422 flow [2022-11-02 20:12:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:12:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:12:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 902 transitions. [2022-11-02 20:12:09,164 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8714975845410629 [2022-11-02 20:12:09,164 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 902 transitions. [2022-11-02 20:12:09,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 902 transitions. [2022-11-02 20:12:09,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:09,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 902 transitions. [2022-11-02 20:12:09,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:09,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:09,176 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:09,177 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 902 transitions. [2022-11-02 20:12:09,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 422 flow [2022-11-02 20:12:09,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 145 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:09,185 INFO L231 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2022-11-02 20:12:09,186 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-11-02 20:12:09,187 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-11-02 20:12:09,187 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2022-11-02 20:12:09,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:09,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:09,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:12:09,190 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1250987432, now seen corresponding path program 1 times [2022-11-02 20:12:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:09,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708821648] [2022-11-02 20:12:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:09,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:09,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708821648] [2022-11-02 20:12:09,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708821648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:09,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:09,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:12:09,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069770415] [2022-11-02 20:12:09,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:09,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:12:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:09,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:12:09,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:12:09,837 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-11-02 20:12:09,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:09,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:09,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-11-02 20:12:09,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:10,448 INFO L130 PetriNetUnfolder]: 268/658 cut-off events. [2022-11-02 20:12:10,448 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-11-02 20:12:10,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 658 events. 268/658 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3654 event pairs, 58 based on Foata normal form. 16/646 useless extension candidates. Maximal degree in co-relation 1248. Up to 141 conditions per place. [2022-11-02 20:12:10,455 INFO L137 encePairwiseOnDemand]: 107/115 looper letters, 20 selfloop transitions, 4 changer transitions 32/134 dead transitions. [2022-11-02 20:12:10,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 134 transitions, 431 flow [2022-11-02 20:12:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:12:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:12:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions. [2022-11-02 20:12:10,460 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8504347826086956 [2022-11-02 20:12:10,460 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 978 transitions. [2022-11-02 20:12:10,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 978 transitions. [2022-11-02 20:12:10,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:10,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 978 transitions. [2022-11-02 20:12:10,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.8) internal successors, (978), 10 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:10,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:10,471 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:10,471 INFO L175 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 10 states and 978 transitions. [2022-11-02 20:12:10,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 134 transitions, 431 flow [2022-11-02 20:12:10,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 134 transitions, 397 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-02 20:12:10,482 INFO L231 Difference]: Finished difference. Result has 121 places, 96 transitions, 232 flow [2022-11-02 20:12:10,482 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=121, PETRI_TRANSITIONS=96} [2022-11-02 20:12:10,485 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2022-11-02 20:12:10,485 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 96 transitions, 232 flow [2022-11-02 20:12:10,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:10,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:10,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:10,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:12:10,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1258115765, now seen corresponding path program 1 times [2022-11-02 20:12:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:10,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394002941] [2022-11-02 20:12:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:11,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:11,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394002941] [2022-11-02 20:12:11,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394002941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:11,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:11,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:12:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318382833] [2022-11-02 20:12:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:11,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:12:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:12:11,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:12:11,743 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-11-02 20:12:11,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 96 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:11,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:11,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-11-02 20:12:11,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:12,278 INFO L130 PetriNetUnfolder]: 204/600 cut-off events. [2022-11-02 20:12:12,279 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-11-02 20:12:12,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 600 events. 204/600 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3045 event pairs, 102 based on Foata normal form. 12/581 useless extension candidates. Maximal degree in co-relation 1116. Up to 225 conditions per place. [2022-11-02 20:12:12,285 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 19 selfloop transitions, 6 changer transitions 28/131 dead transitions. [2022-11-02 20:12:12,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 131 transitions, 434 flow [2022-11-02 20:12:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:12:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:12:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1067 transitions. [2022-11-02 20:12:12,289 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8434782608695652 [2022-11-02 20:12:12,289 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1067 transitions. [2022-11-02 20:12:12,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1067 transitions. [2022-11-02 20:12:12,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:12,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1067 transitions. [2022-11-02 20:12:12,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:12,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:12,298 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:12,298 INFO L175 Difference]: Start difference. First operand has 121 places, 96 transitions, 232 flow. Second operand 11 states and 1067 transitions. [2022-11-02 20:12:12,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 131 transitions, 434 flow [2022-11-02 20:12:12,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 131 transitions, 388 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-11-02 20:12:12,304 INFO L231 Difference]: Finished difference. Result has 122 places, 99 transitions, 266 flow [2022-11-02 20:12:12,305 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=266, PETRI_PLACES=122, PETRI_TRANSITIONS=99} [2022-11-02 20:12:12,306 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2022-11-02 20:12:12,306 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 99 transitions, 266 flow [2022-11-02 20:12:12,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:12,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:12,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:12,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:12:12,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1598092007, now seen corresponding path program 1 times [2022-11-02 20:12:12,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:12,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725206615] [2022-11-02 20:12:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:12,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:12,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725206615] [2022-11-02 20:12:12,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725206615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:12,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:12,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:12:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217248694] [2022-11-02 20:12:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:12,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:12:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:12,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:12:12,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:12:12,688 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-11-02 20:12:12,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 99 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:12,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:12,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-11-02 20:12:12,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:13,483 INFO L130 PetriNetUnfolder]: 727/1607 cut-off events. [2022-11-02 20:12:13,484 INFO L131 PetriNetUnfolder]: For 2804/2884 co-relation queries the response was YES. [2022-11-02 20:12:13,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 1607 events. 727/1607 cut-off events. For 2804/2884 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9963 event pairs, 41 based on Foata normal form. 1/1558 useless extension candidates. Maximal degree in co-relation 4152. Up to 455 conditions per place. [2022-11-02 20:12:13,500 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 36 selfloop transitions, 7 changer transitions 43/163 dead transitions. [2022-11-02 20:12:13,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 163 transitions, 694 flow [2022-11-02 20:12:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:12:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:12:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2022-11-02 20:12:13,504 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8626086956521739 [2022-11-02 20:12:13,504 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2022-11-02 20:12:13,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2022-11-02 20:12:13,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:13,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2022-11-02 20:12:13,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:13,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:13,512 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:13,512 INFO L175 Difference]: Start difference. First operand has 122 places, 99 transitions, 266 flow. Second operand 10 states and 992 transitions. [2022-11-02 20:12:13,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 163 transitions, 694 flow [2022-11-02 20:12:13,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 163 transitions, 676 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-02 20:12:13,520 INFO L231 Difference]: Finished difference. Result has 125 places, 103 transitions, 314 flow [2022-11-02 20:12:13,521 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=314, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2022-11-02 20:12:13,524 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2022-11-02 20:12:13,524 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 314 flow [2022-11-02 20:12:13,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:13,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:13,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:13,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:12:13,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:13,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash 142029244, now seen corresponding path program 1 times [2022-11-02 20:12:13,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:13,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548843525] [2022-11-02 20:12:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:14,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:14,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548843525] [2022-11-02 20:12:14,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548843525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:14,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:14,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:12:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173411428] [2022-11-02 20:12:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:14,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:12:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:12:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:12:14,008 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-11-02 20:12:14,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 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-11-02 20:12:14,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:14,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-11-02 20:12:14,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:14,684 INFO L130 PetriNetUnfolder]: 333/951 cut-off events. [2022-11-02 20:12:14,684 INFO L131 PetriNetUnfolder]: For 2108/2152 co-relation queries the response was YES. [2022-11-02 20:12:14,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 951 events. 333/951 cut-off events. For 2108/2152 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5621 event pairs, 37 based on Foata normal form. 26/963 useless extension candidates. Maximal degree in co-relation 2926. Up to 220 conditions per place. [2022-11-02 20:12:14,695 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 44 selfloop transitions, 18 changer transitions 24/163 dead transitions. [2022-11-02 20:12:14,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 163 transitions, 889 flow [2022-11-02 20:12:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:12:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:12:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1087 transitions. [2022-11-02 20:12:14,701 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8592885375494071 [2022-11-02 20:12:14,701 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1087 transitions. [2022-11-02 20:12:14,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1087 transitions. [2022-11-02 20:12:14,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:14,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1087 transitions. [2022-11-02 20:12:14,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.81818181818181) internal successors, (1087), 11 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:14,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:14,711 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:14,712 INFO L175 Difference]: Start difference. First operand has 125 places, 103 transitions, 314 flow. Second operand 11 states and 1087 transitions. [2022-11-02 20:12:14,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 163 transitions, 889 flow [2022-11-02 20:12:14,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 163 transitions, 873 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-02 20:12:14,721 INFO L231 Difference]: Finished difference. Result has 133 places, 118 transitions, 491 flow [2022-11-02 20:12:14,721 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=491, PETRI_PLACES=133, PETRI_TRANSITIONS=118} [2022-11-02 20:12:14,722 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 13 predicate places. [2022-11-02 20:12:14,722 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 118 transitions, 491 flow [2022-11-02 20:12:14,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 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-11-02 20:12:14,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:14,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:14,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:12:14,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1608638447, now seen corresponding path program 1 times [2022-11-02 20:12:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:14,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857492108] [2022-11-02 20:12:14,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:14,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857492108] [2022-11-02 20:12:15,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857492108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:15,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:15,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:12:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583053518] [2022-11-02 20:12:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:15,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:12:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:15,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:12:15,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:12:15,211 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-11-02 20:12:15,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 118 transitions, 491 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:15,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:15,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-11-02 20:12:15,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:15,874 INFO L130 PetriNetUnfolder]: 278/833 cut-off events. [2022-11-02 20:12:15,875 INFO L131 PetriNetUnfolder]: For 2708/2780 co-relation queries the response was YES. [2022-11-02 20:12:15,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 833 events. 278/833 cut-off events. For 2708/2780 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5061 event pairs, 43 based on Foata normal form. 9/824 useless extension candidates. Maximal degree in co-relation 2918. Up to 186 conditions per place. [2022-11-02 20:12:15,883 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 37 selfloop transitions, 22 changer transitions 26/162 dead transitions. [2022-11-02 20:12:15,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 162 transitions, 959 flow [2022-11-02 20:12:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:12:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:12:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1351 transitions. [2022-11-02 20:12:15,889 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8391304347826087 [2022-11-02 20:12:15,889 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1351 transitions. [2022-11-02 20:12:15,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1351 transitions. [2022-11-02 20:12:15,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:15,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1351 transitions. [2022-11-02 20:12:15,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.5) internal successors, (1351), 14 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:15,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:15,899 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:15,899 INFO L175 Difference]: Start difference. First operand has 133 places, 118 transitions, 491 flow. Second operand 14 states and 1351 transitions. [2022-11-02 20:12:15,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 162 transitions, 959 flow [2022-11-02 20:12:15,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 162 transitions, 889 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-11-02 20:12:15,919 INFO L231 Difference]: Finished difference. Result has 150 places, 119 transitions, 509 flow [2022-11-02 20:12:15,919 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=509, PETRI_PLACES=150, PETRI_TRANSITIONS=119} [2022-11-02 20:12:15,920 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 30 predicate places. [2022-11-02 20:12:15,921 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 119 transitions, 509 flow [2022-11-02 20:12:15,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:15,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:15,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:15,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:12:15,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:15,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1041343206, now seen corresponding path program 1 times [2022-11-02 20:12:15,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:15,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832477347] [2022-11-02 20:12:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:17,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:17,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832477347] [2022-11-02 20:12:17,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832477347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:17,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:17,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:12:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48719262] [2022-11-02 20:12:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:17,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:12:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:12:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:12:17,098 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-11-02 20:12:17,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 119 transitions, 509 flow. Second operand has 11 states, 11 states have (on average 90.9090909090909) internal successors, (1000), 11 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:17,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:17,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-11-02 20:12:17,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:17,699 INFO L130 PetriNetUnfolder]: 152/924 cut-off events. [2022-11-02 20:12:17,700 INFO L131 PetriNetUnfolder]: For 2069/2119 co-relation queries the response was YES. [2022-11-02 20:12:17,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2714 conditions, 924 events. 152/924 cut-off events. For 2069/2119 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7718 event pairs, 16 based on Foata normal form. 1/870 useless extension candidates. Maximal degree in co-relation 2652. Up to 114 conditions per place. [2022-11-02 20:12:17,711 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 25 selfloop transitions, 2 changer transitions 24/147 dead transitions. [2022-11-02 20:12:17,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 743 flow [2022-11-02 20:12:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:12:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:12:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 933 transitions. [2022-11-02 20:12:17,715 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.811304347826087 [2022-11-02 20:12:17,715 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 933 transitions. [2022-11-02 20:12:17,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 933 transitions. [2022-11-02 20:12:17,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:17,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 933 transitions. [2022-11-02 20:12:17,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:17,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:17,723 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:17,724 INFO L175 Difference]: Start difference. First operand has 150 places, 119 transitions, 509 flow. Second operand 10 states and 933 transitions. [2022-11-02 20:12:17,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 743 flow [2022-11-02 20:12:17,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 147 transitions, 605 flow, removed 51 selfloop flow, removed 16 redundant places. [2022-11-02 20:12:17,754 INFO L231 Difference]: Finished difference. Result has 147 places, 119 transitions, 444 flow [2022-11-02 20:12:17,754 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=444, PETRI_PLACES=147, PETRI_TRANSITIONS=119} [2022-11-02 20:12:17,755 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 27 predicate places. [2022-11-02 20:12:17,755 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 119 transitions, 444 flow [2022-11-02 20:12:17,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.9090909090909) internal successors, (1000), 11 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:17,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:17,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:17,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:12:17,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-02 20:12:17,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1668637862, now seen corresponding path program 2 times [2022-11-02 20:12:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:17,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293156166] [2022-11-02 20:12:17,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:17,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:12:17,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:12:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:12:18,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:12:18,009 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:12:18,010 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-02 20:12:18,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-02 20:12:18,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-02 20:12:18,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-02 20:12:18,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-02 20:12:18,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 20:12:18,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:12:18,015 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:18,023 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:12:18,023 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:12:18,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:12:18 BasicIcfg [2022-11-02 20:12:18,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:12:18,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:12:18,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:12:18,253 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:12:18,254 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:05" (3/4) ... [2022-11-02 20:12:18,256 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:12:18,429 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:12:18,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:12:18,430 INFO L158 Benchmark]: Toolchain (without parser) took 15177.15ms. Allocated memory was 111.1MB in the beginning and 310.4MB in the end (delta: 199.2MB). Free memory was 72.0MB in the beginning and 130.6MB in the end (delta: -58.5MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. [2022-11-02 20:12:18,431 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 111.1MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:12:18,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 804.16ms. Allocated memory is still 111.1MB. Free memory was 71.8MB in the beginning and 73.4MB in the end (delta: -1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:12:18,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.80ms. Allocated memory is still 111.1MB. Free memory was 73.4MB in the beginning and 70.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:12:18,438 INFO L158 Benchmark]: Boogie Preprocessor took 41.32ms. Allocated memory is still 111.1MB. Free memory was 70.5MB in the beginning and 68.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:12:18,438 INFO L158 Benchmark]: RCFGBuilder took 1798.72ms. Allocated memory is still 111.1MB. Free memory was 68.1MB in the beginning and 43.8MB in the end (delta: 24.3MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-11-02 20:12:18,439 INFO L158 Benchmark]: TraceAbstraction took 12283.15ms. Allocated memory was 111.1MB in the beginning and 310.4MB in the end (delta: 199.2MB). Free memory was 43.1MB in the beginning and 157.8MB in the end (delta: -114.7MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2022-11-02 20:12:18,439 INFO L158 Benchmark]: Witness Printer took 177.46ms. Allocated memory is still 310.4MB. Free memory was 157.8MB in the beginning and 130.6MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-02 20:12:18,441 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.40ms. Allocated memory is still 111.1MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 804.16ms. Allocated memory is still 111.1MB. Free memory was 71.8MB in the beginning and 73.4MB in the end (delta: -1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.80ms. Allocated memory is still 111.1MB. Free memory was 73.4MB in the beginning and 70.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.32ms. Allocated memory is still 111.1MB. Free memory was 70.5MB in the beginning and 68.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1798.72ms. Allocated memory is still 111.1MB. Free memory was 68.1MB in the beginning and 43.8MB in the end (delta: 24.3MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12283.15ms. Allocated memory was 111.1MB in the beginning and 310.4MB in the end (delta: 199.2MB). Free memory was 43.1MB in the beginning and 157.8MB in the end (delta: -114.7MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * Witness Printer took 177.46ms. Allocated memory is still 310.4MB. Free memory was 157.8MB in the beginning and 130.6MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2284; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-2, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-1, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0: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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 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: 11.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 569 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 919 IncrementalHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 50 mSDtfsCounter, 919 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=509occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 2134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:12:18,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eccfdc26-741a-45c7-8813-3fb8ba200675/bin/uautomizer-Dbtcem3rbc/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