./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a --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 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 --- 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-b5237d8 [2022-11-21 16:36:29,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:36:29,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:36:29,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:36:29,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:36:29,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:36:29,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:36:29,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:36:29,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:36:29,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:36:29,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:36:29,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:36:29,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:36:29,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:36:29,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:36:29,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:36:29,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:36:29,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:36:29,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:36:29,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:36:29,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:36:29,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:36:29,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:36:29,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:36:29,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:36:29,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:36:29,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:36:29,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:36:29,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:36:29,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:36:29,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:36:29,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:36:29,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:36:29,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:36:29,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:36:29,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:36:29,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:36:29,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:36:29,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:36:29,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:36:29,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:36:29,798 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:36:29,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:36:29,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:36:29,824 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:36:29,825 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:36:29,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:36:29,826 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:36:29,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:36:29,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:36:29,827 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:36:29,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:36:29,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:36:29,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:36:29,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:36:29,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:36:29,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:36:29,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:36:29,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:36:29,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:36:29,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:36:29,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:36:29,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:36:29,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:36:29,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:36:29,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:36:29,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:36:29,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:36:29,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:36:29,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:36:29,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:36:29,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:36:29,833 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:36:29,834 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:36:29,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:36:29,834 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_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/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_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a 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 -> 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 [2022-11-21 16:36:30,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:36:30,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:36:30,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:36:30,213 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:36:30,214 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:36:30,215 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:36:33,311 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:36:33,690 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:36:33,691 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:36:33,728 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/data/0f6c999ab/68314a683e0f4b3c913e941ed70d5a55/FLAGf6af0a0a3 [2022-11-21 16:36:33,760 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/data/0f6c999ab/68314a683e0f4b3c913e941ed70d5a55 [2022-11-21 16:36:33,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:36:33,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:36:33,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:36:33,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:36:33,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:36:33,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:36:33" (1/1) ... [2022-11-21 16:36:33,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103bf0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:33, skipping insertion in model container [2022-11-21 16:36:33,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:36:33" (1/1) ... [2022-11-21 16:36:33,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:36:33,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:36:34,057 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-11-21 16:36:34,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:36:34,408 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:36:34,423 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-11-21 16:36:34,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:36:34,506 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:36:34,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34 WrapperNode [2022-11-21 16:36:34,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:36:34,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:36:34,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:36:34,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:36:34,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,601 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-11-21 16:36:34,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:36:34,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:36:34,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:36:34,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:36:34,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,659 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:36:34,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:36:34,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:36:34,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:36:34,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (1/1) ... [2022-11-21 16:36:34,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:36:34,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:36:34,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:36:34,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:36:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:36:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:36:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:36:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:36:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:36:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:36:34,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:36:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:36:34,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:36:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:36:34,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:36:34,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:36:34,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:36:34,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:36:34,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:36:34,776 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:36:34,972 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:36:34,974 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:36:35,421 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:36:35,720 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:36:35,721 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:36:35,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:36:35 BoogieIcfgContainer [2022-11-21 16:36:35,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:36:35,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:36:35,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:36:35,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:36:35,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:36:33" (1/3) ... [2022-11-21 16:36:35,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186403f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:36:35, skipping insertion in model container [2022-11-21 16:36:35,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:36:34" (2/3) ... [2022-11-21 16:36:35,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186403f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:36:35, skipping insertion in model container [2022-11-21 16:36:35,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:36:35" (3/3) ... [2022-11-21 16:36:35,735 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:36:35,746 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:36:35,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:36:35,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 16:36:35,761 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:36:35,829 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:36:35,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-11-21 16:36:35,934 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-21 16:36:35,934 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:36:35,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-21 16:36:35,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-11-21 16:36:35,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-11-21 16:36:35,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:36:35,967 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;@70cfd81c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:36:35,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-21 16:36:35,991 INFO L130 PetriNetUnfolder]: 0/58 cut-off events. [2022-11-21 16:36:35,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:36:35,991 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:35,992 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:35,993 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-21 16:36:35,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1951019628, now seen corresponding path program 1 times [2022-11-21 16:36:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:36,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912040026] [2022-11-21 16:36:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:36,844 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-21 16:36:36,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:36,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912040026] [2022-11-21 16:36:36,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912040026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:36,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:36,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:36:36,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871045071] [2022-11-21 16:36:36,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:36,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:36:36,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:36,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:36:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:36:36,938 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2022-11-21 16:36:36,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-21 16:36:36,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:36,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2022-11-21 16:36:36,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:37,182 INFO L130 PetriNetUnfolder]: 37/289 cut-off events. [2022-11-21 16:36:37,183 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-21 16:36:37,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 289 events. 37/289 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1073 event pairs, 19 based on Foata normal form. 7/274 useless extension candidates. Maximal degree in co-relation 331. Up to 51 conditions per place. [2022-11-21 16:36:37,190 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 11 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2022-11-21 16:36:37,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 110 transitions, 258 flow [2022-11-21 16:36:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:36:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:36:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-11-21 16:36:37,206 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-11-21 16:36:37,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-11-21 16:36:37,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-11-21 16:36:37,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:37,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-11-21 16:36:37,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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-21 16:36:37,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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-21 16:36:37,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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-21 16:36:37,229 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-11-21 16:36:37,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 110 transitions, 258 flow [2022-11-21 16:36:37,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 254 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 16:36:37,238 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-11-21 16:36:37,240 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-11-21 16:36:37,245 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-11-21 16:36:37,247 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-11-21 16:36:37,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-21 16:36:37,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:37,248 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:37,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:36:37,249 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-21 16:36:37,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1616394896, now seen corresponding path program 1 times [2022-11-21 16:36:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:37,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964938445] [2022-11-21 16:36:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:37,987 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-21 16:36:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:37,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964938445] [2022-11-21 16:36:37,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964938445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:37,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:37,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:36:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949370565] [2022-11-21 16:36:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:38,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:36:38,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:38,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:36:38,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:36:38,007 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-21 16:36:38,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-21 16:36:38,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:38,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-21 16:36:38,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:39,608 INFO L130 PetriNetUnfolder]: 1703/4607 cut-off events. [2022-11-21 16:36:39,608 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-11-21 16:36:39,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 4607 events. 1703/4607 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 39926 event pairs, 157 based on Foata normal form. 0/4465 useless extension candidates. Maximal degree in co-relation 7407. Up to 799 conditions per place. [2022-11-21 16:36:39,641 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 34 selfloop transitions, 8 changer transitions 90/205 dead transitions. [2022-11-21 16:36:39,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 205 transitions, 688 flow [2022-11-21 16:36:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:36:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 16:36:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1255 transitions. [2022-11-21 16:36:39,655 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8543226684819605 [2022-11-21 16:36:39,656 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1255 transitions. [2022-11-21 16:36:39,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1255 transitions. [2022-11-21 16:36:39,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:39,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1255 transitions. [2022-11-21 16:36:39,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.53846153846153) internal successors, (1255), 13 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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-21 16:36:39,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 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-21 16:36:39,671 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 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-21 16:36:39,671 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 13 states and 1255 transitions. [2022-11-21 16:36:39,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 205 transitions, 688 flow [2022-11-21 16:36:39,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 205 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:36:39,681 INFO L231 Difference]: Finished difference. Result has 137 places, 101 transitions, 290 flow [2022-11-21 16:36:39,682 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=290, PETRI_PLACES=137, PETRI_TRANSITIONS=101} [2022-11-21 16:36:39,683 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2022-11-21 16:36:39,683 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 101 transitions, 290 flow [2022-11-21 16:36:39,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-21 16:36:39,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:39,685 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:39,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:36:39,686 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-21 16:36:39,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash -285989073, now seen corresponding path program 1 times [2022-11-21 16:36:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:39,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869932626] [2022-11-21 16:36:39,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:39,971 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-21 16:36:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:39,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869932626] [2022-11-21 16:36:39,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869932626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:39,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:36:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878668549] [2022-11-21 16:36:39,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:39,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:36:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:39,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:36:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:36:39,976 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-21 16:36:39,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 101 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:36:39,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:39,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-21 16:36:39,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:40,914 INFO L130 PetriNetUnfolder]: 945/2136 cut-off events. [2022-11-21 16:36:40,914 INFO L131 PetriNetUnfolder]: For 3770/3781 co-relation queries the response was YES. [2022-11-21 16:36:40,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6134 conditions, 2136 events. 945/2136 cut-off events. For 3770/3781 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14842 event pairs, 375 based on Foata normal form. 62/2106 useless extension candidates. Maximal degree in co-relation 6071. Up to 902 conditions per place. [2022-11-21 16:36:40,933 INFO L137 encePairwiseOnDemand]: 106/113 looper letters, 23 selfloop transitions, 5 changer transitions 49/158 dead transitions. [2022-11-21 16:36:40,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 158 transitions, 762 flow [2022-11-21 16:36:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:36:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:36:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2022-11-21 16:36:40,937 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8672566371681416 [2022-11-21 16:36:40,938 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 882 transitions. [2022-11-21 16:36:40,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions. [2022-11-21 16:36:40,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:40,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions. [2022-11-21 16:36:40,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-21 16:36:40,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-21 16:36:40,945 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-21 16:36:40,946 INFO L175 Difference]: Start difference. First operand has 137 places, 101 transitions, 290 flow. Second operand 9 states and 882 transitions. [2022-11-21 16:36:40,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 158 transitions, 762 flow [2022-11-21 16:36:40,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 158 transitions, 740 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-11-21 16:36:40,965 INFO L231 Difference]: Finished difference. Result has 128 places, 104 transitions, 357 flow [2022-11-21 16:36:40,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=357, PETRI_PLACES=128, PETRI_TRANSITIONS=104} [2022-11-21 16:36:40,966 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2022-11-21 16:36:40,967 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 104 transitions, 357 flow [2022-11-21 16:36:40,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:36:40,968 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:40,968 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:40,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:36:40,968 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-21 16:36:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash -654866482, now seen corresponding path program 1 times [2022-11-21 16:36:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:40,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878980387] [2022-11-21 16:36:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:41,302 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-21 16:36:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878980387] [2022-11-21 16:36:41,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878980387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:41,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:41,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:36:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036780914] [2022-11-21 16:36:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:41,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:36:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:41,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:36:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:36:41,307 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-21 16:36:41,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 104 transitions, 357 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 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-21 16:36:41,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:41,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-21 16:36:41,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:42,546 INFO L130 PetriNetUnfolder]: 1949/4175 cut-off events. [2022-11-21 16:36:42,546 INFO L131 PetriNetUnfolder]: For 4574/5333 co-relation queries the response was YES. [2022-11-21 16:36:42,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9827 conditions, 4175 events. 1949/4175 cut-off events. For 4574/5333 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 33102 event pairs, 107 based on Foata normal form. 105/4043 useless extension candidates. Maximal degree in co-relation 9758. Up to 1135 conditions per place. [2022-11-21 16:36:42,584 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 64 selfloop transitions, 15 changer transitions 8/171 dead transitions. [2022-11-21 16:36:42,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 171 transitions, 753 flow [2022-11-21 16:36:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:36:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:36:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 981 transitions. [2022-11-21 16:36:42,589 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.868141592920354 [2022-11-21 16:36:42,589 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 981 transitions. [2022-11-21 16:36:42,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 981 transitions. [2022-11-21 16:36:42,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:42,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 981 transitions. [2022-11-21 16:36:42,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.1) internal successors, (981), 10 states have internal predecessors, (981), 0 states have call successors, (0), 0 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-21 16:36:42,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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-21 16:36:42,603 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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-21 16:36:42,604 INFO L175 Difference]: Start difference. First operand has 128 places, 104 transitions, 357 flow. Second operand 10 states and 981 transitions. [2022-11-21 16:36:42,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 171 transitions, 753 flow [2022-11-21 16:36:42,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 171 transitions, 726 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-11-21 16:36:42,622 INFO L231 Difference]: Finished difference. Result has 133 places, 117 transitions, 439 flow [2022-11-21 16:36:42,622 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=439, PETRI_PLACES=133, PETRI_TRANSITIONS=117} [2022-11-21 16:36:42,624 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 15 predicate places. [2022-11-21 16:36:42,630 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 117 transitions, 439 flow [2022-11-21 16:36:42,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 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-21 16:36:42,631 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:42,631 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:42,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:36:42,632 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-21 16:36:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1996922767, now seen corresponding path program 1 times [2022-11-21 16:36:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:42,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526457919] [2022-11-21 16:36:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:42,997 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-21 16:36:42,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:42,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526457919] [2022-11-21 16:36:42,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526457919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:42,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:42,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:36:42,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859414132] [2022-11-21 16:36:42,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:42,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:36:42,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:43,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:36:43,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:36:43,001 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-21 16:36:43,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 117 transitions, 439 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 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-21 16:36:43,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:43,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-21 16:36:43,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:44,287 INFO L130 PetriNetUnfolder]: 1708/3796 cut-off events. [2022-11-21 16:36:44,288 INFO L131 PetriNetUnfolder]: For 6476/6973 co-relation queries the response was YES. [2022-11-21 16:36:44,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11410 conditions, 3796 events. 1708/3796 cut-off events. For 6476/6973 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 31386 event pairs, 102 based on Foata normal form. 173/3814 useless extension candidates. Maximal degree in co-relation 11336. Up to 676 conditions per place. [2022-11-21 16:36:44,319 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 68 selfloop transitions, 30 changer transitions 23/205 dead transitions. [2022-11-21 16:36:44,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 205 transitions, 1137 flow [2022-11-21 16:36:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:36:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 16:36:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1276 transitions. [2022-11-21 16:36:44,324 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8686181075561606 [2022-11-21 16:36:44,324 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1276 transitions. [2022-11-21 16:36:44,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1276 transitions. [2022-11-21 16:36:44,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:44,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1276 transitions. [2022-11-21 16:36:44,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.15384615384616) internal successors, (1276), 13 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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-21 16:36:44,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 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-21 16:36:44,332 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 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-21 16:36:44,333 INFO L175 Difference]: Start difference. First operand has 133 places, 117 transitions, 439 flow. Second operand 13 states and 1276 transitions. [2022-11-21 16:36:44,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 205 transitions, 1137 flow [2022-11-21 16:36:44,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 205 transitions, 1118 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-21 16:36:44,377 INFO L231 Difference]: Finished difference. Result has 144 places, 137 transitions, 658 flow [2022-11-21 16:36:44,378 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=658, PETRI_PLACES=144, PETRI_TRANSITIONS=137} [2022-11-21 16:36:44,381 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2022-11-21 16:36:44,381 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 137 transitions, 658 flow [2022-11-21 16:36:44,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 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-21 16:36:44,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:44,382 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:44,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:36:44,383 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-21 16:36:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1951057456, now seen corresponding path program 1 times [2022-11-21 16:36:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:44,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315691540] [2022-11-21 16:36:44,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:45,338 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-21 16:36:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:45,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315691540] [2022-11-21 16:36:45,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315691540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:45,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:45,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:36:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962565453] [2022-11-21 16:36:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:45,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:36:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:45,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:36:45,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:36:45,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-21 16:36:45,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 137 transitions, 658 flow. Second operand has 8 states, 8 states have (on average 91.25) internal successors, (730), 8 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-21 16:36:45,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:45,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-21 16:36:45,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:46,314 INFO L130 PetriNetUnfolder]: 658/2786 cut-off events. [2022-11-21 16:36:46,314 INFO L131 PetriNetUnfolder]: For 7056/7436 co-relation queries the response was YES. [2022-11-21 16:36:46,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8573 conditions, 2786 events. 658/2786 cut-off events. For 7056/7436 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 29582 event pairs, 19 based on Foata normal form. 13/2645 useless extension candidates. Maximal degree in co-relation 8493. Up to 695 conditions per place. [2022-11-21 16:36:46,355 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 30 selfloop transitions, 10 changer transitions 12/169 dead transitions. [2022-11-21 16:36:46,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 169 transitions, 896 flow [2022-11-21 16:36:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:36:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:36:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 851 transitions. [2022-11-21 16:36:46,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8367748279252704 [2022-11-21 16:36:46,360 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 851 transitions. [2022-11-21 16:36:46,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 851 transitions. [2022-11-21 16:36:46,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:46,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 851 transitions. [2022-11-21 16:36:46,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 0 states have call successors, (0), 0 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-21 16:36:46,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-21 16:36:46,369 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-21 16:36:46,370 INFO L175 Difference]: Start difference. First operand has 144 places, 137 transitions, 658 flow. Second operand 9 states and 851 transitions. [2022-11-21 16:36:46,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 169 transitions, 896 flow [2022-11-21 16:36:46,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 169 transitions, 785 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-11-21 16:36:46,536 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 633 flow [2022-11-21 16:36:46,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=633, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2022-11-21 16:36:46,540 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-11-21 16:36:46,540 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 633 flow [2022-11-21 16:36:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.25) internal successors, (730), 8 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-21 16:36:46,541 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:46,542 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:46,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:36:46,543 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-21 16:36:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1348102650, now seen corresponding path program 2 times [2022-11-21 16:36:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:46,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575351085] [2022-11-21 16:36:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:46,942 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-21 16:36:46,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:46,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575351085] [2022-11-21 16:36:46,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575351085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:46,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:46,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:36:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565263537] [2022-11-21 16:36:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:46,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:36:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:46,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:36:46,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:36:46,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-21 16:36:46,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 633 flow. Second operand has 7 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 0 states have call successors, (0), 0 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-21 16:36:46,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:46,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-21 16:36:46,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:47,963 INFO L130 PetriNetUnfolder]: 869/3573 cut-off events. [2022-11-21 16:36:47,963 INFO L131 PetriNetUnfolder]: For 4282/4353 co-relation queries the response was YES. [2022-11-21 16:36:47,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9233 conditions, 3573 events. 869/3573 cut-off events. For 4282/4353 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 39487 event pairs, 28 based on Foata normal form. 18/3401 useless extension candidates. Maximal degree in co-relation 9153. Up to 349 conditions per place. [2022-11-21 16:36:48,001 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 60 selfloop transitions, 14 changer transitions 36/216 dead transitions. [2022-11-21 16:36:48,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 216 transitions, 1322 flow [2022-11-21 16:36:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:36:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 16:36:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1212 transitions. [2022-11-21 16:36:48,005 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8250510551395507 [2022-11-21 16:36:48,005 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1212 transitions. [2022-11-21 16:36:48,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1212 transitions. [2022-11-21 16:36:48,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:48,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1212 transitions. [2022-11-21 16:36:48,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.23076923076923) internal successors, (1212), 13 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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-21 16:36:48,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 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-21 16:36:48,015 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 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-21 16:36:48,015 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 633 flow. Second operand 13 states and 1212 transitions. [2022-11-21 16:36:48,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 216 transitions, 1322 flow [2022-11-21 16:36:48,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 216 transitions, 1288 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-11-21 16:36:48,104 INFO L231 Difference]: Finished difference. Result has 167 places, 153 transitions, 776 flow [2022-11-21 16:36:48,105 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=776, PETRI_PLACES=167, PETRI_TRANSITIONS=153} [2022-11-21 16:36:48,106 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 49 predicate places. [2022-11-21 16:36:48,106 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 153 transitions, 776 flow [2022-11-21 16:36:48,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 0 states have call successors, (0), 0 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-21 16:36:48,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:48,107 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:48,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:36:48,107 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-21 16:36:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash -954386266, now seen corresponding path program 1 times [2022-11-21 16:36:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:48,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750792932] [2022-11-21 16:36:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:48,396 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-21 16:36:48,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:48,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750792932] [2022-11-21 16:36:48,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750792932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:48,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:48,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:36:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101511663] [2022-11-21 16:36:48,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:48,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:36:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:48,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:36:48,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:36:48,401 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-21 16:36:48,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 153 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 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-21 16:36:48,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:48,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-21 16:36:48,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:49,455 INFO L130 PetriNetUnfolder]: 1203/4890 cut-off events. [2022-11-21 16:36:49,456 INFO L131 PetriNetUnfolder]: For 6883/7003 co-relation queries the response was YES. [2022-11-21 16:36:49,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12639 conditions, 4890 events. 1203/4890 cut-off events. For 6883/7003 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 59517 event pairs, 47 based on Foata normal form. 17/4673 useless extension candidates. Maximal degree in co-relation 12551. Up to 539 conditions per place. [2022-11-21 16:36:49,519 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 44 selfloop transitions, 6 changer transitions 19/185 dead transitions. [2022-11-21 16:36:49,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 1111 flow [2022-11-21 16:36:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:36:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 16:36:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2022-11-21 16:36:49,522 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8657817109144543 [2022-11-21 16:36:49,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 587 transitions. [2022-11-21 16:36:49,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions. [2022-11-21 16:36:49,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:49,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions. [2022-11-21 16:36:49,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:36:49,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-21 16:36:49,527 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-21 16:36:49,528 INFO L175 Difference]: Start difference. First operand has 167 places, 153 transitions, 776 flow. Second operand 6 states and 587 transitions. [2022-11-21 16:36:49,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 185 transitions, 1111 flow [2022-11-21 16:36:49,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 1057 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-11-21 16:36:49,722 INFO L231 Difference]: Finished difference. Result has 158 places, 152 transitions, 772 flow [2022-11-21 16:36:49,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=158, PETRI_TRANSITIONS=152} [2022-11-21 16:36:49,725 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2022-11-21 16:36:49,726 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 152 transitions, 772 flow [2022-11-21 16:36:49,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 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-21 16:36:49,726 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:49,726 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:36:49,727 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-21 16:36:49,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash 973918212, now seen corresponding path program 2 times [2022-11-21 16:36:49,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:49,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824304749] [2022-11-21 16:36:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:50,105 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-21 16:36:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824304749] [2022-11-21 16:36:50,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824304749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:50,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:50,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:36:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252626160] [2022-11-21 16:36:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:50,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:36:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:36:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:36:50,109 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-21 16:36:50,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 152 transitions, 772 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-21 16:36:50,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:50,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-21 16:36:50,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:52,902 INFO L130 PetriNetUnfolder]: 4723/11050 cut-off events. [2022-11-21 16:36:52,903 INFO L131 PetriNetUnfolder]: For 23257/24828 co-relation queries the response was YES. [2022-11-21 16:36:52,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35551 conditions, 11050 events. 4723/11050 cut-off events. For 23257/24828 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 118163 event pairs, 107 based on Foata normal form. 548/11374 useless extension candidates. Maximal degree in co-relation 35517. Up to 1425 conditions per place. [2022-11-21 16:36:52,986 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 24 selfloop transitions, 12 changer transitions 166/280 dead transitions. [2022-11-21 16:36:52,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 280 transitions, 2139 flow [2022-11-21 16:36:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:36:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-21 16:36:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1537 transitions. [2022-11-21 16:36:52,991 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8501106194690266 [2022-11-21 16:36:52,991 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1537 transitions. [2022-11-21 16:36:52,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1537 transitions. [2022-11-21 16:36:52,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:52,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1537 transitions. [2022-11-21 16:36:52,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 96.0625) internal successors, (1537), 16 states have internal predecessors, (1537), 0 states have call successors, (0), 0 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-21 16:36:53,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 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-21 16:36:53,002 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 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-21 16:36:53,002 INFO L175 Difference]: Start difference. First operand has 158 places, 152 transitions, 772 flow. Second operand 16 states and 1537 transitions. [2022-11-21 16:36:53,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 280 transitions, 2139 flow [2022-11-21 16:36:53,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 280 transitions, 1947 flow, removed 93 selfloop flow, removed 10 redundant places. [2022-11-21 16:36:53,560 INFO L231 Difference]: Finished difference. Result has 166 places, 106 transitions, 415 flow [2022-11-21 16:36:53,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=415, PETRI_PLACES=166, PETRI_TRANSITIONS=106} [2022-11-21 16:36:53,561 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 48 predicate places. [2022-11-21 16:36:53,562 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 106 transitions, 415 flow [2022-11-21 16:36:53,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-21 16:36:53,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:53,563 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:53,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:36:53,563 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:36:53,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash 936597394, now seen corresponding path program 1 times [2022-11-21 16:36:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:53,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111132121] [2022-11-21 16:36:53,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:36:55,029 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-21 16:36:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:36:55,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111132121] [2022-11-21 16:36:55,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111132121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:36:55,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:36:55,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 16:36:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898706727] [2022-11-21 16:36:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:36:55,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:36:55,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:36:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:36:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:36:55,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2022-11-21 16:36:55,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 106 transitions, 415 flow. Second operand has 11 states, 11 states have (on average 87.0909090909091) internal successors, (958), 11 states have internal predecessors, (958), 0 states have call successors, (0), 0 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-21 16:36:55,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:36:55,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2022-11-21 16:36:55,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:36:55,404 INFO L130 PetriNetUnfolder]: 29/277 cut-off events. [2022-11-21 16:36:55,404 INFO L131 PetriNetUnfolder]: For 358/372 co-relation queries the response was YES. [2022-11-21 16:36:55,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 277 events. 29/277 cut-off events. For 358/372 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1097 event pairs, 3 based on Foata normal form. 2/272 useless extension candidates. Maximal degree in co-relation 636. Up to 27 conditions per place. [2022-11-21 16:36:55,406 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 22 selfloop transitions, 5 changer transitions 10/116 dead transitions. [2022-11-21 16:36:55,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 116 transitions, 531 flow [2022-11-21 16:36:55,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:36:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 16:36:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 969 transitions. [2022-11-21 16:36:55,410 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7795655671761866 [2022-11-21 16:36:55,410 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 969 transitions. [2022-11-21 16:36:55,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 969 transitions. [2022-11-21 16:36:55,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:36:55,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 969 transitions. [2022-11-21 16:36:55,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.0909090909091) internal successors, (969), 11 states have internal predecessors, (969), 0 states have call successors, (0), 0 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-21 16:36:55,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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-21 16:36:55,418 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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-21 16:36:55,419 INFO L175 Difference]: Start difference. First operand has 166 places, 106 transitions, 415 flow. Second operand 11 states and 969 transitions. [2022-11-21 16:36:55,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 116 transitions, 531 flow [2022-11-21 16:36:55,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 404 flow, removed 23 selfloop flow, removed 30 redundant places. [2022-11-21 16:36:55,424 INFO L231 Difference]: Finished difference. Result has 130 places, 104 transitions, 309 flow [2022-11-21 16:36:55,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=309, PETRI_PLACES=130, PETRI_TRANSITIONS=104} [2022-11-21 16:36:55,426 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2022-11-21 16:36:55,426 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 104 transitions, 309 flow [2022-11-21 16:36:55,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.0909090909091) internal successors, (958), 11 states have internal predecessors, (958), 0 states have call successors, (0), 0 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-21 16:36:55,427 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:36:55,427 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:36:55,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:36:55,428 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:36:55,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:36:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1149891142, now seen corresponding path program 2 times [2022-11-21 16:36:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:36:55,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876312474] [2022-11-21 16:36:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:36:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:36:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:36:55,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:36:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:36:55,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:36:55,550 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:36:55,552 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-21 16:36:55,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-21 16:36:55,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-21 16:36:55,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-21 16:36:55,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-21 16:36:55,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-21 16:36:55,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:36:55,556 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-21 16:36:55,564 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:36:55,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:36:55,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:36:55 BasicIcfg [2022-11-21 16:36:55,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:36:55,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:36:55,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:36:55,781 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:36:55,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:36:35" (3/4) ... [2022-11-21 16:36:55,784 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 16:36:55,955 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:36:55,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:36:55,957 INFO L158 Benchmark]: Toolchain (without parser) took 22189.29ms. Allocated memory was 155.2MB in the beginning and 914.4MB in the end (delta: 759.2MB). Free memory was 127.0MB in the beginning and 672.5MB in the end (delta: -545.4MB). Peak memory consumption was 213.8MB. Max. memory is 16.1GB. [2022-11-21 16:36:55,957 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 111.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:36:55,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.46ms. Allocated memory is still 155.2MB. Free memory was 126.6MB in the beginning and 104.0MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-21 16:36:55,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.77ms. Allocated memory is still 155.2MB. Free memory was 104.0MB in the beginning and 101.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:36:55,958 INFO L158 Benchmark]: Boogie Preprocessor took 62.16ms. Allocated memory is still 155.2MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:36:55,959 INFO L158 Benchmark]: RCFGBuilder took 1059.12ms. Allocated memory is still 155.2MB. Free memory was 99.3MB in the beginning and 67.0MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-21 16:36:55,959 INFO L158 Benchmark]: TraceAbstraction took 20052.53ms. Allocated memory was 155.2MB in the beginning and 914.4MB in the end (delta: 759.2MB). Free memory was 66.5MB in the beginning and 694.5MB in the end (delta: -628.0MB). Peak memory consumption was 527.3MB. Max. memory is 16.1GB. [2022-11-21 16:36:55,960 INFO L158 Benchmark]: Witness Printer took 176.07ms. Allocated memory is still 914.4MB. Free memory was 694.5MB in the beginning and 672.5MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-21 16:36:55,962 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.22ms. Allocated memory is still 111.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 734.46ms. Allocated memory is still 155.2MB. Free memory was 126.6MB in the beginning and 104.0MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.77ms. Allocated memory is still 155.2MB. Free memory was 104.0MB in the beginning and 101.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.16ms. Allocated memory is still 155.2MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1059.12ms. Allocated memory is still 155.2MB. Free memory was 99.3MB in the beginning and 67.0MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20052.53ms. Allocated memory was 155.2MB in the beginning and 914.4MB in the end (delta: 759.2MB). Free memory was 66.5MB in the beginning and 694.5MB in the end (delta: -628.0MB). Peak memory consumption was 527.3MB. Max. memory is 16.1GB. * Witness Printer took 176.07ms. Allocated memory is still 914.4MB. Free memory was 694.5MB in the beginning and 672.5MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L722] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L723] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L724] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L725] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L726] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L727] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L728] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L729] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L730] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L731] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L732] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L734] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L736] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L829] 0 pthread_t t2513; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513={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] [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2513, ((void *)0), P0, ((void *)0))=-2, t2513={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] [L831] 0 pthread_t t2514; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={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] [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2514, ((void *)0), P1, ((void *)0))=-1, t2513={5:0}, t2514={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] [L833] 0 pthread_t t2515; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={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] [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2515, ((void *)0), P2, ((void *)0))=0, t2513={5:0}, t2514={6:0}, t2515={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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=49, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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: 830]: 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, 139 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: 19.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 599 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 599 mSDsluCounter, 562 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 443 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1186 IncrementalHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 119 mSDtfsCounter, 1186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=776occurred in iteration=7, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 857 NumberOfCodeBlocks, 857 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 2703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-21 16:36:56,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24fb0d35-df6a-4184-954d-0f14da25675c/bin/uautomizer-vX5HgA9Q3a/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