./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro --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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- 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-8393723 [2022-11-18 19:51:37,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:51:37,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:51:37,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:51:37,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:51:37,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:51:37,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:51:37,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:51:37,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:51:37,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:51:37,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:51:37,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:51:37,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:51:37,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:51:37,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:51:37,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:51:37,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:51:37,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:51:37,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:51:37,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:51:37,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:51:37,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:51:37,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:51:37,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:51:37,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:51:37,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:51:37,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:51:37,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:51:37,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:51:37,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:51:37,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:51:37,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:51:37,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:51:37,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:51:37,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:51:37,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:51:37,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:51:37,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:51:37,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:51:37,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:51:37,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:51:37,987 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:51:38,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:51:38,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:51:38,031 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:51:38,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:51:38,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:51:38,032 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:51:38,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:51:38,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:51:38,034 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:51:38,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:51:38,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:51:38,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:51:38,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:51:38,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:51:38,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:51:38,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:51:38,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:51:38,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:51:38,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:51:38,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:51:38,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:51:38,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:51:38,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:51:38,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:51:38,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:51:38,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:51:38,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:51:38,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:51:38,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:51:38,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:51:38,045 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:51:38,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:51:38,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:51:38,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/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_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2022-11-18 19:51:38,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:51:38,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:51:38,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:51:38,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:51:38,408 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:51:38,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 19:51:38,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/data/828e4a98e/f5846086d0fc41c5b28c24849a28a520/FLAG4f50e019a [2022-11-18 19:51:39,028 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:51:39,029 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 19:51:39,042 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/data/828e4a98e/f5846086d0fc41c5b28c24849a28a520/FLAG4f50e019a [2022-11-18 19:51:39,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/data/828e4a98e/f5846086d0fc41c5b28c24849a28a520 [2022-11-18 19:51:39,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:51:39,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:51:39,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:51:39,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:51:39,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:51:39,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:51:39" (1/1) ... [2022-11-18 19:51:39,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a406c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:39, skipping insertion in model container [2022-11-18 19:51:39,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:51:39" (1/1) ... [2022-11-18 19:51:39,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:51:39,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:51:39,624 WARN L234 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_cebee57c-7701-4325-bd96-5ca54dbbd2ad/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-18 19:51:39,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:51:39,886 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:51:39,898 WARN L234 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_cebee57c-7701-4325-bd96-5ca54dbbd2ad/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-18 19:51:39,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:51:40,005 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:51:40,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40 WrapperNode [2022-11-18 19:51:40,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:51:40,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:51:40,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:51:40,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:51:40,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,076 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-18 19:51:40,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:51:40,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:51:40,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:51:40,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:51:40,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,109 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:51:40,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:51:40,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:51:40,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:51:40,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (1/1) ... [2022-11-18 19:51:40,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:51:40,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:51:40,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:51:40,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:51:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:51:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:51:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:51:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:51:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:51:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:51:40,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:51:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:51:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:51:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 19:51:40,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 19:51:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:51:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:51:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:51:40,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:51:40,226 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:51:40,437 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:51:40,439 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:51:40,914 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:51:41,122 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:51:41,123 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:51:41,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:51:41 BoogieIcfgContainer [2022-11-18 19:51:41,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:51:41,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:51:41,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:51:41,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:51:41,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:51:39" (1/3) ... [2022-11-18 19:51:41,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbcf902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:51:41, skipping insertion in model container [2022-11-18 19:51:41,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:51:40" (2/3) ... [2022-11-18 19:51:41,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbcf902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:51:41, skipping insertion in model container [2022-11-18 19:51:41,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:51:41" (3/3) ... [2022-11-18 19:51:41,138 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 19:51:41,147 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:51:41,158 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:51:41,158 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:51:41,158 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:51:41,231 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:51:41,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-18 19:51:41,348 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-18 19:51:41,349 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:51:41,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 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/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-18 19:51:41,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-18 19:51:41,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-18 19:51:41,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:51:41,375 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;@157ce62c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:51:41,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 19:51:41,411 INFO L130 PetriNetUnfolder]: 0/45 cut-off events. [2022-11-18 19:51:41,411 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:51:41,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:41,412 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:41,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:51:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash -243053146, now seen corresponding path program 1 times [2022-11-18 19:51:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:41,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005759408] [2022-11-18 19:51:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:42,058 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-18 19:51:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:42,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005759408] [2022-11-18 19:51:42,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005759408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:42,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:42,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:51:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425966860] [2022-11-18 19:51:42,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:42,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:51:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:42,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:51:42,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:51:42,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2022-11-18 19:51:42,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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-18 19:51:42,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:42,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2022-11-18 19:51:42,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:42,446 INFO L130 PetriNetUnfolder]: 124/549 cut-off events. [2022-11-18 19:51:42,447 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-18 19:51:42,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 549 events. 124/549 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2987 event pairs, 24 based on Foata normal form. 23/541 useless extension candidates. Maximal degree in co-relation 729. Up to 155 conditions per place. [2022-11-18 19:51:42,457 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 18 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-11-18 19:51:42,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 285 flow [2022-11-18 19:51:42,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:51:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:51:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-11-18 19:51:42,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9327485380116959 [2022-11-18 19:51:42,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2022-11-18 19:51:42,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2022-11-18 19:51:42,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:42,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2022-11-18 19:51:42,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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-18 19:51:42,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-18 19:51:42,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-18 19:51:42,504 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 319 transitions. [2022-11-18 19:51:42,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 285 flow [2022-11-18 19:51:42,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:51:42,518 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-11-18 19:51:42,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-11-18 19:51:42,526 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-11-18 19:51:42,527 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-11-18 19:51:42,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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-18 19:51:42,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:42,528 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:42,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:51:42,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:51:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1233666069, now seen corresponding path program 1 times [2022-11-18 19:51:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:42,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166416284] [2022-11-18 19:51:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:44,039 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-18 19:51:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:44,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166416284] [2022-11-18 19:51:44,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166416284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:44,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:44,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:51:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6349043] [2022-11-18 19:51:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:44,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:51:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:51:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:51:44,044 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-18 19:51:44,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:44,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:44,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-18 19:51:44,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:45,864 INFO L130 PetriNetUnfolder]: 1901/4562 cut-off events. [2022-11-18 19:51:45,864 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-11-18 19:51:45,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7621 conditions, 4562 events. 1901/4562 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 36298 event pairs, 252 based on Foata normal form. 0/4426 useless extension candidates. Maximal degree in co-relation 7561. Up to 1326 conditions per place. [2022-11-18 19:51:45,889 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 36 selfloop transitions, 11 changer transitions 90/203 dead transitions. [2022-11-18 19:51:45,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 203 transitions, 682 flow [2022-11-18 19:51:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:51:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:51:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1169 transitions. [2022-11-18 19:51:45,899 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7887989203778677 [2022-11-18 19:51:45,900 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1169 transitions. [2022-11-18 19:51:45,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1169 transitions. [2022-11-18 19:51:45,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:45,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1169 transitions. [2022-11-18 19:51:45,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.92307692307692) internal successors, (1169), 13 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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-18 19:51:45,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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-18 19:51:45,911 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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-18 19:51:45,911 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 13 states and 1169 transitions. [2022-11-18 19:51:45,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 203 transitions, 682 flow [2022-11-18 19:51:45,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 203 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:51:45,919 INFO L231 Difference]: Finished difference. Result has 138 places, 102 transitions, 326 flow [2022-11-18 19:51:45,920 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=326, PETRI_PLACES=138, PETRI_TRANSITIONS=102} [2022-11-18 19:51:45,921 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-11-18 19:51:45,921 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 102 transitions, 326 flow [2022-11-18 19:51:45,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:45,923 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:45,923 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:45,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:51:45,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:51:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 381906044, now seen corresponding path program 1 times [2022-11-18 19:51:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:45,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747081391] [2022-11-18 19:51:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:47,788 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-18 19:51:47,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:47,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747081391] [2022-11-18 19:51:47,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747081391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:47,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:47,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 19:51:47,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517299859] [2022-11-18 19:51:47,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:47,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:51:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:47,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:51:47,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:51:47,792 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 114 [2022-11-18 19:51:47,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 102 transitions, 326 flow. Second operand has 12 states, 12 states have (on average 80.83333333333333) internal successors, (970), 12 states have internal predecessors, (970), 0 states have call successors, (0), 0 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-18 19:51:47,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:47,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 114 [2022-11-18 19:51:47,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:50,317 INFO L130 PetriNetUnfolder]: 1541/2935 cut-off events. [2022-11-18 19:51:50,318 INFO L131 PetriNetUnfolder]: For 7989/11789 co-relation queries the response was YES. [2022-11-18 19:51:50,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10989 conditions, 2935 events. 1541/2935 cut-off events. For 7989/11789 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 18420 event pairs, 139 based on Foata normal form. 77/2922 useless extension candidates. Maximal degree in co-relation 10912. Up to 1276 conditions per place. [2022-11-18 19:51:50,344 INFO L137 encePairwiseOnDemand]: 92/114 looper letters, 53 selfloop transitions, 30 changer transitions 108/256 dead transitions. [2022-11-18 19:51:50,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 256 transitions, 1790 flow [2022-11-18 19:51:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 19:51:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-18 19:51:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2230 transitions. [2022-11-18 19:51:50,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.752361673414305 [2022-11-18 19:51:50,351 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2230 transitions. [2022-11-18 19:51:50,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2230 transitions. [2022-11-18 19:51:50,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:50,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2230 transitions. [2022-11-18 19:51:50,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 85.76923076923077) internal successors, (2230), 26 states have internal predecessors, (2230), 0 states have call successors, (0), 0 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-18 19:51:50,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 114.0) internal successors, (3078), 27 states have internal predecessors, (3078), 0 states have call successors, (0), 0 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-18 19:51:50,371 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 114.0) internal successors, (3078), 27 states have internal predecessors, (3078), 0 states have call successors, (0), 0 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-18 19:51:50,371 INFO L175 Difference]: Start difference. First operand has 138 places, 102 transitions, 326 flow. Second operand 26 states and 2230 transitions. [2022-11-18 19:51:50,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 256 transitions, 1790 flow [2022-11-18 19:51:50,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 256 transitions, 1696 flow, removed 44 selfloop flow, removed 4 redundant places. [2022-11-18 19:51:50,420 INFO L231 Difference]: Finished difference. Result has 158 places, 117 transitions, 625 flow [2022-11-18 19:51:50,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=625, PETRI_PLACES=158, PETRI_TRANSITIONS=117} [2022-11-18 19:51:50,423 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places. [2022-11-18 19:51:50,423 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 117 transitions, 625 flow [2022-11-18 19:51:50,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 80.83333333333333) internal successors, (970), 12 states have internal predecessors, (970), 0 states have call successors, (0), 0 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-18 19:51:50,424 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:50,424 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:51:50,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:51:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1937957896, now seen corresponding path program 1 times [2022-11-18 19:51:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:50,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185200437] [2022-11-18 19:51:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:51,409 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-18 19:51:51,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:51,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185200437] [2022-11-18 19:51:51,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185200437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:51,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:51,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:51:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132359945] [2022-11-18 19:51:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:51,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:51:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:51,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:51:51,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:51:51,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-18 19:51:51,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 117 transitions, 625 flow. Second operand has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 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-18 19:51:51,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:51,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-18 19:51:51,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:52,736 INFO L130 PetriNetUnfolder]: 1122/2061 cut-off events. [2022-11-18 19:51:52,736 INFO L131 PetriNetUnfolder]: For 20468/33458 co-relation queries the response was YES. [2022-11-18 19:51:52,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12582 conditions, 2061 events. 1122/2061 cut-off events. For 20468/33458 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11298 event pairs, 160 based on Foata normal form. 56/2021 useless extension candidates. Maximal degree in co-relation 12478. Up to 989 conditions per place. [2022-11-18 19:51:52,762 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 63 selfloop transitions, 12 changer transitions 88/229 dead transitions. [2022-11-18 19:51:52,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 229 transitions, 2239 flow [2022-11-18 19:51:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:51:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:51:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1156 transitions. [2022-11-18 19:51:52,767 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7800269905533064 [2022-11-18 19:51:52,767 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1156 transitions. [2022-11-18 19:51:52,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1156 transitions. [2022-11-18 19:51:52,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:52,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1156 transitions. [2022-11-18 19:51:52,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.92307692307692) internal successors, (1156), 13 states have internal predecessors, (1156), 0 states have call successors, (0), 0 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-18 19:51:52,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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-18 19:51:52,775 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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-18 19:51:52,775 INFO L175 Difference]: Start difference. First operand has 158 places, 117 transitions, 625 flow. Second operand 13 states and 1156 transitions. [2022-11-18 19:51:52,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 229 transitions, 2239 flow [2022-11-18 19:51:52,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 229 transitions, 2026 flow, removed 102 selfloop flow, removed 17 redundant places. [2022-11-18 19:51:52,810 INFO L231 Difference]: Finished difference. Result has 150 places, 123 transitions, 736 flow [2022-11-18 19:51:52,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=736, PETRI_PLACES=150, PETRI_TRANSITIONS=123} [2022-11-18 19:51:52,812 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2022-11-18 19:51:52,812 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 123 transitions, 736 flow [2022-11-18 19:51:52,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 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-18 19:51:52,813 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:52,813 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:52,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:51:52,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:51:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash 171392950, now seen corresponding path program 1 times [2022-11-18 19:51:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:52,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82879563] [2022-11-18 19:51:52,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:53,968 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-18 19:51:53,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:53,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82879563] [2022-11-18 19:51:53,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82879563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:53,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:53,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:51:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930773683] [2022-11-18 19:51:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:53,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:51:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:51:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:51:53,971 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 114 [2022-11-18 19:51:53,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 123 transitions, 736 flow. Second operand has 10 states, 10 states have (on average 80.5) internal successors, (805), 10 states have internal predecessors, (805), 0 states have call successors, (0), 0 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-18 19:51:53,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:53,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 114 [2022-11-18 19:51:53,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:54,982 INFO L130 PetriNetUnfolder]: 1147/2204 cut-off events. [2022-11-18 19:51:54,983 INFO L131 PetriNetUnfolder]: For 18254/40665 co-relation queries the response was YES. [2022-11-18 19:51:54,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12807 conditions, 2204 events. 1147/2204 cut-off events. For 18254/40665 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12731 event pairs, 127 based on Foata normal form. 38/2125 useless extension candidates. Maximal degree in co-relation 12704. Up to 1078 conditions per place. [2022-11-18 19:51:55,005 INFO L137 encePairwiseOnDemand]: 95/114 looper letters, 61 selfloop transitions, 29 changer transitions 74/228 dead transitions. [2022-11-18 19:51:55,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 228 transitions, 2372 flow [2022-11-18 19:51:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:51:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 19:51:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 946 transitions. [2022-11-18 19:51:55,009 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2022-11-18 19:51:55,009 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 946 transitions. [2022-11-18 19:51:55,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 946 transitions. [2022-11-18 19:51:55,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:55,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 946 transitions. [2022-11-18 19:51:55,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 0 states have call successors, (0), 0 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-18 19:51:55,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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-18 19:51:55,015 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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-18 19:51:55,015 INFO L175 Difference]: Start difference. First operand has 150 places, 123 transitions, 736 flow. Second operand 11 states and 946 transitions. [2022-11-18 19:51:55,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 228 transitions, 2372 flow [2022-11-18 19:51:55,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 228 transitions, 2286 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-11-18 19:51:55,069 INFO L231 Difference]: Finished difference. Result has 151 places, 129 transitions, 853 flow [2022-11-18 19:51:55,070 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=853, PETRI_PLACES=151, PETRI_TRANSITIONS=129} [2022-11-18 19:51:55,071 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2022-11-18 19:51:55,071 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 129 transitions, 853 flow [2022-11-18 19:51:55,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.5) internal successors, (805), 10 states have internal predecessors, (805), 0 states have call successors, (0), 0 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-18 19:51:55,072 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:55,072 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:55,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:51:55,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:51:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1270190762, now seen corresponding path program 2 times [2022-11-18 19:51:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:55,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228880194] [2022-11-18 19:51:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:56,746 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-18 19:51:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:56,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228880194] [2022-11-18 19:51:56,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228880194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:56,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:56,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 19:51:56,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418183097] [2022-11-18 19:51:56,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:56,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:51:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:56,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:51:56,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:51:56,749 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-18 19:51:56,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 129 transitions, 853 flow. Second operand has 11 states, 11 states have (on average 82.0909090909091) internal successors, (903), 11 states have internal predecessors, (903), 0 states have call successors, (0), 0 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-18 19:51:56,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:56,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-18 19:51:56,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:51:58,943 INFO L130 PetriNetUnfolder]: 1147/2252 cut-off events. [2022-11-18 19:51:58,943 INFO L131 PetriNetUnfolder]: For 16613/18168 co-relation queries the response was YES. [2022-11-18 19:51:58,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12991 conditions, 2252 events. 1147/2252 cut-off events. For 16613/18168 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13050 event pairs, 149 based on Foata normal form. 50/2231 useless extension candidates. Maximal degree in co-relation 12882. Up to 1004 conditions per place. [2022-11-18 19:51:58,971 INFO L137 encePairwiseOnDemand]: 92/114 looper letters, 76 selfloop transitions, 79 changer transitions 86/307 dead transitions. [2022-11-18 19:51:58,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 307 transitions, 3432 flow [2022-11-18 19:51:58,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 19:51:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-18 19:51:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2102 transitions. [2022-11-18 19:51:58,977 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7682748538011696 [2022-11-18 19:51:58,977 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2102 transitions. [2022-11-18 19:51:58,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2102 transitions. [2022-11-18 19:51:58,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:51:58,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2102 transitions. [2022-11-18 19:51:58,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 87.58333333333333) internal successors, (2102), 24 states have internal predecessors, (2102), 0 states have call successors, (0), 0 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-18 19:51:58,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 114.0) internal successors, (2850), 25 states have internal predecessors, (2850), 0 states have call successors, (0), 0 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-18 19:51:58,994 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 114.0) internal successors, (2850), 25 states have internal predecessors, (2850), 0 states have call successors, (0), 0 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-18 19:51:58,994 INFO L175 Difference]: Start difference. First operand has 151 places, 129 transitions, 853 flow. Second operand 24 states and 2102 transitions. [2022-11-18 19:51:58,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 307 transitions, 3432 flow [2022-11-18 19:51:59,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 307 transitions, 3139 flow, removed 70 selfloop flow, removed 18 redundant places. [2022-11-18 19:51:59,036 INFO L231 Difference]: Finished difference. Result has 171 places, 176 transitions, 1726 flow [2022-11-18 19:51:59,037 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1726, PETRI_PLACES=171, PETRI_TRANSITIONS=176} [2022-11-18 19:51:59,038 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 52 predicate places. [2022-11-18 19:51:59,038 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 176 transitions, 1726 flow [2022-11-18 19:51:59,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.0909090909091) internal successors, (903), 11 states have internal predecessors, (903), 0 states have call successors, (0), 0 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-18 19:51:59,038 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:51:59,038 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:51:59,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:51:59,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:51:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:51:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1646123318, now seen corresponding path program 3 times [2022-11-18 19:51:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:51:59,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857205575] [2022-11-18 19:51:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:51:59,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:51:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:51:59,887 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-18 19:51:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:51:59,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857205575] [2022-11-18 19:51:59,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857205575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:51:59,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:51:59,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:51:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18285610] [2022-11-18 19:51:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:51:59,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:51:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:51:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:51:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:51:59,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-18 19:51:59,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 176 transitions, 1726 flow. Second operand has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:51:59,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:51:59,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-18 19:51:59,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:01,041 INFO L130 PetriNetUnfolder]: 1039/2077 cut-off events. [2022-11-18 19:52:01,042 INFO L131 PetriNetUnfolder]: For 45470/52107 co-relation queries the response was YES. [2022-11-18 19:52:01,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17324 conditions, 2077 events. 1039/2077 cut-off events. For 45470/52107 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12126 event pairs, 177 based on Foata normal form. 71/2074 useless extension candidates. Maximal degree in co-relation 17205. Up to 1040 conditions per place. [2022-11-18 19:52:01,068 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 87 selfloop transitions, 60 changer transitions 70/283 dead transitions. [2022-11-18 19:52:01,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 283 transitions, 4050 flow [2022-11-18 19:52:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:52:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:52:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1147 transitions. [2022-11-18 19:52:01,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7739541160593792 [2022-11-18 19:52:01,072 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1147 transitions. [2022-11-18 19:52:01,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1147 transitions. [2022-11-18 19:52:01,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:01,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1147 transitions. [2022-11-18 19:52:01,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.23076923076923) internal successors, (1147), 13 states have internal predecessors, (1147), 0 states have call successors, (0), 0 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-18 19:52:01,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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-18 19:52:01,079 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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-18 19:52:01,079 INFO L175 Difference]: Start difference. First operand has 171 places, 176 transitions, 1726 flow. Second operand 13 states and 1147 transitions. [2022-11-18 19:52:01,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 283 transitions, 4050 flow [2022-11-18 19:52:01,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 283 transitions, 3816 flow, removed 113 selfloop flow, removed 8 redundant places. [2022-11-18 19:52:01,146 INFO L231 Difference]: Finished difference. Result has 174 places, 189 transitions, 2047 flow [2022-11-18 19:52:01,147 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2047, PETRI_PLACES=174, PETRI_TRANSITIONS=189} [2022-11-18 19:52:01,148 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2022-11-18 19:52:01,148 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 189 transitions, 2047 flow [2022-11-18 19:52:01,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.28571428571429) internal successors, (583), 7 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:52:01,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:01,148 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:01,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:52:01,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1023125606, now seen corresponding path program 1 times [2022-11-18 19:52:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:01,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291367164] [2022-11-18 19:52:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:01,967 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-18 19:52:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:01,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291367164] [2022-11-18 19:52:01,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291367164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:01,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:01,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:52:01,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072565066] [2022-11-18 19:52:01,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:01,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:52:01,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:52:01,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:52:01,971 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-18 19:52:01,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 189 transitions, 2047 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 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-18 19:52:01,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:01,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-18 19:52:01,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:02,853 INFO L130 PetriNetUnfolder]: 1111/2362 cut-off events. [2022-11-18 19:52:02,853 INFO L131 PetriNetUnfolder]: For 44977/63748 co-relation queries the response was YES. [2022-11-18 19:52:02,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18902 conditions, 2362 events. 1111/2362 cut-off events. For 44977/63748 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 15230 event pairs, 150 based on Foata normal form. 46/2336 useless extension candidates. Maximal degree in co-relation 18774. Up to 988 conditions per place. [2022-11-18 19:52:02,883 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 97 selfloop transitions, 27 changer transitions 63/253 dead transitions. [2022-11-18 19:52:02,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 253 transitions, 3606 flow [2022-11-18 19:52:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:52:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:52:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 879 transitions. [2022-11-18 19:52:02,890 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7710526315789473 [2022-11-18 19:52:02,891 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 879 transitions. [2022-11-18 19:52:02,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 879 transitions. [2022-11-18 19:52:02,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:02,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 879 transitions. [2022-11-18 19:52:02,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.9) internal successors, (879), 10 states have internal predecessors, (879), 0 states have call successors, (0), 0 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-18 19:52:02,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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-18 19:52:02,899 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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-18 19:52:02,899 INFO L175 Difference]: Start difference. First operand has 174 places, 189 transitions, 2047 flow. Second operand 10 states and 879 transitions. [2022-11-18 19:52:02,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 253 transitions, 3606 flow [2022-11-18 19:52:02,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 253 transitions, 3508 flow, removed 49 selfloop flow, removed 9 redundant places. [2022-11-18 19:52:02,971 INFO L231 Difference]: Finished difference. Result has 172 places, 171 transitions, 1803 flow [2022-11-18 19:52:02,971 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=2013, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1803, PETRI_PLACES=172, PETRI_TRANSITIONS=171} [2022-11-18 19:52:02,975 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 53 predicate places. [2022-11-18 19:52:02,975 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 171 transitions, 1803 flow [2022-11-18 19:52:02,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 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-18 19:52:02,976 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:02,976 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:02,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:52:02,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1816280279, now seen corresponding path program 1 times [2022-11-18 19:52:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:02,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191783991] [2022-11-18 19:52:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:03,672 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-18 19:52:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191783991] [2022-11-18 19:52:03,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191783991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:03,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:03,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 19:52:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054110428] [2022-11-18 19:52:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:03,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:52:03,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:52:03,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:52:03,675 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-11-18 19:52:03,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 171 transitions, 1803 flow. Second operand has 11 states, 11 states have (on average 87.72727272727273) internal successors, (965), 11 states have internal predecessors, (965), 0 states have call successors, (0), 0 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-18 19:52:03,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:03,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-11-18 19:52:03,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:04,609 INFO L130 PetriNetUnfolder]: 827/1890 cut-off events. [2022-11-18 19:52:04,610 INFO L131 PetriNetUnfolder]: For 35142/45145 co-relation queries the response was YES. [2022-11-18 19:52:04,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14365 conditions, 1890 events. 827/1890 cut-off events. For 35142/45145 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12262 event pairs, 119 based on Foata normal form. 299/2121 useless extension candidates. Maximal degree in co-relation 14236. Up to 867 conditions per place. [2022-11-18 19:52:04,632 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 64 selfloop transitions, 29 changer transitions 73/255 dead transitions. [2022-11-18 19:52:04,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 255 transitions, 3532 flow [2022-11-18 19:52:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 19:52:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 19:52:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1466 transitions. [2022-11-18 19:52:04,637 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8037280701754386 [2022-11-18 19:52:04,638 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1466 transitions. [2022-11-18 19:52:04,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1466 transitions. [2022-11-18 19:52:04,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:04,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1466 transitions. [2022-11-18 19:52:04,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 91.625) internal successors, (1466), 16 states have internal predecessors, (1466), 0 states have call successors, (0), 0 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-18 19:52:04,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 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-18 19:52:04,657 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 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-18 19:52:04,657 INFO L175 Difference]: Start difference. First operand has 172 places, 171 transitions, 1803 flow. Second operand 16 states and 1466 transitions. [2022-11-18 19:52:04,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 255 transitions, 3532 flow [2022-11-18 19:52:04,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 255 transitions, 3407 flow, removed 46 selfloop flow, removed 11 redundant places. [2022-11-18 19:52:04,726 INFO L231 Difference]: Finished difference. Result has 178 places, 155 transitions, 1492 flow [2022-11-18 19:52:04,726 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1492, PETRI_PLACES=178, PETRI_TRANSITIONS=155} [2022-11-18 19:52:04,727 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 59 predicate places. [2022-11-18 19:52:04,728 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 155 transitions, 1492 flow [2022-11-18 19:52:04,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.72727272727273) internal successors, (965), 11 states have internal predecessors, (965), 0 states have call successors, (0), 0 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-18 19:52:04,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:04,729 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:04,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:52:04,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1071811399, now seen corresponding path program 2 times [2022-11-18 19:52:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357007785] [2022-11-18 19:52:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:06,228 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-18 19:52:06,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357007785] [2022-11-18 19:52:06,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357007785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:06,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:06,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 19:52:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885816928] [2022-11-18 19:52:06,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:06,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 19:52:06,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:06,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 19:52:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:52:06,232 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 114 [2022-11-18 19:52:06,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 155 transitions, 1492 flow. Second operand has 14 states, 14 states have (on average 79.85714285714286) internal successors, (1118), 14 states have internal predecessors, (1118), 0 states have call successors, (0), 0 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-18 19:52:06,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:06,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 114 [2022-11-18 19:52:06,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:08,202 INFO L130 PetriNetUnfolder]: 751/1789 cut-off events. [2022-11-18 19:52:08,202 INFO L131 PetriNetUnfolder]: For 32845/35740 co-relation queries the response was YES. [2022-11-18 19:52:08,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13411 conditions, 1789 events. 751/1789 cut-off events. For 32845/35740 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11749 event pairs, 73 based on Foata normal form. 73/1816 useless extension candidates. Maximal degree in co-relation 13279. Up to 761 conditions per place. [2022-11-18 19:52:08,218 INFO L137 encePairwiseOnDemand]: 94/114 looper letters, 65 selfloop transitions, 42 changer transitions 122/293 dead transitions. [2022-11-18 19:52:08,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 293 transitions, 4453 flow [2022-11-18 19:52:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 19:52:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-11-18 19:52:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2255 transitions. [2022-11-18 19:52:08,223 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7326185834957765 [2022-11-18 19:52:08,223 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2255 transitions. [2022-11-18 19:52:08,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2255 transitions. [2022-11-18 19:52:08,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:08,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2255 transitions. [2022-11-18 19:52:08,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 83.51851851851852) internal successors, (2255), 27 states have internal predecessors, (2255), 0 states have call successors, (0), 0 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-18 19:52:08,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 114.0) internal successors, (3192), 28 states have internal predecessors, (3192), 0 states have call successors, (0), 0 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-18 19:52:08,236 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 114.0) internal successors, (3192), 28 states have internal predecessors, (3192), 0 states have call successors, (0), 0 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-18 19:52:08,236 INFO L175 Difference]: Start difference. First operand has 178 places, 155 transitions, 1492 flow. Second operand 27 states and 2255 transitions. [2022-11-18 19:52:08,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 293 transitions, 4453 flow [2022-11-18 19:52:08,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 293 transitions, 4153 flow, removed 77 selfloop flow, removed 17 redundant places. [2022-11-18 19:52:08,289 INFO L231 Difference]: Finished difference. Result has 201 places, 149 transitions, 1438 flow [2022-11-18 19:52:08,290 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1438, PETRI_PLACES=201, PETRI_TRANSITIONS=149} [2022-11-18 19:52:08,290 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 82 predicate places. [2022-11-18 19:52:08,290 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 149 transitions, 1438 flow [2022-11-18 19:52:08,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 79.85714285714286) internal successors, (1118), 14 states have internal predecessors, (1118), 0 states have call successors, (0), 0 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-18 19:52:08,291 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:08,291 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:52:08,292 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1665566396, now seen corresponding path program 1 times [2022-11-18 19:52:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:08,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510480550] [2022-11-18 19:52:08,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:08,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:10,567 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-18 19:52:10,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:10,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510480550] [2022-11-18 19:52:10,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510480550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:10,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:10,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 19:52:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758986536] [2022-11-18 19:52:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:10,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 19:52:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:10,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 19:52:10,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:52:10,570 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 114 [2022-11-18 19:52:10,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 149 transitions, 1438 flow. Second operand has 13 states, 13 states have (on average 81.0) internal successors, (1053), 13 states have internal predecessors, (1053), 0 states have call successors, (0), 0 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-18 19:52:10,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:10,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 114 [2022-11-18 19:52:10,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:11,977 INFO L130 PetriNetUnfolder]: 619/1582 cut-off events. [2022-11-18 19:52:11,977 INFO L131 PetriNetUnfolder]: For 36116/45420 co-relation queries the response was YES. [2022-11-18 19:52:11,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12712 conditions, 1582 events. 619/1582 cut-off events. For 36116/45420 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10242 event pairs, 45 based on Foata normal form. 95/1601 useless extension candidates. Maximal degree in co-relation 12566. Up to 696 conditions per place. [2022-11-18 19:52:11,988 INFO L137 encePairwiseOnDemand]: 94/114 looper letters, 70 selfloop transitions, 54 changer transitions 78/267 dead transitions. [2022-11-18 19:52:11,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 267 transitions, 4222 flow [2022-11-18 19:52:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 19:52:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 19:52:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1628 transitions. [2022-11-18 19:52:11,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7516158818097877 [2022-11-18 19:52:11,993 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1628 transitions. [2022-11-18 19:52:11,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1628 transitions. [2022-11-18 19:52:11,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:11,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1628 transitions. [2022-11-18 19:52:11,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 85.6842105263158) internal successors, (1628), 19 states have internal predecessors, (1628), 0 states have call successors, (0), 0 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-18 19:52:12,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 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-18 19:52:12,003 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 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-18 19:52:12,003 INFO L175 Difference]: Start difference. First operand has 201 places, 149 transitions, 1438 flow. Second operand 19 states and 1628 transitions. [2022-11-18 19:52:12,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 267 transitions, 4222 flow [2022-11-18 19:52:12,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 267 transitions, 3559 flow, removed 192 selfloop flow, removed 31 redundant places. [2022-11-18 19:52:12,069 INFO L231 Difference]: Finished difference. Result has 186 places, 161 transitions, 1652 flow [2022-11-18 19:52:12,070 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1652, PETRI_PLACES=186, PETRI_TRANSITIONS=161} [2022-11-18 19:52:12,070 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 67 predicate places. [2022-11-18 19:52:12,070 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 161 transitions, 1652 flow [2022-11-18 19:52:12,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 81.0) internal successors, (1053), 13 states have internal predecessors, (1053), 0 states have call successors, (0), 0 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-18 19:52:12,072 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:12,072 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:12,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:52:12,072 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1336840200, now seen corresponding path program 1 times [2022-11-18 19:52:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:12,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586437774] [2022-11-18 19:52:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:13,943 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-18 19:52:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:13,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586437774] [2022-11-18 19:52:13,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586437774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:13,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:13,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-18 19:52:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567123761] [2022-11-18 19:52:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:13,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 19:52:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:13,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 19:52:13,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:52:13,946 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 114 [2022-11-18 19:52:13,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 161 transitions, 1652 flow. Second operand has 15 states, 15 states have (on average 82.73333333333333) internal successors, (1241), 15 states have internal predecessors, (1241), 0 states have call successors, (0), 0 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-18 19:52:13,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:13,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 114 [2022-11-18 19:52:13,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:14,962 INFO L130 PetriNetUnfolder]: 371/1284 cut-off events. [2022-11-18 19:52:14,962 INFO L131 PetriNetUnfolder]: For 19479/26956 co-relation queries the response was YES. [2022-11-18 19:52:14,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8775 conditions, 1284 events. 371/1284 cut-off events. For 19479/26956 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9391 event pairs, 75 based on Foata normal form. 120/1313 useless extension candidates. Maximal degree in co-relation 8643. Up to 519 conditions per place. [2022-11-18 19:52:14,970 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 60 selfloop transitions, 15 changer transitions 84/234 dead transitions. [2022-11-18 19:52:14,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 234 transitions, 3448 flow [2022-11-18 19:52:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 19:52:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-18 19:52:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1541 transitions. [2022-11-18 19:52:14,974 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7509746588693957 [2022-11-18 19:52:14,974 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1541 transitions. [2022-11-18 19:52:14,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1541 transitions. [2022-11-18 19:52:14,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:14,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1541 transitions. [2022-11-18 19:52:14,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.61111111111111) internal successors, (1541), 18 states have internal predecessors, (1541), 0 states have call successors, (0), 0 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-18 19:52:14,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 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-18 19:52:14,985 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 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-18 19:52:14,986 INFO L175 Difference]: Start difference. First operand has 186 places, 161 transitions, 1652 flow. Second operand 18 states and 1541 transitions. [2022-11-18 19:52:14,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 234 transitions, 3448 flow [2022-11-18 19:52:15,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 234 transitions, 3373 flow, removed 33 selfloop flow, removed 13 redundant places. [2022-11-18 19:52:15,039 INFO L231 Difference]: Finished difference. Result has 193 places, 142 transitions, 1414 flow [2022-11-18 19:52:15,039 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1414, PETRI_PLACES=193, PETRI_TRANSITIONS=142} [2022-11-18 19:52:15,040 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 74 predicate places. [2022-11-18 19:52:15,041 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 142 transitions, 1414 flow [2022-11-18 19:52:15,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 82.73333333333333) internal successors, (1241), 15 states have internal predecessors, (1241), 0 states have call successors, (0), 0 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-18 19:52:15,041 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:15,042 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:15,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:52:15,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1301808180, now seen corresponding path program 2 times [2022-11-18 19:52:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:15,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403894006] [2022-11-18 19:52:15,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:17,212 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-18 19:52:17,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:17,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403894006] [2022-11-18 19:52:17,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403894006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:17,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:17,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 19:52:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981625492] [2022-11-18 19:52:17,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:17,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:52:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:17,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:52:17,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:52:17,216 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 114 [2022-11-18 19:52:17,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 142 transitions, 1414 flow. Second operand has 18 states, 18 states have (on average 82.44444444444444) internal successors, (1484), 18 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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-18 19:52:17,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:17,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 114 [2022-11-18 19:52:17,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:18,040 INFO L130 PetriNetUnfolder]: 226/820 cut-off events. [2022-11-18 19:52:18,040 INFO L131 PetriNetUnfolder]: For 19072/23524 co-relation queries the response was YES. [2022-11-18 19:52:18,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6130 conditions, 820 events. 226/820 cut-off events. For 19072/23524 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5314 event pairs, 62 based on Foata normal form. 108/894 useless extension candidates. Maximal degree in co-relation 5995. Up to 334 conditions per place. [2022-11-18 19:52:18,047 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 54 selfloop transitions, 24 changer transitions 45/198 dead transitions. [2022-11-18 19:52:18,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 198 transitions, 2928 flow [2022-11-18 19:52:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 19:52:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-18 19:52:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1531 transitions. [2022-11-18 19:52:18,051 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7461013645224172 [2022-11-18 19:52:18,051 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1531 transitions. [2022-11-18 19:52:18,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1531 transitions. [2022-11-18 19:52:18,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:18,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1531 transitions. [2022-11-18 19:52:18,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.05555555555556) internal successors, (1531), 18 states have internal predecessors, (1531), 0 states have call successors, (0), 0 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-18 19:52:18,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 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-18 19:52:18,059 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 0 states have call successors, (0), 0 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-18 19:52:18,059 INFO L175 Difference]: Start difference. First operand has 193 places, 142 transitions, 1414 flow. Second operand 18 states and 1531 transitions. [2022-11-18 19:52:18,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 198 transitions, 2928 flow [2022-11-18 19:52:18,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 198 transitions, 2536 flow, removed 158 selfloop flow, removed 20 redundant places. [2022-11-18 19:52:18,107 INFO L231 Difference]: Finished difference. Result has 188 places, 146 transitions, 1452 flow [2022-11-18 19:52:18,108 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1452, PETRI_PLACES=188, PETRI_TRANSITIONS=146} [2022-11-18 19:52:18,109 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 69 predicate places. [2022-11-18 19:52:18,109 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 146 transitions, 1452 flow [2022-11-18 19:52:18,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 82.44444444444444) internal successors, (1484), 18 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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-18 19:52:18,110 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:18,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:18,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:52:18,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1386824500, now seen corresponding path program 3 times [2022-11-18 19:52:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062177707] [2022-11-18 19:52:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:19,782 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-18 19:52:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:19,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062177707] [2022-11-18 19:52:19,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062177707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:19,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:19,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 19:52:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108340258] [2022-11-18 19:52:19,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:19,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 19:52:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:19,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 19:52:19,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:52:19,786 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-18 19:52:19,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 146 transitions, 1452 flow. Second operand has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 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-18 19:52:19,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:19,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-18 19:52:19,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:20,921 INFO L130 PetriNetUnfolder]: 216/777 cut-off events. [2022-11-18 19:52:20,921 INFO L131 PetriNetUnfolder]: For 14718/17008 co-relation queries the response was YES. [2022-11-18 19:52:20,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 777 events. 216/777 cut-off events. For 14718/17008 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4910 event pairs, 56 based on Foata normal form. 91/847 useless extension candidates. Maximal degree in co-relation 5557. Up to 320 conditions per place. [2022-11-18 19:52:20,926 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 59 selfloop transitions, 35 changer transitions 53/225 dead transitions. [2022-11-18 19:52:20,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 225 transitions, 3440 flow [2022-11-18 19:52:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 19:52:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-18 19:52:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2287 transitions. [2022-11-18 19:52:20,938 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7715924426450742 [2022-11-18 19:52:20,938 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2287 transitions. [2022-11-18 19:52:20,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2287 transitions. [2022-11-18 19:52:20,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:20,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2287 transitions. [2022-11-18 19:52:20,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 87.96153846153847) internal successors, (2287), 26 states have internal predecessors, (2287), 0 states have call successors, (0), 0 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-18 19:52:20,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 114.0) internal successors, (3078), 27 states have internal predecessors, (3078), 0 states have call successors, (0), 0 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-18 19:52:20,949 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 114.0) internal successors, (3078), 27 states have internal predecessors, (3078), 0 states have call successors, (0), 0 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-18 19:52:20,949 INFO L175 Difference]: Start difference. First operand has 188 places, 146 transitions, 1452 flow. Second operand 26 states and 2287 transitions. [2022-11-18 19:52:20,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 225 transitions, 3440 flow [2022-11-18 19:52:20,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 225 transitions, 3287 flow, removed 57 selfloop flow, removed 12 redundant places. [2022-11-18 19:52:20,987 INFO L231 Difference]: Finished difference. Result has 210 places, 160 transitions, 1803 flow [2022-11-18 19:52:20,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1803, PETRI_PLACES=210, PETRI_TRANSITIONS=160} [2022-11-18 19:52:20,988 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 91 predicate places. [2022-11-18 19:52:20,988 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 160 transitions, 1803 flow [2022-11-18 19:52:20,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 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-18 19:52:20,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:20,989 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:20,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:52:20,990 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2110448188, now seen corresponding path program 4 times [2022-11-18 19:52:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:20,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636347122] [2022-11-18 19:52:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:52:22,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:22,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636347122] [2022-11-18 19:52:22,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636347122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:22,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:22,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-18 19:52:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786702286] [2022-11-18 19:52:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:22,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 19:52:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 19:52:22,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:52:22,315 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-18 19:52:22,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 160 transitions, 1803 flow. Second operand has 15 states, 15 states have (on average 85.53333333333333) internal successors, (1283), 15 states have internal predecessors, (1283), 0 states have call successors, (0), 0 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-18 19:52:22,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:22,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-18 19:52:22,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:23,159 INFO L130 PetriNetUnfolder]: 163/654 cut-off events. [2022-11-18 19:52:23,160 INFO L131 PetriNetUnfolder]: For 18590/22102 co-relation queries the response was YES. [2022-11-18 19:52:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5226 conditions, 654 events. 163/654 cut-off events. For 18590/22102 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3964 event pairs, 52 based on Foata normal form. 65/688 useless extension candidates. Maximal degree in co-relation 5090. Up to 252 conditions per place. [2022-11-18 19:52:23,167 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 57 selfloop transitions, 25 changer transitions 33/193 dead transitions. [2022-11-18 19:52:23,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 193 transitions, 3103 flow [2022-11-18 19:52:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:52:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 19:52:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1321 transitions. [2022-11-18 19:52:23,172 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7725146198830409 [2022-11-18 19:52:23,172 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1321 transitions. [2022-11-18 19:52:23,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1321 transitions. [2022-11-18 19:52:23,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:23,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1321 transitions. [2022-11-18 19:52:23,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.06666666666666) internal successors, (1321), 15 states have internal predecessors, (1321), 0 states have call successors, (0), 0 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-18 19:52:23,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 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-18 19:52:23,179 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 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-18 19:52:23,180 INFO L175 Difference]: Start difference. First operand has 210 places, 160 transitions, 1803 flow. Second operand 15 states and 1321 transitions. [2022-11-18 19:52:23,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 193 transitions, 3103 flow [2022-11-18 19:52:23,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 193 transitions, 2648 flow, removed 210 selfloop flow, removed 17 redundant places. [2022-11-18 19:52:23,223 INFO L231 Difference]: Finished difference. Result has 204 places, 156 transitions, 1620 flow [2022-11-18 19:52:23,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1620, PETRI_PLACES=204, PETRI_TRANSITIONS=156} [2022-11-18 19:52:23,225 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 85 predicate places. [2022-11-18 19:52:23,225 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 156 transitions, 1620 flow [2022-11-18 19:52:23,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 85.53333333333333) internal successors, (1283), 15 states have internal predecessors, (1283), 0 states have call successors, (0), 0 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-18 19:52:23,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:23,226 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:23,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 19:52:23,226 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -530358823, now seen corresponding path program 1 times [2022-11-18 19:52:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:23,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752456117] [2022-11-18 19:52:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:25,239 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-18 19:52:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752456117] [2022-11-18 19:52:25,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752456117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:25,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:25,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-18 19:52:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084580691] [2022-11-18 19:52:25,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:25,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 19:52:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 19:52:25,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-18 19:52:25,243 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-18 19:52:25,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 156 transitions, 1620 flow. Second operand has 17 states, 17 states have (on average 85.3529411764706) internal successors, (1451), 17 states have internal predecessors, (1451), 0 states have call successors, (0), 0 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-18 19:52:25,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:25,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-18 19:52:25,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:25,957 INFO L130 PetriNetUnfolder]: 128/594 cut-off events. [2022-11-18 19:52:25,957 INFO L131 PetriNetUnfolder]: For 12645/15342 co-relation queries the response was YES. [2022-11-18 19:52:25,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4176 conditions, 594 events. 128/594 cut-off events. For 12645/15342 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3516 event pairs, 41 based on Foata normal form. 58/622 useless extension candidates. Maximal degree in co-relation 4043. Up to 194 conditions per place. [2022-11-18 19:52:25,961 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 45 selfloop transitions, 25 changer transitions 48/196 dead transitions. [2022-11-18 19:52:25,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 196 transitions, 2831 flow [2022-11-18 19:52:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 19:52:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 19:52:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1666 transitions. [2022-11-18 19:52:25,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7691597414589104 [2022-11-18 19:52:25,964 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1666 transitions. [2022-11-18 19:52:25,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1666 transitions. [2022-11-18 19:52:25,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:25,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1666 transitions. [2022-11-18 19:52:25,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 87.6842105263158) internal successors, (1666), 19 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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-18 19:52:25,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 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-18 19:52:25,972 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 0 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-18 19:52:25,972 INFO L175 Difference]: Start difference. First operand has 204 places, 156 transitions, 1620 flow. Second operand 19 states and 1666 transitions. [2022-11-18 19:52:25,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 196 transitions, 2831 flow [2022-11-18 19:52:26,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 196 transitions, 2620 flow, removed 86 selfloop flow, removed 13 redundant places. [2022-11-18 19:52:26,020 INFO L231 Difference]: Finished difference. Result has 211 places, 143 transitions, 1392 flow [2022-11-18 19:52:26,021 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1392, PETRI_PLACES=211, PETRI_TRANSITIONS=143} [2022-11-18 19:52:26,021 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 92 predicate places. [2022-11-18 19:52:26,022 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 143 transitions, 1392 flow [2022-11-18 19:52:26,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 85.3529411764706) internal successors, (1451), 17 states have internal predecessors, (1451), 0 states have call successors, (0), 0 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-18 19:52:26,022 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:26,023 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:26,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 19:52:26,023 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -519067233, now seen corresponding path program 1 times [2022-11-18 19:52:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:26,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3688201] [2022-11-18 19:52:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:26,261 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-18 19:52:26,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:26,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3688201] [2022-11-18 19:52:26,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3688201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:26,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:26,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:52:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111215375] [2022-11-18 19:52:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:26,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:52:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:26,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:52:26,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:52:26,264 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-18 19:52:26,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 143 transitions, 1392 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 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-18 19:52:26,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:26,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-18 19:52:26,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:27,010 INFO L130 PetriNetUnfolder]: 1259/2631 cut-off events. [2022-11-18 19:52:27,010 INFO L131 PetriNetUnfolder]: For 60056/60104 co-relation queries the response was YES. [2022-11-18 19:52:27,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14760 conditions, 2631 events. 1259/2631 cut-off events. For 60056/60104 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17332 event pairs, 51 based on Foata normal form. 20/2598 useless extension candidates. Maximal degree in co-relation 14709. Up to 786 conditions per place. [2022-11-18 19:52:27,024 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 58 selfloop transitions, 6 changer transitions 103/243 dead transitions. [2022-11-18 19:52:27,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 243 transitions, 3705 flow [2022-11-18 19:52:27,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:52:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:52:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 972 transitions. [2022-11-18 19:52:27,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8526315789473684 [2022-11-18 19:52:27,028 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 972 transitions. [2022-11-18 19:52:27,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 972 transitions. [2022-11-18 19:52:27,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:27,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 972 transitions. [2022-11-18 19:52:27,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 0 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-18 19:52:27,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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-18 19:52:27,033 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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-18 19:52:27,033 INFO L175 Difference]: Start difference. First operand has 211 places, 143 transitions, 1392 flow. Second operand 10 states and 972 transitions. [2022-11-18 19:52:27,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 243 transitions, 3705 flow [2022-11-18 19:52:27,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 243 transitions, 2959 flow, removed 227 selfloop flow, removed 46 redundant places. [2022-11-18 19:52:27,085 INFO L231 Difference]: Finished difference. Result has 166 places, 114 transitions, 699 flow [2022-11-18 19:52:27,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=699, PETRI_PLACES=166, PETRI_TRANSITIONS=114} [2022-11-18 19:52:27,086 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 47 predicate places. [2022-11-18 19:52:27,086 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 114 transitions, 699 flow [2022-11-18 19:52:27,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 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-18 19:52:27,086 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:27,086 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:27,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 19:52:27,087 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1368851429, now seen corresponding path program 1 times [2022-11-18 19:52:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:27,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284811539] [2022-11-18 19:52:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:27,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:27,335 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-18 19:52:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284811539] [2022-11-18 19:52:27,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284811539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:27,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:27,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:52:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37761239] [2022-11-18 19:52:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:27,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:52:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:27,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:52:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:52:27,339 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-18 19:52:27,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 114 transitions, 699 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 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-18 19:52:27,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:27,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-18 19:52:27,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:27,841 INFO L130 PetriNetUnfolder]: 420/1116 cut-off events. [2022-11-18 19:52:27,841 INFO L131 PetriNetUnfolder]: For 13714/13726 co-relation queries the response was YES. [2022-11-18 19:52:27,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6027 conditions, 1116 events. 420/1116 cut-off events. For 13714/13726 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6657 event pairs, 12 based on Foata normal form. 48/1162 useless extension candidates. Maximal degree in co-relation 5990. Up to 312 conditions per place. [2022-11-18 19:52:27,846 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 55 selfloop transitions, 9 changer transitions 61/201 dead transitions. [2022-11-18 19:52:27,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 201 transitions, 2400 flow [2022-11-18 19:52:27,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:52:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:52:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2022-11-18 19:52:27,847 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8456140350877193 [2022-11-18 19:52:27,847 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2022-11-18 19:52:27,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2022-11-18 19:52:27,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:27,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2022-11-18 19:52:27,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 0 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-18 19:52:27,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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-18 19:52:27,851 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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-18 19:52:27,851 INFO L175 Difference]: Start difference. First operand has 166 places, 114 transitions, 699 flow. Second operand 10 states and 964 transitions. [2022-11-18 19:52:27,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 201 transitions, 2400 flow [2022-11-18 19:52:27,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 201 transitions, 2340 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-11-18 19:52:27,873 INFO L231 Difference]: Finished difference. Result has 170 places, 117 transitions, 755 flow [2022-11-18 19:52:27,873 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=755, PETRI_PLACES=170, PETRI_TRANSITIONS=117} [2022-11-18 19:52:27,873 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places. [2022-11-18 19:52:27,874 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 117 transitions, 755 flow [2022-11-18 19:52:27,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 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-18 19:52:27,874 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:27,874 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:27,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 19:52:27,875 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1825271998, now seen corresponding path program 1 times [2022-11-18 19:52:27,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:27,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348594505] [2022-11-18 19:52:27,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:30,375 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-18 19:52:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:30,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348594505] [2022-11-18 19:52:30,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348594505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:30,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:30,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 19:52:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298129643] [2022-11-18 19:52:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:30,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:52:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:30,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:52:30,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:52:30,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 114 [2022-11-18 19:52:30,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 117 transitions, 755 flow. Second operand has 18 states, 18 states have (on average 82.5) internal successors, (1485), 18 states have internal predecessors, (1485), 0 states have call successors, (0), 0 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-18 19:52:30,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:30,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 114 [2022-11-18 19:52:30,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:30,905 INFO L130 PetriNetUnfolder]: 71/433 cut-off events. [2022-11-18 19:52:30,906 INFO L131 PetriNetUnfolder]: For 2732/2789 co-relation queries the response was YES. [2022-11-18 19:52:30,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 433 events. 71/433 cut-off events. For 2732/2789 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2128 event pairs, 18 based on Foata normal form. 11/436 useless extension candidates. Maximal degree in co-relation 1896. Up to 98 conditions per place. [2022-11-18 19:52:30,909 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 29 selfloop transitions, 7 changer transitions 23/131 dead transitions. [2022-11-18 19:52:30,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 131 transitions, 1013 flow [2022-11-18 19:52:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 19:52:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 19:52:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1347 transitions. [2022-11-18 19:52:30,912 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7384868421052632 [2022-11-18 19:52:30,912 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1347 transitions. [2022-11-18 19:52:30,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1347 transitions. [2022-11-18 19:52:30,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:30,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1347 transitions. [2022-11-18 19:52:30,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 84.1875) internal successors, (1347), 16 states have internal predecessors, (1347), 0 states have call successors, (0), 0 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-18 19:52:30,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 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-18 19:52:30,919 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 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-18 19:52:30,920 INFO L175 Difference]: Start difference. First operand has 170 places, 117 transitions, 755 flow. Second operand 16 states and 1347 transitions. [2022-11-18 19:52:30,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 131 transitions, 1013 flow [2022-11-18 19:52:30,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 131 transitions, 947 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-11-18 19:52:30,935 INFO L231 Difference]: Finished difference. Result has 179 places, 106 transitions, 594 flow [2022-11-18 19:52:30,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=594, PETRI_PLACES=179, PETRI_TRANSITIONS=106} [2022-11-18 19:52:30,936 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 60 predicate places. [2022-11-18 19:52:30,936 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 106 transitions, 594 flow [2022-11-18 19:52:30,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 82.5) internal successors, (1485), 18 states have internal predecessors, (1485), 0 states have call successors, (0), 0 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-18 19:52:30,937 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:30,937 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:30,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 19:52:30,938 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash -875907986, now seen corresponding path program 1 times [2022-11-18 19:52:30,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:30,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493931283] [2022-11-18 19:52:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:31,196 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-18 19:52:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:31,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493931283] [2022-11-18 19:52:31,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493931283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:31,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:31,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:52:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625994557] [2022-11-18 19:52:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:31,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:52:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:52:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:52:31,199 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-18 19:52:31,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 106 transitions, 594 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 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-18 19:52:31,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:31,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-18 19:52:31,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:31,540 INFO L130 PetriNetUnfolder]: 93/381 cut-off events. [2022-11-18 19:52:31,541 INFO L131 PetriNetUnfolder]: For 3658/3658 co-relation queries the response was YES. [2022-11-18 19:52:31,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 381 events. 93/381 cut-off events. For 3658/3658 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1683 event pairs, 7 based on Foata normal form. 11/390 useless extension candidates. Maximal degree in co-relation 1686. Up to 82 conditions per place. [2022-11-18 19:52:31,543 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 35 selfloop transitions, 12 changer transitions 25/145 dead transitions. [2022-11-18 19:52:31,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 145 transitions, 1347 flow [2022-11-18 19:52:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:52:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 19:52:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1029 transitions. [2022-11-18 19:52:31,545 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8205741626794258 [2022-11-18 19:52:31,545 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1029 transitions. [2022-11-18 19:52:31,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1029 transitions. [2022-11-18 19:52:31,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:31,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1029 transitions. [2022-11-18 19:52:31,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.54545454545455) internal successors, (1029), 11 states have internal predecessors, (1029), 0 states have call successors, (0), 0 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-18 19:52:31,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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-18 19:52:31,549 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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-18 19:52:31,549 INFO L175 Difference]: Start difference. First operand has 179 places, 106 transitions, 594 flow. Second operand 11 states and 1029 transitions. [2022-11-18 19:52:31,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 145 transitions, 1347 flow [2022-11-18 19:52:31,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 145 transitions, 1036 flow, removed 115 selfloop flow, removed 38 redundant places. [2022-11-18 19:52:31,564 INFO L231 Difference]: Finished difference. Result has 144 places, 106 transitions, 480 flow [2022-11-18 19:52:31,564 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=480, PETRI_PLACES=144, PETRI_TRANSITIONS=106} [2022-11-18 19:52:31,565 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-11-18 19:52:31,565 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 106 transitions, 480 flow [2022-11-18 19:52:31,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 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-18 19:52:31,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:31,566 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:31,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 19:52:31,566 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 19:52:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1932708283, now seen corresponding path program 1 times [2022-11-18 19:52:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:31,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114863818] [2022-11-18 19:52:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:52:31,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:52:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:52:31,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:52:31,770 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:52:31,771 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 19:52:31,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 19:52:31,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 19:52:31,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 19:52:31,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 19:52:31,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 19:52:31,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 19:52:31,774 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:31,781 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:52:31,781 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:52:31,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:52:31 BasicIcfg [2022-11-18 19:52:31,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:52:31,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:52:31,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:52:31,930 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:52:31,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:51:41" (3/4) ... [2022-11-18 19:52:31,932 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 19:52:32,052 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:52:32,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:52:32,053 INFO L158 Benchmark]: Toolchain (without parser) took 52718.30ms. Allocated memory was 111.1MB in the beginning and 815.8MB in the end (delta: 704.6MB). Free memory was 67.7MB in the beginning and 520.7MB in the end (delta: -452.9MB). Peak memory consumption was 251.3MB. Max. memory is 16.1GB. [2022-11-18 19:52:32,053 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 111.1MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:52:32,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.26ms. Allocated memory is still 111.1MB. Free memory was 67.5MB in the beginning and 70.6MB in the end (delta: -3.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-11-18 19:52:32,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.87ms. Allocated memory is still 111.1MB. Free memory was 70.6MB in the beginning and 68.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:52:32,055 INFO L158 Benchmark]: Boogie Preprocessor took 37.61ms. Allocated memory is still 111.1MB. Free memory was 67.7MB in the beginning and 65.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:52:32,055 INFO L158 Benchmark]: RCFGBuilder took 1010.23ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 65.6MB in the beginning and 81.1MB in the end (delta: -15.5MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2022-11-18 19:52:32,055 INFO L158 Benchmark]: TraceAbstraction took 50799.18ms. Allocated memory was 134.2MB in the beginning and 815.8MB in the end (delta: 681.6MB). Free memory was 80.4MB in the beginning and 543.7MB in the end (delta: -463.3MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. [2022-11-18 19:52:32,056 INFO L158 Benchmark]: Witness Printer took 123.10ms. Allocated memory is still 815.8MB. Free memory was 543.7MB in the beginning and 520.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-18 19:52:32,057 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.32ms. Allocated memory is still 111.1MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.26ms. Allocated memory is still 111.1MB. Free memory was 67.5MB in the beginning and 70.6MB in the end (delta: -3.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.87ms. Allocated memory is still 111.1MB. Free memory was 70.6MB in the beginning and 68.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.61ms. Allocated memory is still 111.1MB. Free memory was 67.7MB in the beginning and 65.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1010.23ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 65.6MB in the beginning and 81.1MB in the end (delta: -15.5MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * TraceAbstraction took 50799.18ms. Allocated memory was 134.2MB in the beginning and 815.8MB in the end (delta: 681.6MB). Free memory was 80.4MB in the beginning and 543.7MB in the end (delta: -463.3MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. * Witness Printer took 123.10ms. Allocated memory is still 815.8MB. Free memory was 543.7MB in the beginning and 520.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0] [L732] 0 int y$w_buff0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=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$w_buff0=0, y$w_buff1=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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$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] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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$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] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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$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] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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$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] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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$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] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L844] 0 pthread_t t1873; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={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] [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-2, t1873={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] [L846] 0 pthread_t t1874; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={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] [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-1, t1873={5:0}, t1874={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] [L848] 0 pthread_t t1875; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={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] [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=0, t1873={5:0}, t1874={6:0}, t1875={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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L756] 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) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 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 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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 [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 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) [L867] 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)) [L868] 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)) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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: 845]: 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: 849]: 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: 847]: 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, 141 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: 50.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1945 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1945 mSDsluCounter, 2137 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1757 mSDsCounter, 561 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4294 IncrementalHoareTripleChecker+Invalid, 4855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 561 mSolverCounterUnsat, 380 mSDtfsCounter, 4294 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2047occurred in iteration=7, InterpolantAutomatonStates: 318, 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, 1.0s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 1659 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1551 ConstructedInterpolants, 0 QuantifiedInterpolants, 13608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-18 19:52:32,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cebee57c-7701-4325-bd96-5ca54dbbd2ad/bin/uautomizer-TMbwUNV5ro/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