./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS --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 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 --- 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-4e7fbc6 [2022-11-23 02:16:51,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:16:51,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:16:51,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:16:51,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:16:51,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:16:51,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:16:51,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:16:51,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:16:51,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:16:51,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:16:51,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:16:51,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:16:51,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:16:51,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:16:51,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:16:51,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:16:51,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:16:51,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:16:51,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:16:51,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:16:51,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:16:51,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:16:51,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:16:51,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:16:51,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:16:51,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:16:51,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:16:51,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:16:51,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:16:51,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:16:51,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:16:51,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:16:51,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:16:51,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:16:51,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:16:51,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:16:51,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:16:51,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:16:51,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:16:51,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:16:51,112 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:16:51,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:16:51,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:16:51,144 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:16:51,144 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:16:51,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:16:51,145 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:16:51,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:16:51,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:16:51,146 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:16:51,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:16:51,148 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:16:51,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:16:51,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:16:51,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:16:51,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:16:51,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:16:51,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:16:51,149 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:16:51,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:16:51,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:16:51,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:16:51,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:16:51,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:16:51,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:16:51,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:16:51,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:16:51,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:16:51,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:16:51,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:16:51,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:16:51,152 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:16:51,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:16:51,153 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:16:51,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:16:51,153 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/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_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS 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 -> 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 [2022-11-23 02:16:51,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:16:51,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:16:51,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:16:51,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:16:51,498 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:16:51,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 02:16:54,534 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:16:54,841 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:16:54,842 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 02:16:54,860 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/data/c3d93e2e3/fdfb8433db3e4f74aeb2d8691a5ad68a/FLAG9770f5e0b [2022-11-23 02:16:54,876 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/data/c3d93e2e3/fdfb8433db3e4f74aeb2d8691a5ad68a [2022-11-23 02:16:54,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:16:54,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:16:54,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:16:54,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:16:54,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:16:54,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:54" (1/1) ... [2022-11-23 02:16:54,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b2eddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:54, skipping insertion in model container [2022-11-23 02:16:54,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:54" (1/1) ... [2022-11-23 02:16:54,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:16:54,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:16:55,190 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_4b3154dd-766d-447e-8486-5bc4cc320a97/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 02:16:55,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:16:55,464 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:16:55,477 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_4b3154dd-766d-447e-8486-5bc4cc320a97/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-23 02:16:55,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:16:55,554 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:16:55,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55 WrapperNode [2022-11-23 02:16:55,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:16:55,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:16:55,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:16:55,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:16:55,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,603 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-23 02:16:55,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:16:55,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:16:55,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:16:55,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:16:55,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,631 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:16:55,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:16:55,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:16:55,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:16:55,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (1/1) ... [2022-11-23 02:16:55,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:16:55,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:16:55,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:16:55,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:16:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:16:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:16:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:16:55,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:16:55,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:16:55,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:16:55,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:16:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:16:55,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:16:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 02:16:55,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 02:16:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 02:16:55,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 02:16:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:16:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:16:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:16:55,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:16:55,735 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:16:55,941 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:16:55,943 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:16:56,415 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:16:56,686 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:16:56,694 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:16:56,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:56 BoogieIcfgContainer [2022-11-23 02:16:56,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:16:56,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:16:56,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:16:56,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:16:56,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:16:54" (1/3) ... [2022-11-23 02:16:56,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c64ce34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:56, skipping insertion in model container [2022-11-23 02:16:56,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:55" (2/3) ... [2022-11-23 02:16:56,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c64ce34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:56, skipping insertion in model container [2022-11-23 02:16:56,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:56" (3/3) ... [2022-11-23 02:16:56,715 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-11-23 02:16:56,724 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 02:16:56,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:16:56,735 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 02:16:56,735 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:16:56,876 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:16:56,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-11-23 02:16:57,033 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-23 02:16:57,034 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:16:57,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-23 02:16:57,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 290 flow [2022-11-23 02:16:57,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2022-11-23 02:16:57,053 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:16:57,080 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 131 transitions, 274 flow [2022-11-23 02:16:57,085 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 131 transitions, 274 flow [2022-11-23 02:16:57,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 274 flow [2022-11-23 02:16:57,153 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-23 02:16:57,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:16:57,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-23 02:16:57,157 INFO L119 LiptonReduction]: Number of co-enabled transitions 3290 [2022-11-23 02:17:02,514 INFO L134 LiptonReduction]: Checked pairs total: 8411 [2022-11-23 02:17:02,514 INFO L136 LiptonReduction]: Total number of compositions: 113 [2022-11-23 02:17:02,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:17:02,547 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;@726e2217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:17:02,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 02:17:02,555 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-11-23 02:17:02,555 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:17:02,556 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:02,557 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:17:02,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash 559365, now seen corresponding path program 1 times [2022-11-23 02:17:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:02,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63562383] [2022-11-23 02:17:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:02,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:03,011 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-23 02:17:03,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:03,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63562383] [2022-11-23 02:17:03,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63562383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:03,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:03,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:17:03,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117006647] [2022-11-23 02:17:03,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:03,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:17:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:17:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:17:03,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 248 [2022-11-23 02:17:03,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-23 02:17:03,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:03,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 248 [2022-11-23 02:17:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:04,609 INFO L130 PetriNetUnfolder]: 5879/8241 cut-off events. [2022-11-23 02:17:04,610 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-23 02:17:04,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16385 conditions, 8241 events. 5879/8241 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 44285 event pairs, 1591 based on Foata normal form. 0/7915 useless extension candidates. Maximal degree in co-relation 16373. Up to 6367 conditions per place. [2022-11-23 02:17:04,667 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2022-11-23 02:17:04,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2022-11-23 02:17:04,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:17:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:17:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2022-11-23 02:17:04,691 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5470430107526881 [2022-11-23 02:17:04,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2022-11-23 02:17:04,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2022-11-23 02:17:04,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:04,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2022-11-23 02:17:04,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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-23 02:17:04,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:17:04,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:17:04,712 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 407 transitions. [2022-11-23 02:17:04,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2022-11-23 02:17:04,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 02:17:04,719 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2022-11-23 02:17:04,721 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-11-23 02:17:04,724 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-11-23 02:17:04,725 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2022-11-23 02:17:04,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-23 02:17:04,726 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:04,727 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:17:04,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:17:04,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:04,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:04,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1784432084, now seen corresponding path program 1 times [2022-11-23 02:17:04,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:04,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734209689] [2022-11-23 02:17:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:04,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:05,095 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-23 02:17:05,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:05,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734209689] [2022-11-23 02:17:05,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734209689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:05,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:05,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:17:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848137818] [2022-11-23 02:17:05,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:05,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:17:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:17:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:17:05,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2022-11-23 02:17:05,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-23 02:17:05,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:05,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2022-11-23 02:17:05,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:09,079 INFO L130 PetriNetUnfolder]: 19887/27042 cut-off events. [2022-11-23 02:17:09,079 INFO L131 PetriNetUnfolder]: For 1245/1245 co-relation queries the response was YES. [2022-11-23 02:17:09,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55826 conditions, 27042 events. 19887/27042 cut-off events. For 1245/1245 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 148991 event pairs, 6136 based on Foata normal form. 1114/28156 useless extension candidates. Maximal degree in co-relation 55816. Up to 13135 conditions per place. [2022-11-23 02:17:09,245 INFO L137 encePairwiseOnDemand]: 239/248 looper letters, 44 selfloop transitions, 7 changer transitions 33/84 dead transitions. [2022-11-23 02:17:09,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 84 transitions, 358 flow [2022-11-23 02:17:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:17:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:17:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2022-11-23 02:17:09,248 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5088709677419355 [2022-11-23 02:17:09,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2022-11-23 02:17:09,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2022-11-23 02:17:09,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:09,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2022-11-23 02:17:09,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 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-23 02:17:09,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-23 02:17:09,257 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-23 02:17:09,258 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 5 states and 631 transitions. [2022-11-23 02:17:09,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 84 transitions, 358 flow [2022-11-23 02:17:09,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 84 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:17:09,262 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 134 flow [2022-11-23 02:17:09,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-11-23 02:17:09,263 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2022-11-23 02:17:09,264 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 134 flow [2022-11-23 02:17:09,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-23 02:17:09,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:09,265 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:17:09,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:17:09,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash -517147701, now seen corresponding path program 1 times [2022-11-23 02:17:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:09,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293171809] [2022-11-23 02:17:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:17:09,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:09,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293171809] [2022-11-23 02:17:09,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293171809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:09,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:09,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:17:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895160130] [2022-11-23 02:17:09,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:09,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:17:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:09,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:17:09,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:17:09,502 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2022-11-23 02:17:09,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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-23 02:17:09,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:09,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2022-11-23 02:17:09,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:12,605 INFO L130 PetriNetUnfolder]: 18506/25363 cut-off events. [2022-11-23 02:17:12,605 INFO L131 PetriNetUnfolder]: For 18149/18149 co-relation queries the response was YES. [2022-11-23 02:17:12,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68021 conditions, 25363 events. 18506/25363 cut-off events. For 18149/18149 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 142859 event pairs, 1459 based on Foata normal form. 1040/26403 useless extension candidates. Maximal degree in co-relation 68007. Up to 12219 conditions per place. [2022-11-23 02:17:12,956 INFO L137 encePairwiseOnDemand]: 239/248 looper letters, 60 selfloop transitions, 11 changer transitions 48/119 dead transitions. [2022-11-23 02:17:12,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 119 transitions, 678 flow [2022-11-23 02:17:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:17:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:17:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2022-11-23 02:17:12,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5046082949308756 [2022-11-23 02:17:12,959 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2022-11-23 02:17:12,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2022-11-23 02:17:12,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:12,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2022-11-23 02:17:12,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 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-23 02:17:12,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 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-23 02:17:12,967 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 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-23 02:17:12,967 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 134 flow. Second operand 7 states and 876 transitions. [2022-11-23 02:17:12,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 119 transitions, 678 flow [2022-11-23 02:17:13,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 119 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:17:13,020 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 224 flow [2022-11-23 02:17:13,021 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-11-23 02:17:13,022 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2022-11-23 02:17:13,022 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 224 flow [2022-11-23 02:17:13,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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-23 02:17:13,023 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:13,023 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:17:13,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:17:13,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:13,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -517162116, now seen corresponding path program 1 times [2022-11-23 02:17:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:13,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101505754] [2022-11-23 02:17:13,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:13,231 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-23 02:17:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101505754] [2022-11-23 02:17:13,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101505754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:13,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:13,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:17:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158763412] [2022-11-23 02:17:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:13,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:17:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:13,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:17:13,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:17:13,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2022-11-23 02:17:13,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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-23 02:17:13,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:13,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2022-11-23 02:17:13,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:16,183 INFO L130 PetriNetUnfolder]: 17540/24041 cut-off events. [2022-11-23 02:17:16,183 INFO L131 PetriNetUnfolder]: For 49688/49688 co-relation queries the response was YES. [2022-11-23 02:17:16,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72159 conditions, 24041 events. 17540/24041 cut-off events. For 49688/49688 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 132390 event pairs, 3266 based on Foata normal form. 884/24925 useless extension candidates. Maximal degree in co-relation 72139. Up to 11706 conditions per place. [2022-11-23 02:17:16,322 INFO L137 encePairwiseOnDemand]: 239/248 looper letters, 65 selfloop transitions, 17 changer transitions 41/123 dead transitions. [2022-11-23 02:17:16,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 123 transitions, 784 flow [2022-11-23 02:17:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:17:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:17:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2022-11-23 02:17:16,326 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.505184331797235 [2022-11-23 02:17:16,326 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2022-11-23 02:17:16,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2022-11-23 02:17:16,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:16,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2022-11-23 02:17:16,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 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-23 02:17:16,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 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-23 02:17:16,335 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 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-23 02:17:16,335 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 224 flow. Second operand 7 states and 877 transitions. [2022-11-23 02:17:16,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 123 transitions, 784 flow [2022-11-23 02:17:16,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 123 transitions, 776 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-23 02:17:16,563 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 344 flow [2022-11-23 02:17:16,564 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2022-11-23 02:17:16,565 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2022-11-23 02:17:16,565 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 344 flow [2022-11-23 02:17:16,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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-23 02:17:16,565 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:16,566 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:17:16,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:17:16,566 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1148308581, now seen corresponding path program 1 times [2022-11-23 02:17:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:16,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871338502] [2022-11-23 02:17:16,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:16,784 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-23 02:17:16,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:16,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871338502] [2022-11-23 02:17:16,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871338502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:16,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:16,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:17:16,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761877046] [2022-11-23 02:17:16,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:16,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:17:16,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:16,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:17:16,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:17:16,809 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 248 [2022-11-23 02:17:16,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 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-23 02:17:16,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:16,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 248 [2022-11-23 02:17:16,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:18,834 INFO L130 PetriNetUnfolder]: 9585/14000 cut-off events. [2022-11-23 02:17:18,834 INFO L131 PetriNetUnfolder]: For 32242/33558 co-relation queries the response was YES. [2022-11-23 02:17:18,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42969 conditions, 14000 events. 9585/14000 cut-off events. For 32242/33558 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 85784 event pairs, 1731 based on Foata normal form. 1506/15166 useless extension candidates. Maximal degree in co-relation 42942. Up to 9301 conditions per place. [2022-11-23 02:17:18,953 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 99 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2022-11-23 02:17:18,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 121 transitions, 1006 flow [2022-11-23 02:17:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:17:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:17:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2022-11-23 02:17:18,958 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5185483870967742 [2022-11-23 02:17:18,958 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2022-11-23 02:17:18,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2022-11-23 02:17:18,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:18,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2022-11-23 02:17:18,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 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-23 02:17:18,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-23 02:17:18,966 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-23 02:17:18,966 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 344 flow. Second operand 5 states and 643 transitions. [2022-11-23 02:17:18,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 121 transitions, 1006 flow [2022-11-23 02:17:19,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 121 transitions, 962 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-11-23 02:17:19,074 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 397 flow [2022-11-23 02:17:19,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2022-11-23 02:17:19,077 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2022-11-23 02:17:19,077 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 397 flow [2022-11-23 02:17:19,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 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-23 02:17:19,078 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:19,078 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:17:19,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:17:19,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1819722152, now seen corresponding path program 1 times [2022-11-23 02:17:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:19,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867061632] [2022-11-23 02:17:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:19,309 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-23 02:17:19,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:19,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867061632] [2022-11-23 02:17:19,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867061632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:19,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:19,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:17:19,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224415105] [2022-11-23 02:17:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:19,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:17:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:17:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:17:19,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 248 [2022-11-23 02:17:19,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 397 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:17:19,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:19,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 248 [2022-11-23 02:17:19,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:22,393 INFO L130 PetriNetUnfolder]: 15288/22569 cut-off events. [2022-11-23 02:17:22,393 INFO L131 PetriNetUnfolder]: For 50573/51384 co-relation queries the response was YES. [2022-11-23 02:17:22,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81773 conditions, 22569 events. 15288/22569 cut-off events. For 50573/51384 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 148217 event pairs, 6634 based on Foata normal form. 1008/23201 useless extension candidates. Maximal degree in co-relation 81746. Up to 11132 conditions per place. [2022-11-23 02:17:22,525 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 67 selfloop transitions, 8 changer transitions 34/114 dead transitions. [2022-11-23 02:17:22,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 114 transitions, 909 flow [2022-11-23 02:17:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:17:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:17:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2022-11-23 02:17:22,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.521774193548387 [2022-11-23 02:17:22,529 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2022-11-23 02:17:22,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2022-11-23 02:17:22,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:22,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2022-11-23 02:17:22,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 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-23 02:17:22,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-23 02:17:22,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-23 02:17:22,534 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 397 flow. Second operand 5 states and 647 transitions. [2022-11-23 02:17:22,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 114 transitions, 909 flow [2022-11-23 02:17:22,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 114 transitions, 898 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-23 02:17:22,661 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 391 flow [2022-11-23 02:17:22,661 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2022-11-23 02:17:22,662 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2022-11-23 02:17:22,662 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 391 flow [2022-11-23 02:17:22,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:17:22,662 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:22,663 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:17:22,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:17:22,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -445901978, now seen corresponding path program 1 times [2022-11-23 02:17:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:22,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175991142] [2022-11-23 02:17:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:22,885 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-23 02:17:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:22,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175991142] [2022-11-23 02:17:22,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175991142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:22,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:22,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:17:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400838006] [2022-11-23 02:17:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:22,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:17:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:22,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:17:22,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:17:22,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 248 [2022-11-23 02:17:22,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 391 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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-23 02:17:22,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:22,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 248 [2022-11-23 02:17:22,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:24,605 INFO L130 PetriNetUnfolder]: 9184/13968 cut-off events. [2022-11-23 02:17:24,605 INFO L131 PetriNetUnfolder]: For 29782/30947 co-relation queries the response was YES. [2022-11-23 02:17:24,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49191 conditions, 13968 events. 9184/13968 cut-off events. For 29782/30947 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 93085 event pairs, 1065 based on Foata normal form. 1391/14976 useless extension candidates. Maximal degree in co-relation 49161. Up to 4601 conditions per place. [2022-11-23 02:17:24,701 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 127 selfloop transitions, 17 changer transitions 8/162 dead transitions. [2022-11-23 02:17:24,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 162 transitions, 1440 flow [2022-11-23 02:17:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:17:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:17:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 900 transitions. [2022-11-23 02:17:24,704 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5184331797235023 [2022-11-23 02:17:24,705 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 900 transitions. [2022-11-23 02:17:24,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 900 transitions. [2022-11-23 02:17:24,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:24,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 900 transitions. [2022-11-23 02:17:24,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 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-23 02:17:24,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 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-23 02:17:24,712 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 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-23 02:17:24,712 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 391 flow. Second operand 7 states and 900 transitions. [2022-11-23 02:17:24,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 162 transitions, 1440 flow [2022-11-23 02:17:24,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 162 transitions, 1401 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-23 02:17:24,840 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 505 flow [2022-11-23 02:17:24,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=505, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2022-11-23 02:17:24,841 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2022-11-23 02:17:24,841 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 505 flow [2022-11-23 02:17:24,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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-23 02:17:24,842 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:24,842 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] [2022-11-23 02:17:24,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:17:24,842 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2108892050, now seen corresponding path program 1 times [2022-11-23 02:17:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:24,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546255169] [2022-11-23 02:17:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:25,141 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-23 02:17:25,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:25,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546255169] [2022-11-23 02:17:25,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546255169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:25,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:25,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:17:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117789969] [2022-11-23 02:17:25,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:25,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:17:25,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:17:25,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:17:25,159 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 248 [2022-11-23 02:17:25,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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-23 02:17:25,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:25,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 248 [2022-11-23 02:17:25,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:27,284 INFO L130 PetriNetUnfolder]: 8217/12482 cut-off events. [2022-11-23 02:17:27,284 INFO L131 PetriNetUnfolder]: For 33180/34291 co-relation queries the response was YES. [2022-11-23 02:17:27,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50095 conditions, 12482 events. 8217/12482 cut-off events. For 33180/34291 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 82814 event pairs, 793 based on Foata normal form. 813/12931 useless extension candidates. Maximal degree in co-relation 50063. Up to 4272 conditions per place. [2022-11-23 02:17:27,348 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 138 selfloop transitions, 26 changer transitions 23/197 dead transitions. [2022-11-23 02:17:27,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 197 transitions, 1797 flow [2022-11-23 02:17:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:17:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:17:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1157 transitions. [2022-11-23 02:17:27,353 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5183691756272402 [2022-11-23 02:17:27,353 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1157 transitions. [2022-11-23 02:17:27,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1157 transitions. [2022-11-23 02:17:27,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:27,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1157 transitions. [2022-11-23 02:17:27,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.55555555555554) internal successors, (1157), 9 states have internal predecessors, (1157), 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-23 02:17:27,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 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-23 02:17:27,362 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 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-23 02:17:27,362 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 505 flow. Second operand 9 states and 1157 transitions. [2022-11-23 02:17:27,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 197 transitions, 1797 flow [2022-11-23 02:17:28,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 197 transitions, 1747 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-11-23 02:17:28,391 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 629 flow [2022-11-23 02:17:28,391 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=629, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2022-11-23 02:17:28,392 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2022-11-23 02:17:28,392 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 629 flow [2022-11-23 02:17:28,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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-23 02:17:28,393 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:28,393 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] [2022-11-23 02:17:28,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:17:28,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:28,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:28,394 INFO L85 PathProgramCache]: Analyzing trace with hash -446996294, now seen corresponding path program 1 times [2022-11-23 02:17:28,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:28,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497989457] [2022-11-23 02:17:28,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:28,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:28,694 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-23 02:17:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:28,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497989457] [2022-11-23 02:17:28,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497989457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:28,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:28,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:17:28,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866656428] [2022-11-23 02:17:28,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:28,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:17:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:17:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:17:28,719 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 248 [2022-11-23 02:17:28,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 629 flow. Second operand has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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-23 02:17:28,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:28,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 248 [2022-11-23 02:17:28,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:30,835 INFO L130 PetriNetUnfolder]: 8095/12256 cut-off events. [2022-11-23 02:17:30,836 INFO L131 PetriNetUnfolder]: For 36644/37753 co-relation queries the response was YES. [2022-11-23 02:17:30,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49768 conditions, 12256 events. 8095/12256 cut-off events. For 36644/37753 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 81325 event pairs, 777 based on Foata normal form. 539/12432 useless extension candidates. Maximal degree in co-relation 49733. Up to 2534 conditions per place. [2022-11-23 02:17:30,915 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 117 selfloop transitions, 29 changer transitions 45/198 dead transitions. [2022-11-23 02:17:30,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 198 transitions, 1853 flow [2022-11-23 02:17:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:17:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-23 02:17:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1386 transitions. [2022-11-23 02:17:30,921 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2022-11-23 02:17:30,922 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1386 transitions. [2022-11-23 02:17:30,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1386 transitions. [2022-11-23 02:17:30,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:30,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1386 transitions. [2022-11-23 02:17:30,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.0) internal successors, (1386), 11 states have internal predecessors, (1386), 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-23 02:17:30,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 248.0) internal successors, (2976), 12 states have internal predecessors, (2976), 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-23 02:17:30,934 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 248.0) internal successors, (2976), 12 states have internal predecessors, (2976), 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-23 02:17:30,934 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 629 flow. Second operand 11 states and 1386 transitions. [2022-11-23 02:17:30,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 198 transitions, 1853 flow [2022-11-23 02:17:32,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 198 transitions, 1730 flow, removed 49 selfloop flow, removed 6 redundant places. [2022-11-23 02:17:32,570 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 546 flow [2022-11-23 02:17:32,570 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=546, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2022-11-23 02:17:32,571 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2022-11-23 02:17:32,571 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 546 flow [2022-11-23 02:17:32,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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-23 02:17:32,572 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:32,572 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] [2022-11-23 02:17:32,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:17:32,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash 588636893, now seen corresponding path program 1 times [2022-11-23 02:17:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:32,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334523705] [2022-11-23 02:17:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:17:33,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:33,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334523705] [2022-11-23 02:17:33,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334523705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:33,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:33,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 02:17:33,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845951228] [2022-11-23 02:17:33,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:33,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:17:33,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:33,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:17:33,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:17:33,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 248 [2022-11-23 02:17:33,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 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-23 02:17:33,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:33,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 248 [2022-11-23 02:17:33,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:35,707 INFO L130 PetriNetUnfolder]: 8508/12981 cut-off events. [2022-11-23 02:17:35,707 INFO L131 PetriNetUnfolder]: For 49990/49990 co-relation queries the response was YES. [2022-11-23 02:17:35,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55837 conditions, 12981 events. 8508/12981 cut-off events. For 49990/49990 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 82313 event pairs, 343 based on Foata normal form. 2/12983 useless extension candidates. Maximal degree in co-relation 55800. Up to 3098 conditions per place. [2022-11-23 02:17:35,802 INFO L137 encePairwiseOnDemand]: 233/248 looper letters, 172 selfloop transitions, 77 changer transitions 142/391 dead transitions. [2022-11-23 02:17:35,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 391 transitions, 3955 flow [2022-11-23 02:17:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 02:17:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-23 02:17:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1766 transitions. [2022-11-23 02:17:35,807 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4747311827956989 [2022-11-23 02:17:35,807 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1766 transitions. [2022-11-23 02:17:35,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1766 transitions. [2022-11-23 02:17:35,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:35,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1766 transitions. [2022-11-23 02:17:35,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 117.73333333333333) internal successors, (1766), 15 states have internal predecessors, (1766), 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-23 02:17:35,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 248.0) internal successors, (3968), 16 states have internal predecessors, (3968), 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-23 02:17:35,820 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 248.0) internal successors, (3968), 16 states have internal predecessors, (3968), 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-23 02:17:35,820 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 546 flow. Second operand 15 states and 1766 transitions. [2022-11-23 02:17:35,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 391 transitions, 3955 flow [2022-11-23 02:17:36,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 391 transitions, 3172 flow, removed 146 selfloop flow, removed 15 redundant places. [2022-11-23 02:17:36,382 INFO L231 Difference]: Finished difference. Result has 95 places, 120 transitions, 1141 flow [2022-11-23 02:17:36,383 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1141, PETRI_PLACES=95, PETRI_TRANSITIONS=120} [2022-11-23 02:17:36,383 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places. [2022-11-23 02:17:36,383 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 120 transitions, 1141 flow [2022-11-23 02:17:36,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 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-23 02:17:36,384 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:36,384 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] [2022-11-23 02:17:36,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:17:36,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -198523509, now seen corresponding path program 2 times [2022-11-23 02:17:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:36,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130540996] [2022-11-23 02:17:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:17:37,675 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-23 02:17:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:17:37,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130540996] [2022-11-23 02:17:37,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130540996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:17:37,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:17:37,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 02:17:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469962674] [2022-11-23 02:17:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:17:37,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:17:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:17:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:17:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:17:37,765 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2022-11-23 02:17:37,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 120 transitions, 1141 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-23 02:17:37,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:17:37,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2022-11-23 02:17:37,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:17:38,838 INFO L130 PetriNetUnfolder]: 3410/5508 cut-off events. [2022-11-23 02:17:38,838 INFO L131 PetriNetUnfolder]: For 24778/25121 co-relation queries the response was YES. [2022-11-23 02:17:38,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26456 conditions, 5508 events. 3410/5508 cut-off events. For 24778/25121 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 33428 event pairs, 526 based on Foata normal form. 98/5568 useless extension candidates. Maximal degree in co-relation 26422. Up to 3015 conditions per place. [2022-11-23 02:17:38,870 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 97 selfloop transitions, 8 changer transitions 65/192 dead transitions. [2022-11-23 02:17:38,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 192 transitions, 1961 flow [2022-11-23 02:17:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:17:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:17:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 971 transitions. [2022-11-23 02:17:38,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4894153225806452 [2022-11-23 02:17:38,873 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 971 transitions. [2022-11-23 02:17:38,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 971 transitions. [2022-11-23 02:17:38,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:17:38,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 971 transitions. [2022-11-23 02:17:38,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.375) internal successors, (971), 8 states have internal predecessors, (971), 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-23 02:17:38,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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-23 02:17:38,880 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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-23 02:17:38,880 INFO L175 Difference]: Start difference. First operand has 95 places, 120 transitions, 1141 flow. Second operand 8 states and 971 transitions. [2022-11-23 02:17:38,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 192 transitions, 1961 flow [2022-11-23 02:17:39,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 192 transitions, 1865 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-11-23 02:17:39,061 INFO L231 Difference]: Finished difference. Result has 86 places, 99 transitions, 870 flow [2022-11-23 02:17:39,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=870, PETRI_PLACES=86, PETRI_TRANSITIONS=99} [2022-11-23 02:17:39,062 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2022-11-23 02:17:39,062 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 99 transitions, 870 flow [2022-11-23 02:17:39,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-23 02:17:39,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:17:39,063 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] [2022-11-23 02:17:39,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:17:39,064 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 02:17:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:17:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1240574453, now seen corresponding path program 3 times [2022-11-23 02:17:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:17:39,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192534414] [2022-11-23 02:17:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:17:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:17:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:17:39,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:17:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:17:39,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:17:39,285 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:17:39,287 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 02:17:39,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 02:17:39,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 02:17:39,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 02:17:39,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 02:17:39,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 02:17:39,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 02:17:39,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 02:17:39,296 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:17:39,302 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:17:39,302 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:17:39,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:17:39 BasicIcfg [2022-11-23 02:17:39,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:17:39,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:17:39,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:17:39,407 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:17:39,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:56" (3/4) ... [2022-11-23 02:17:39,409 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:17:39,495 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:17:39,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:17:39,496 INFO L158 Benchmark]: Toolchain (without parser) took 44612.19ms. Allocated memory was 148.9MB in the beginning and 8.1GB in the end (delta: 7.9GB). Free memory was 116.2MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2022-11-23 02:17:39,497 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:17:39,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.60ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 92.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 02:17:39,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.04ms. Allocated memory is still 148.9MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:17:39,498 INFO L158 Benchmark]: Boogie Preprocessor took 32.05ms. Allocated memory is still 148.9MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:17:39,498 INFO L158 Benchmark]: RCFGBuilder took 1063.41ms. Allocated memory is still 148.9MB. Free memory was 87.7MB in the beginning and 93.7MB in the end (delta: -6.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-11-23 02:17:39,499 INFO L158 Benchmark]: TraceAbstraction took 42702.79ms. Allocated memory was 148.9MB in the beginning and 8.1GB in the end (delta: 7.9GB). Free memory was 92.9MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2022-11-23 02:17:39,499 INFO L158 Benchmark]: Witness Printer took 89.44ms. Allocated memory is still 8.1GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 02:17:39,501 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.29ms. Allocated memory is still 109.1MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.60ms. Allocated memory is still 148.9MB. Free memory was 116.2MB in the beginning and 92.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.04ms. Allocated memory is still 148.9MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.05ms. Allocated memory is still 148.9MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1063.41ms. Allocated memory is still 148.9MB. Free memory was 87.7MB in the beginning and 93.7MB in the end (delta: -6.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 42702.79ms. Allocated memory was 148.9MB in the beginning and 8.1GB in the end (delta: 7.9GB). Free memory was 92.9MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. * Witness Printer took 89.44ms. Allocated memory is still 8.1GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 142 PlacesBefore, 43 PlacesAfterwards, 131 TransitionsBefore, 31 TransitionsAfterwards, 3290 CoEnabledTransitionPairs, 6 FixpointIterations, 44 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 8411 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4197, independent: 4001, independent conditional: 0, independent unconditional: 4001, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2292, independent: 2232, independent conditional: 0, independent unconditional: 2232, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2292, independent: 2207, independent conditional: 0, independent unconditional: 2207, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 85, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 533, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 495, dependent conditional: 0, dependent unconditional: 495, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4197, independent: 1769, independent conditional: 0, independent unconditional: 1769, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 2292, unknown conditional: 0, unknown unconditional: 2292] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 237, Positive conditional cache size: 0, Positive unconditional cache size: 237, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1409, ((void *)0), P0, ((void *)0))=-2, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1410, ((void *)0), P1, ((void *)0))=-1, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1411; [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1411, ((void *)0), P2, ((void *)0))=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1412, ((void *)0), P3, ((void *)0))=1, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=255, x=2, y=2, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: 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: 862]: 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: 860]: 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 9 procedures, 171 locations, 7 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: 42.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 31.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1033 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 926 mSDsluCounter, 452 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 381 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2144 IncrementalHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 71 mSDtfsCounter, 2144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1141occurred in iteration=10, InterpolantAutomatonStates: 82, 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.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-23 02:17:39,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b3154dd-766d-447e-8486-5bc4cc320a97/bin/uautomizer-QkZJyEgLgS/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