./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/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_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/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_8f5170fd-0721-496f-948f-0a41b376deb0/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 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 --- 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:27:29,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:27:29,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:27:29,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:27:29,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:27:29,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:27:29,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:27:29,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:27:30,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:27:30,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:27:30,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:27:30,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:27:30,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:27:30,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:27:30,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:27:30,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:27:30,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:27:30,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:27:30,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:27:30,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:27:30,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:27:30,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:27:30,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:27:30,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:27:30,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:27:30,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:27:30,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:27:30,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:27:30,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:27:30,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:27:30,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:27:30,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:27:30,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:27:30,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:27:30,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:27:30,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:27:30,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:27:30,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:27:30,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:27:30,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:27:30,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:27:30,059 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:27:30,086 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:27:30,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:27:30,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:27:30,087 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:27:30,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:27:30,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:27:30,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:27:30,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:27:30,089 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:27:30,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:27:30,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:27:30,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:27:30,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:27:30,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:27:30,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:27:30,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:27:30,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:27:30,092 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:27:30,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:27:30,092 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:27:30,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:27:30,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:27:30,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:27:30,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:27:30,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:27:30,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:27:30,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:27:30,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:27:30,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:27:30,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:27:30,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:27:30,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:27:30,096 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:27:30,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:27:30,096 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_8f5170fd-0721-496f-948f-0a41b376deb0/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_8f5170fd-0721-496f-948f-0a41b376deb0/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 -> 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 [2022-11-23 02:27:30,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:27:30,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:27:30,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:27:30,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:27:30,399 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:27:30,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-11-23 02:27:33,432 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:27:33,723 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:27:33,724 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-11-23 02:27:33,737 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/data/b2210ace7/43f9c4758e56451fa08f706e64bbf6eb/FLAG15811de9a [2022-11-23 02:27:33,754 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/data/b2210ace7/43f9c4758e56451fa08f706e64bbf6eb [2022-11-23 02:27:33,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:27:33,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:27:33,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:27:33,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:27:33,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:27:33,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:27:33" (1/1) ... [2022-11-23 02:27:33,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e999ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:33, skipping insertion in model container [2022-11-23 02:27:33,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:27:33" (1/1) ... [2022-11-23 02:27:33,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:27:33,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:27:34,003 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_8f5170fd-0721-496f-948f-0a41b376deb0/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2022-11-23 02:27:34,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:27:34,248 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:27:34,261 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_8f5170fd-0721-496f-948f-0a41b376deb0/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2022-11-23 02:27:34,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:27:34,345 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:27:34,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34 WrapperNode [2022-11-23 02:27:34,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:27:34,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:27:34,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:27:34,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:27:34,355 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:27:34" (1/1) ... [2022-11-23 02:27:34,370 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:27:34" (1/1) ... [2022-11-23 02:27:34,403 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-11-23 02:27:34,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:27:34,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:27:34,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:27:34,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:27:34,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,466 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:27:34,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:27:34,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:27:34,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:27:34,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (1/1) ... [2022-11-23 02:27:34,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:27:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:27:34,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:27:34,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:27:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:27:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:27:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:27:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:27:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:27:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 02:27:34,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 02:27:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 02:27:34,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 02:27:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 02:27:34,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 02:27:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:27:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:27:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:27:34,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:27:34,572 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:27:34,799 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:27:34,816 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:27:35,196 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:27:35,561 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:27:35,562 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:27:35,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:27:35 BoogieIcfgContainer [2022-11-23 02:27:35,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:27:35,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:27:35,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:27:35,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:27:35,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:27:33" (1/3) ... [2022-11-23 02:27:35,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51485b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:27:35, skipping insertion in model container [2022-11-23 02:27:35,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:34" (2/3) ... [2022-11-23 02:27:35,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51485b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:27:35, skipping insertion in model container [2022-11-23 02:27:35,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:27:35" (3/3) ... [2022-11-23 02:27:35,580 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-11-23 02:27:35,590 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 02:27:35,601 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:27:35,601 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 02:27:35,601 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:27:35,730 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:27:35,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-23 02:27:35,824 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-23 02:27:35,824 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:27:35,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-23 02:27:35,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-23 02:27:35,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-23 02:27:35,839 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:27:35,854 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-23 02:27:35,857 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-23 02:27:35,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-11-23 02:27:35,892 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-23 02:27:35,892 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:27:35,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-23 02:27:35,895 INFO L119 LiptonReduction]: Number of co-enabled transitions 2092 [2022-11-23 02:27:42,421 INFO L134 LiptonReduction]: Checked pairs total: 5744 [2022-11-23 02:27:42,421 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-23 02:27:42,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:27:42,458 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;@1c48db9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:27:42,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 02:27:42,466 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-11-23 02:27:42,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:27:42,467 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:42,468 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:27:42,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:42,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:42,474 INFO L85 PathProgramCache]: Analyzing trace with hash 502658046, now seen corresponding path program 1 times [2022-11-23 02:27:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:42,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596638565] [2022-11-23 02:27:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:43,033 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:27:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:43,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596638565] [2022-11-23 02:27:43,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596638565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:43,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:43,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:27:43,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031474463] [2022-11-23 02:27:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:43,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:27:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:27:43,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:27:43,086 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 218 [2022-11-23 02:27:43,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:27:43,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:43,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 218 [2022-11-23 02:27:43,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:43,521 INFO L130 PetriNetUnfolder]: 909/1447 cut-off events. [2022-11-23 02:27:43,522 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-23 02:27:43,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 1447 events. 909/1447 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7214 event pairs, 117 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2849. Up to 1145 conditions per place. [2022-11-23 02:27:43,537 INFO L137 encePairwiseOnDemand]: 214/218 looper letters, 28 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2022-11-23 02:27:43,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 144 flow [2022-11-23 02:27:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:27:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:27:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2022-11-23 02:27:43,554 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5122324159021406 [2022-11-23 02:27:43,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2022-11-23 02:27:43,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2022-11-23 02:27:43,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:43,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2022-11-23 02:27:43,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:43,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:27:43,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:27:43,573 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 335 transitions. [2022-11-23 02:27:43,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 144 flow [2022-11-23 02:27:43,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 02:27:43,578 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-11-23 02:27:43,580 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-11-23 02:27:43,584 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-11-23 02:27:43,584 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-11-23 02:27:43,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:27:43,585 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:43,585 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:43,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:27:43,586 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:43,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1919069620, now seen corresponding path program 1 times [2022-11-23 02:27:43,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:43,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276875251] [2022-11-23 02:27:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:44,741 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:27:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:44,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276875251] [2022-11-23 02:27:44,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276875251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:44,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:44,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:27:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818489222] [2022-11-23 02:27:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:44,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:27:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:27:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:27:44,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2022-11-23 02:27:44,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 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:27:44,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:44,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2022-11-23 02:27:44,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:45,140 INFO L130 PetriNetUnfolder]: 821/1324 cut-off events. [2022-11-23 02:27:45,140 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-11-23 02:27:45,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1324 events. 821/1324 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6295 event pairs, 149 based on Foata normal form. 24/1348 useless extension candidates. Maximal degree in co-relation 2682. Up to 1051 conditions per place. [2022-11-23 02:27:45,150 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-11-23 02:27:45,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 154 flow [2022-11-23 02:27:45,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:27:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:27:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2022-11-23 02:27:45,153 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47553516819571867 [2022-11-23 02:27:45,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2022-11-23 02:27:45,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2022-11-23 02:27:45,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:45,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2022-11-23 02:27:45,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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:27:45,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:27:45,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:27:45,158 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 311 transitions. [2022-11-23 02:27:45,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 154 flow [2022-11-23 02:27:45,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:27:45,160 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-11-23 02:27:45,160 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-11-23 02:27:45,161 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-11-23 02:27:45,161 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-11-23 02:27:45,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 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:27:45,162 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:45,162 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:45,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:27:45,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:45,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash 638382799, now seen corresponding path program 1 times [2022-11-23 02:27:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:45,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275588282] [2022-11-23 02:27:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:46,107 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:27:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:46,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275588282] [2022-11-23 02:27:46,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275588282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:46,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:46,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:27:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544501276] [2022-11-23 02:27:46,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:46,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:27:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:46,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:27:46,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:27:46,183 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 218 [2022-11-23 02:27:46,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 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:27:46,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:46,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 218 [2022-11-23 02:27:46,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:46,659 INFO L130 PetriNetUnfolder]: 923/1399 cut-off events. [2022-11-23 02:27:46,659 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-11-23 02:27:46,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 1399 events. 923/1399 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6101 event pairs, 105 based on Foata normal form. 12/1410 useless extension candidates. Maximal degree in co-relation 3089. Up to 941 conditions per place. [2022-11-23 02:27:46,668 INFO L137 encePairwiseOnDemand]: 207/218 looper letters, 37 selfloop transitions, 18 changer transitions 0/56 dead transitions. [2022-11-23 02:27:46,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 56 transitions, 251 flow [2022-11-23 02:27:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:27:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:27:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2022-11-23 02:27:46,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4651376146788991 [2022-11-23 02:27:46,671 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2022-11-23 02:27:46,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2022-11-23 02:27:46,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:46,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2022-11-23 02:27:46,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 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:27:46,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:27:46,678 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:27:46,678 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 5 states and 507 transitions. [2022-11-23 02:27:46,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 56 transitions, 251 flow [2022-11-23 02:27:46,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 56 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:27:46,681 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 182 flow [2022-11-23 02:27:46,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2022-11-23 02:27:46,683 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2022-11-23 02:27:46,684 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 182 flow [2022-11-23 02:27:46,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 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:27:46,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:46,684 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:46,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:27:46,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1112925687, now seen corresponding path program 2 times [2022-11-23 02:27:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:46,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484310684] [2022-11-23 02:27:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:47,617 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:27:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484310684] [2022-11-23 02:27:47,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484310684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:47,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:47,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:27:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591945381] [2022-11-23 02:27:47,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:47,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:27:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:47,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:27:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:27:47,703 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 218 [2022-11-23 02:27:47,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:47,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:47,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 218 [2022-11-23 02:27:47,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:48,110 INFO L130 PetriNetUnfolder]: 1169/1842 cut-off events. [2022-11-23 02:27:48,111 INFO L131 PetriNetUnfolder]: For 1895/1895 co-relation queries the response was YES. [2022-11-23 02:27:48,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 1842 events. 1169/1842 cut-off events. For 1895/1895 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8892 event pairs, 179 based on Foata normal form. 72/1913 useless extension candidates. Maximal degree in co-relation 5960. Up to 966 conditions per place. [2022-11-23 02:27:48,124 INFO L137 encePairwiseOnDemand]: 214/218 looper letters, 38 selfloop transitions, 5 changer transitions 14/58 dead transitions. [2022-11-23 02:27:48,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 393 flow [2022-11-23 02:27:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:27:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:27:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2022-11-23 02:27:48,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46215596330275227 [2022-11-23 02:27:48,129 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2022-11-23 02:27:48,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2022-11-23 02:27:48,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:48,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2022-11-23 02:27:48,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:27:48,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:27:48,139 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:27:48,139 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 182 flow. Second operand 4 states and 403 transitions. [2022-11-23 02:27:48,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 393 flow [2022-11-23 02:27:48,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:27:48,146 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 146 flow [2022-11-23 02:27:48,146 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-11-23 02:27:48,148 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2022-11-23 02:27:48,148 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 146 flow [2022-11-23 02:27:48,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:48,149 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:48,149 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:48,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:27:48,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1686697195, now seen corresponding path program 1 times [2022-11-23 02:27:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:48,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883126646] [2022-11-23 02:27:48,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:49,177 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:27:49,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:49,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883126646] [2022-11-23 02:27:49,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883126646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:49,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:49,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:27:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355352816] [2022-11-23 02:27:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:49,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:27:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:27:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:27:49,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 218 [2022-11-23 02:27:49,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 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:27:49,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:49,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 218 [2022-11-23 02:27:49,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:49,493 INFO L130 PetriNetUnfolder]: 738/1117 cut-off events. [2022-11-23 02:27:49,493 INFO L131 PetriNetUnfolder]: For 1864/1864 co-relation queries the response was YES. [2022-11-23 02:27:49,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 1117 events. 738/1117 cut-off events. For 1864/1864 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4232 event pairs, 541 based on Foata normal form. 6/1123 useless extension candidates. Maximal degree in co-relation 3882. Up to 1059 conditions per place. [2022-11-23 02:27:49,502 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 35 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2022-11-23 02:27:49,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 306 flow [2022-11-23 02:27:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:27:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:27:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2022-11-23 02:27:49,505 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4896788990825688 [2022-11-23 02:27:49,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2022-11-23 02:27:49,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2022-11-23 02:27:49,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:49,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2022-11-23 02:27:49,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:27:49,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:27:49,510 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:27:49,510 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 146 flow. Second operand 4 states and 427 transitions. [2022-11-23 02:27:49,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 306 flow [2022-11-23 02:27:49,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 272 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-23 02:27:49,514 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 193 flow [2022-11-23 02:27:49,515 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-11-23 02:27:49,515 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2022-11-23 02:27:49,515 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 193 flow [2022-11-23 02:27:49,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 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:27:49,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:49,516 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:49,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:27:49,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:49,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash -749198258, now seen corresponding path program 1 times [2022-11-23 02:27:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:49,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129590237] [2022-11-23 02:27:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:50,315 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:27:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:50,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129590237] [2022-11-23 02:27:50,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129590237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:50,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:50,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:27:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312174159] [2022-11-23 02:27:50,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:50,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:27:50,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:50,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:27:50,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:27:50,369 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2022-11-23 02:27:50,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 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:27:50,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:50,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2022-11-23 02:27:50,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:50,633 INFO L130 PetriNetUnfolder]: 595/926 cut-off events. [2022-11-23 02:27:50,633 INFO L131 PetriNetUnfolder]: For 1674/1714 co-relation queries the response was YES. [2022-11-23 02:27:50,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3488 conditions, 926 events. 595/926 cut-off events. For 1674/1714 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3951 event pairs, 119 based on Foata normal form. 21/927 useless extension candidates. Maximal degree in co-relation 3473. Up to 652 conditions per place. [2022-11-23 02:27:50,641 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 40 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-11-23 02:27:50,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 320 flow [2022-11-23 02:27:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:27:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:27:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2022-11-23 02:27:50,644 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4694189602446483 [2022-11-23 02:27:50,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2022-11-23 02:27:50,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2022-11-23 02:27:50,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:50,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2022-11-23 02:27:50,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:50,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:27:50,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 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:27:50,649 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 193 flow. Second operand 3 states and 307 transitions. [2022-11-23 02:27:50,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 320 flow [2022-11-23 02:27:50,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 306 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-11-23 02:27:50,654 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 187 flow [2022-11-23 02:27:50,654 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2022-11-23 02:27:50,656 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2022-11-23 02:27:50,657 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 187 flow [2022-11-23 02:27:50,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 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:27:50,657 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:50,657 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:50,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:27:50,658 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash -612204817, now seen corresponding path program 1 times [2022-11-23 02:27:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:50,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243586646] [2022-11-23 02:27:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:50,922 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:27:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243586646] [2022-11-23 02:27:50,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243586646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:50,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:50,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:27:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241302546] [2022-11-23 02:27:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:50,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:27:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:27:50,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:27:50,936 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-11-23 02:27:50,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:50,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:50,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-11-23 02:27:50,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:51,241 INFO L130 PetriNetUnfolder]: 468/789 cut-off events. [2022-11-23 02:27:51,241 INFO L131 PetriNetUnfolder]: For 2045/2102 co-relation queries the response was YES. [2022-11-23 02:27:51,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 789 events. 468/789 cut-off events. For 2045/2102 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3582 event pairs, 91 based on Foata normal form. 97/860 useless extension candidates. Maximal degree in co-relation 2978. Up to 464 conditions per place. [2022-11-23 02:27:51,247 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 65 selfloop transitions, 7 changer transitions 5/80 dead transitions. [2022-11-23 02:27:51,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 80 transitions, 589 flow [2022-11-23 02:27:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:27:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:27:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-11-23 02:27:51,250 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48990825688073397 [2022-11-23 02:27:51,250 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2022-11-23 02:27:51,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2022-11-23 02:27:51,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:51,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2022-11-23 02:27:51,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:27:51,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:27:51,254 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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:27:51,254 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 187 flow. Second operand 5 states and 534 transitions. [2022-11-23 02:27:51,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 80 transitions, 589 flow [2022-11-23 02:27:51,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 80 transitions, 579 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:27:51,258 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 232 flow [2022-11-23 02:27:51,258 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-11-23 02:27:51,259 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2022-11-23 02:27:51,259 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 232 flow [2022-11-23 02:27:51,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:51,259 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:51,260 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:51,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:27:51,260 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:51,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:51,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1790056520, now seen corresponding path program 1 times [2022-11-23 02:27:51,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:51,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054981872] [2022-11-23 02:27:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:51,493 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:27:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:51,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054981872] [2022-11-23 02:27:51,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054981872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:51,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:51,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:27:51,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276072269] [2022-11-23 02:27:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:51,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:27:51,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:51,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:27:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:27:51,507 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-11-23 02:27:51,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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:27:51,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:51,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-11-23 02:27:51,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:51,789 INFO L130 PetriNetUnfolder]: 335/599 cut-off events. [2022-11-23 02:27:51,789 INFO L131 PetriNetUnfolder]: For 1788/1835 co-relation queries the response was YES. [2022-11-23 02:27:51,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 599 events. 335/599 cut-off events. For 1788/1835 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2680 event pairs, 39 based on Foata normal form. 54/634 useless extension candidates. Maximal degree in co-relation 2531. Up to 332 conditions per place. [2022-11-23 02:27:51,794 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 65 selfloop transitions, 12 changer transitions 17/97 dead transitions. [2022-11-23 02:27:51,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 780 flow [2022-11-23 02:27:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:27:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:27:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 744 transitions. [2022-11-23 02:27:51,798 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4875491480996068 [2022-11-23 02:27:51,798 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 744 transitions. [2022-11-23 02:27:51,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 744 transitions. [2022-11-23 02:27:51,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:51,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 744 transitions. [2022-11-23 02:27:51,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 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:27:51,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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:27:51,805 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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:27:51,805 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 232 flow. Second operand 7 states and 744 transitions. [2022-11-23 02:27:51,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 780 flow [2022-11-23 02:27:51,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 776 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:27:51,811 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 298 flow [2022-11-23 02:27:51,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-11-23 02:27:51,815 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2022-11-23 02:27:51,815 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 298 flow [2022-11-23 02:27:51,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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:27:51,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:51,816 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:51,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:27:51,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash 798354651, now seen corresponding path program 1 times [2022-11-23 02:27:51,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:51,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142555561] [2022-11-23 02:27:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:52,154 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:27:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:52,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142555561] [2022-11-23 02:27:52,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142555561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:52,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:52,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:27:52,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060434921] [2022-11-23 02:27:52,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:52,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:27:52,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:52,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:27:52,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:27:52,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 218 [2022-11-23 02:27:52,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 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:27:52,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:52,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 218 [2022-11-23 02:27:52,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:52,395 INFO L130 PetriNetUnfolder]: 421/786 cut-off events. [2022-11-23 02:27:52,395 INFO L131 PetriNetUnfolder]: For 2575/2595 co-relation queries the response was YES. [2022-11-23 02:27:52,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 786 events. 421/786 cut-off events. For 2575/2595 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3894 event pairs, 97 based on Foata normal form. 10/789 useless extension candidates. Maximal degree in co-relation 3670. Up to 467 conditions per place. [2022-11-23 02:27:52,400 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 38 selfloop transitions, 3 changer transitions 25/68 dead transitions. [2022-11-23 02:27:52,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 638 flow [2022-11-23 02:27:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:27:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:27:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2022-11-23 02:27:52,403 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48623853211009177 [2022-11-23 02:27:52,403 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2022-11-23 02:27:52,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2022-11-23 02:27:52,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:52,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2022-11-23 02:27:52,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 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:27:52,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:27:52,407 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 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:27:52,407 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 298 flow. Second operand 4 states and 424 transitions. [2022-11-23 02:27:52,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 638 flow [2022-11-23 02:27:52,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 576 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-11-23 02:27:52,419 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 257 flow [2022-11-23 02:27:52,419 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2022-11-23 02:27:52,420 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2022-11-23 02:27:52,420 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 257 flow [2022-11-23 02:27:52,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 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:27:52,421 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:52,421 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:52,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:27:52,421 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash 828175395, now seen corresponding path program 2 times [2022-11-23 02:27:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:52,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222535197] [2022-11-23 02:27:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:52,691 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:27:52,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:52,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222535197] [2022-11-23 02:27:52,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222535197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:52,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:52,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:27:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407963067] [2022-11-23 02:27:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:52,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:27:52,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:52,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:27:52,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:27:52,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-11-23 02:27:52,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:27:52,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:52,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-11-23 02:27:52,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:52,913 INFO L130 PetriNetUnfolder]: 163/328 cut-off events. [2022-11-23 02:27:52,914 INFO L131 PetriNetUnfolder]: For 1101/1118 co-relation queries the response was YES. [2022-11-23 02:27:52,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 328 events. 163/328 cut-off events. For 1101/1118 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1337 event pairs, 40 based on Foata normal form. 19/341 useless extension candidates. Maximal degree in co-relation 1385. Up to 177 conditions per place. [2022-11-23 02:27:52,916 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 26 selfloop transitions, 10 changer transitions 28/66 dead transitions. [2022-11-23 02:27:52,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 565 flow [2022-11-23 02:27:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:27:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:27:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2022-11-23 02:27:52,919 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4744429882044561 [2022-11-23 02:27:52,919 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2022-11-23 02:27:52,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2022-11-23 02:27:52,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:52,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2022-11-23 02:27:52,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:27:52,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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:27:52,925 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 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:27:52,925 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 257 flow. Second operand 7 states and 724 transitions. [2022-11-23 02:27:52,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 565 flow [2022-11-23 02:27:52,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 517 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-11-23 02:27:52,931 INFO L231 Difference]: Finished difference. Result has 57 places, 27 transitions, 184 flow [2022-11-23 02:27:52,931 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=57, PETRI_TRANSITIONS=27} [2022-11-23 02:27:52,931 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2022-11-23 02:27:52,932 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 27 transitions, 184 flow [2022-11-23 02:27:52,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:27:52,932 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:52,932 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] [2022-11-23 02:27:52,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:27:52,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash 881026961, now seen corresponding path program 1 times [2022-11-23 02:27:52,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:52,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838868928] [2022-11-23 02:27:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:53,900 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:27:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838868928] [2022-11-23 02:27:53,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838868928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:53,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:53,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:27:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962972956] [2022-11-23 02:27:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:53,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:27:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:53,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:27:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:27:53,947 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-11-23 02:27:53,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 27 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:27:53,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:53,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-11-23 02:27:53,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:54,150 INFO L130 PetriNetUnfolder]: 125/265 cut-off events. [2022-11-23 02:27:54,151 INFO L131 PetriNetUnfolder]: For 639/639 co-relation queries the response was YES. [2022-11-23 02:27:54,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 265 events. 125/265 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1016 event pairs, 27 based on Foata normal form. 1/266 useless extension candidates. Maximal degree in co-relation 1160. Up to 178 conditions per place. [2022-11-23 02:27:54,153 INFO L137 encePairwiseOnDemand]: 210/218 looper letters, 34 selfloop transitions, 9 changer transitions 12/56 dead transitions. [2022-11-23 02:27:54,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 493 flow [2022-11-23 02:27:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:27:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:27:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2022-11-23 02:27:54,156 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4724770642201835 [2022-11-23 02:27:54,156 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 618 transitions. [2022-11-23 02:27:54,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 618 transitions. [2022-11-23 02:27:54,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:54,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 618 transitions. [2022-11-23 02:27:54,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 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:27:54,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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:27:54,163 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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:27:54,163 INFO L175 Difference]: Start difference. First operand has 57 places, 27 transitions, 184 flow. Second operand 6 states and 618 transitions. [2022-11-23 02:27:54,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 493 flow [2022-11-23 02:27:54,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 380 flow, removed 32 selfloop flow, removed 13 redundant places. [2022-11-23 02:27:54,167 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 187 flow [2022-11-23 02:27:54,167 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2022-11-23 02:27:54,168 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2022-11-23 02:27:54,168 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 187 flow [2022-11-23 02:27:54,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:27:54,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:54,169 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] [2022-11-23 02:27:54,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:27:54,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1508648993, now seen corresponding path program 2 times [2022-11-23 02:27:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:54,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934395152] [2022-11-23 02:27:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:27:55,257 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:27:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:27:55,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934395152] [2022-11-23 02:27:55,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934395152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:27:55,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:27:55,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:27:55,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807705021] [2022-11-23 02:27:55,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:27:55,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:27:55,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:27:55,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:27:55,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:27:55,339 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 218 [2022-11-23 02:27:55,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:27:55,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:27:55,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 218 [2022-11-23 02:27:55,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:55,587 INFO L130 PetriNetUnfolder]: 112/258 cut-off events. [2022-11-23 02:27:55,587 INFO L131 PetriNetUnfolder]: For 464/464 co-relation queries the response was YES. [2022-11-23 02:27:55,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 258 events. 112/258 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1035 event pairs, 30 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 1080. Up to 120 conditions per place. [2022-11-23 02:27:55,589 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 33 selfloop transitions, 7 changer transitions 14/55 dead transitions. [2022-11-23 02:27:55,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 418 flow [2022-11-23 02:27:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:27:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:27:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 627 transitions. [2022-11-23 02:27:55,593 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4793577981651376 [2022-11-23 02:27:55,593 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 627 transitions. [2022-11-23 02:27:55,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 627 transitions. [2022-11-23 02:27:55,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:55,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 627 transitions. [2022-11-23 02:27:55,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:55,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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:27:55,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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:27:55,604 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 187 flow. Second operand 6 states and 627 transitions. [2022-11-23 02:27:55,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 418 flow [2022-11-23 02:27:55,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 399 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-23 02:27:55,608 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 194 flow [2022-11-23 02:27:55,608 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2022-11-23 02:27:55,610 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2022-11-23 02:27:55,610 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 194 flow [2022-11-23 02:27:55,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:27:55,611 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:55,611 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] [2022-11-23 02:27:55,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 02:27:55,611 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 02:27:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2072855251, now seen corresponding path program 3 times [2022-11-23 02:27:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:27:55,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536048761] [2022-11-23 02:27:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:27:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:27:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:27:55,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:27:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:27:55,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:27:55,873 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:27:55,874 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 02:27:55,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 02:27:55,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 02:27:55,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 02:27:55,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 02:27:55,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 02:27:55,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 02:27:55,878 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:55,884 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:27:55,884 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:27:55,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:27:55 BasicIcfg [2022-11-23 02:27:55,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:27:55,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:27:55,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:27:55,972 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:27:55,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:27:35" (3/4) ... [2022-11-23 02:27:55,974 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 02:27:56,105 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:27:56,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:27:56,106 INFO L158 Benchmark]: Toolchain (without parser) took 22348.54ms. Allocated memory was 163.6MB in the beginning and 450.9MB in the end (delta: 287.3MB). Free memory was 129.6MB in the beginning and 349.2MB in the end (delta: -219.5MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2022-11-23 02:27:56,106 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 163.6MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:27:56,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.30ms. Allocated memory is still 163.6MB. Free memory was 129.0MB in the beginning and 104.4MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 02:27:56,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.13ms. Allocated memory is still 163.6MB. Free memory was 104.4MB in the beginning and 101.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:27:56,107 INFO L158 Benchmark]: Boogie Preprocessor took 67.05ms. Allocated memory is still 163.6MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:27:56,107 INFO L158 Benchmark]: RCFGBuilder took 1093.07ms. Allocated memory is still 163.6MB. Free memory was 99.6MB in the beginning and 57.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-23 02:27:56,108 INFO L158 Benchmark]: TraceAbstraction took 20402.18ms. Allocated memory was 163.6MB in the beginning and 450.9MB in the end (delta: 287.3MB). Free memory was 57.0MB in the beginning and 359.6MB in the end (delta: -302.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:27:56,108 INFO L158 Benchmark]: Witness Printer took 133.60ms. Allocated memory is still 450.9MB. Free memory was 359.6MB in the beginning and 349.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 02:27:56,112 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 163.6MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.30ms. Allocated memory is still 163.6MB. Free memory was 129.0MB in the beginning and 104.4MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.13ms. Allocated memory is still 163.6MB. Free memory was 104.4MB in the beginning and 101.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.05ms. Allocated memory is still 163.6MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1093.07ms. Allocated memory is still 163.6MB. Free memory was 99.6MB in the beginning and 57.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20402.18ms. Allocated memory was 163.6MB in the beginning and 450.9MB in the end (delta: 287.3MB). Free memory was 57.0MB in the beginning and 359.6MB in the end (delta: -302.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 133.60ms. Allocated memory is still 450.9MB. Free memory was 359.6MB in the beginning and 349.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 6.6s, 120 PlacesBefore, 33 PlacesAfterwards, 112 TransitionsBefore, 24 TransitionsAfterwards, 2092 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 5744 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2110, independent: 1926, independent conditional: 0, independent unconditional: 1926, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1362, independent: 1312, independent conditional: 0, independent unconditional: 1312, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1362, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 568, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 521, dependent conditional: 0, dependent unconditional: 521, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2110, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 1362, unknown conditional: 0, unknown unconditional: 1362] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1687, ((void *)0), P0, ((void *)0))=-2, t1687={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1688, ((void *)0), P1, ((void *)0))=-1, t1687={5:0}, t1688={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t1689; [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1689, ((void *)0), P2, ((void *)0))=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EBX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 [L866] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1110 IncrementalHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 118 mSDtfsCounter, 1110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 1557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:27:56,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f5170fd-0721-496f-948f-0a41b376deb0/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