./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8 --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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- 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-e04fb08 [2022-11-16 11:39:01,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:39:01,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:39:01,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:39:01,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:39:01,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:39:01,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:39:01,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:39:01,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:39:01,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:39:01,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:39:01,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:39:01,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:39:01,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:39:01,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:39:01,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:39:01,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:39:01,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:39:01,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:39:01,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:39:01,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:39:01,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:39:01,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:39:01,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:39:01,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:39:01,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:39:01,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:39:01,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:39:01,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:39:01,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:39:01,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:39:01,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:39:01,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:39:01,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:39:01,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:39:01,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:39:01,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:39:01,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:39:01,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:39:01,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:39:01,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:39:01,995 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:39:02,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:39:02,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:39:02,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:39:02,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:39:02,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:39:02,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:39:02,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:39:02,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:39:02,045 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:39:02,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:39:02,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:39:02,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:39:02,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:39:02,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:39:02,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:39:02,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:39:02,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:39:02,048 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:39:02,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:39:02,048 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:39:02,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:39:02,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:39:02,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:39:02,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:39:02,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:39:02,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:39:02,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:39:02,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:39:02,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:39:02,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:39:02,052 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:39:02,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:39:02,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:39:02,053 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_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/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_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-11-16 11:39:02,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:39:02,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:39:02,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:39:02,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:39:02,466 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:39:02,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 11:39:02,543 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/data/162c37f70/376c04e7fde54887a5a206412a68dc76/FLAGe2211ad80 [2022-11-16 11:39:03,144 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:39:03,145 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 11:39:03,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/data/162c37f70/376c04e7fde54887a5a206412a68dc76/FLAGe2211ad80 [2022-11-16 11:39:03,384 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/data/162c37f70/376c04e7fde54887a5a206412a68dc76 [2022-11-16 11:39:03,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:39:03,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:39:03,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:39:03,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:39:03,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:39:03,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:03" (1/1) ... [2022-11-16 11:39:03,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13727b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:03, skipping insertion in model container [2022-11-16 11:39:03,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:03" (1/1) ... [2022-11-16 11:39:03,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:39:03,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:39:03,669 WARN L229 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_266e762f-b73b-4126-9ffa-9570ac3a3105/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-16 11:39:03,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:39:03,894 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:39:03,907 WARN L229 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_266e762f-b73b-4126-9ffa-9570ac3a3105/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-16 11:39:03,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:39:04,017 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:39:04,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04 WrapperNode [2022-11-16 11:39:04,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:39:04,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:39:04,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:39:04,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:39:04,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,118 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-16 11:39:04,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:39:04,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:39:04,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:39:04,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:39:04,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,189 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:39:04,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:39:04,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:39:04,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:39:04,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (1/1) ... [2022-11-16 11:39:04,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:39:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:39:04,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:39:04,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:39:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:39:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:39:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:39:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:39:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:39:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:39:04,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:39:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:39:04,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:39:04,332 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:39:04,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:39:04,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:39:04,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:39:04,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:39:04,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:39:04,335 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:39:04,574 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:39:04,577 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:39:04,977 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:39:05,175 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:39:05,175 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:39:05,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:39:05 BoogieIcfgContainer [2022-11-16 11:39:05,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:39:05,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:39:05,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:39:05,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:39:05,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:39:03" (1/3) ... [2022-11-16 11:39:05,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b0b20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:05, skipping insertion in model container [2022-11-16 11:39:05,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:04" (2/3) ... [2022-11-16 11:39:05,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b0b20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:05, skipping insertion in model container [2022-11-16 11:39:05,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:39:05" (3/3) ... [2022-11-16 11:39:05,188 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 11:39:05,198 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:39:05,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:39:05,210 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:39:05,210 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:39:05,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:39:05,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-16 11:39:05,379 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-16 11:39:05,380 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:39:05,390 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 4. Compared 61 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-16 11:39:05,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-16 11:39:05,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-16 11:39:05,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:39:05,412 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;@49ae2525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:39:05,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:39:05,433 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-11-16 11:39:05,433 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:39:05,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:05,434 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] [2022-11-16 11:39:05,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1919704086, now seen corresponding path program 1 times [2022-11-16 11:39:05,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:05,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492479003] [2022-11-16 11:39:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:06,225 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-16 11:39:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:06,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492479003] [2022-11-16 11:39:06,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492479003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:06,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:06,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:06,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790829671] [2022-11-16 11:39:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:06,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:06,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:06,304 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2022-11-16 11:39:06,308 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.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:06,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:06,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2022-11-16 11:39:06,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:06,693 INFO L130 PetriNetUnfolder]: 126/549 cut-off events. [2022-11-16 11:39:06,693 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-16 11:39:06,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 549 events. 126/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2904 event pairs, 34 based on Foata normal form. 24/540 useless extension candidates. Maximal degree in co-relation 734. Up to 141 conditions per place. [2022-11-16 11:39:06,704 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 16 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-11-16 11:39:06,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 271 flow [2022-11-16 11:39:06,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-11-16 11:39:06,729 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9269005847953217 [2022-11-16 11:39:06,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-11-16 11:39:06,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-11-16 11:39:06,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:06,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-11-16 11:39:06,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:06,756 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-16 11:39:06,757 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-16 11:39:06,759 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 317 transitions. [2022-11-16 11:39:06,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 271 flow [2022-11-16 11:39:06,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:39:06,774 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-11-16 11:39:06,776 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-16 11:39:06,783 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-11-16 11:39:06,783 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-11-16 11:39:06,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:06,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:06,784 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-16 11:39:06,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:39:06,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1759559235, now seen corresponding path program 1 times [2022-11-16 11:39:06,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:06,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584120532] [2022-11-16 11:39:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:07,785 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-16 11:39:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:07,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584120532] [2022-11-16 11:39:07,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584120532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:07,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:07,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:39:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420278671] [2022-11-16 11:39:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:07,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:39:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:39:07,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:39:07,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:39:07,792 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-16 11:39:07,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:07,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:39:07,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:09,772 INFO L130 PetriNetUnfolder]: 1814/4534 cut-off events. [2022-11-16 11:39:09,772 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-11-16 11:39:09,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 4534 events. 1814/4534 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 37191 event pairs, 219 based on Foata normal form. 0/4404 useless extension candidates. Maximal degree in co-relation 7397. Up to 1373 conditions per place. [2022-11-16 11:39:09,803 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 38 selfloop transitions, 13 changer transitions 96/213 dead transitions. [2022-11-16 11:39:09,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 213 transitions, 726 flow [2022-11-16 11:39:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:39:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:39:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1179 transitions. [2022-11-16 11:39:09,811 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7955465587044535 [2022-11-16 11:39:09,811 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1179 transitions. [2022-11-16 11:39:09,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1179 transitions. [2022-11-16 11:39:09,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:09,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1179 transitions. [2022-11-16 11:39:09,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.6923076923077) internal successors, (1179), 13 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:09,823 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-16 11:39:09,824 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-16 11:39:09,824 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 13 states and 1179 transitions. [2022-11-16 11:39:09,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 213 transitions, 726 flow [2022-11-16 11:39:09,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 213 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:09,834 INFO L231 Difference]: Finished difference. Result has 137 places, 104 transitions, 320 flow [2022-11-16 11:39:09,834 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=320, PETRI_PLACES=137, PETRI_TRANSITIONS=104} [2022-11-16 11:39:09,836 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2022-11-16 11:39:09,836 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 104 transitions, 320 flow [2022-11-16 11:39:09,836 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-16 11:39:09,837 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:09,838 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-16 11:39:09,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:39:09,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash -398032228, now seen corresponding path program 1 times [2022-11-16 11:39:09,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:09,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472941772] [2022-11-16 11:39:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:10,517 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-16 11:39:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:10,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472941772] [2022-11-16 11:39:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472941772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:10,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:10,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:39:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358018299] [2022-11-16 11:39:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:10,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:39:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:39:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:39:10,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:39:10,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 104 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:10,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:10,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:39:10,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:11,910 INFO L130 PetriNetUnfolder]: 982/1958 cut-off events. [2022-11-16 11:39:11,932 INFO L131 PetriNetUnfolder]: For 4235/5880 co-relation queries the response was YES. [2022-11-16 11:39:11,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 1958 events. 982/1958 cut-off events. For 4235/5880 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11484 event pairs, 231 based on Foata normal form. 69/1948 useless extension candidates. Maximal degree in co-relation 6973. Up to 851 conditions per place. [2022-11-16 11:39:11,947 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 45 selfloop transitions, 10 changer transitions 73/194 dead transitions. [2022-11-16 11:39:11,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 194 transitions, 1119 flow [2022-11-16 11:39:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:39:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:39:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1149 transitions. [2022-11-16 11:39:11,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7753036437246964 [2022-11-16 11:39:11,952 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1149 transitions. [2022-11-16 11:39:11,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1149 transitions. [2022-11-16 11:39:11,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:11,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1149 transitions. [2022-11-16 11:39:11,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:11,960 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-16 11:39:11,961 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-16 11:39:11,961 INFO L175 Difference]: Start difference. First operand has 137 places, 104 transitions, 320 flow. Second operand 13 states and 1149 transitions. [2022-11-16 11:39:11,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 194 transitions, 1119 flow [2022-11-16 11:39:11,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 194 transitions, 1071 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-16 11:39:11,984 INFO L231 Difference]: Finished difference. Result has 134 places, 110 transitions, 429 flow [2022-11-16 11:39:11,985 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=429, PETRI_PLACES=134, PETRI_TRANSITIONS=110} [2022-11-16 11:39:11,987 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-11-16 11:39:11,988 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 110 transitions, 429 flow [2022-11-16 11:39:11,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:11,988 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:11,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] [2022-11-16 11:39:11,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:39:11,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:11,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1424101312, now seen corresponding path program 1 times [2022-11-16 11:39:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:11,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823902454] [2022-11-16 11:39:11,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:11,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:13,816 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-16 11:39:13,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:13,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823902454] [2022-11-16 11:39:13,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823902454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:13,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:13,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:39:13,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059733960] [2022-11-16 11:39:13,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:13,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:39:13,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:13,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:39:13,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:39:13,821 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-11-16 11:39:13,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 110 transitions, 429 flow. Second operand has 11 states, 11 states have (on average 82.18181818181819) internal successors, (904), 11 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:13,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:13,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-11-16 11:39:13,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:15,467 INFO L130 PetriNetUnfolder]: 675/1367 cut-off events. [2022-11-16 11:39:15,468 INFO L131 PetriNetUnfolder]: For 5078/9438 co-relation queries the response was YES. [2022-11-16 11:39:15,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5808 conditions, 1367 events. 675/1367 cut-off events. For 5078/9438 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7413 event pairs, 33 based on Foata normal form. 38/1339 useless extension candidates. Maximal degree in co-relation 5726. Up to 653 conditions per place. [2022-11-16 11:39:15,483 INFO L137 encePairwiseOnDemand]: 95/114 looper letters, 40 selfloop transitions, 32 changer transitions 56/194 dead transitions. [2022-11-16 11:39:15,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 194 transitions, 1333 flow [2022-11-16 11:39:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:39:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-16 11:39:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1628 transitions. [2022-11-16 11:39:15,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7516158818097877 [2022-11-16 11:39:15,489 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1628 transitions. [2022-11-16 11:39:15,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1628 transitions. [2022-11-16 11:39:15,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:15,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1628 transitions. [2022-11-16 11:39:15,494 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-16 11:39:15,498 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-16 11:39:15,499 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-16 11:39:15,499 INFO L175 Difference]: Start difference. First operand has 134 places, 110 transitions, 429 flow. Second operand 19 states and 1628 transitions. [2022-11-16 11:39:15,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 194 transitions, 1333 flow [2022-11-16 11:39:15,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 194 transitions, 1256 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-11-16 11:39:15,516 INFO L231 Difference]: Finished difference. Result has 152 places, 122 transitions, 649 flow [2022-11-16 11:39:15,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=649, PETRI_PLACES=152, PETRI_TRANSITIONS=122} [2022-11-16 11:39:15,517 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 33 predicate places. [2022-11-16 11:39:15,517 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 122 transitions, 649 flow [2022-11-16 11:39:15,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.18181818181819) internal successors, (904), 11 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:15,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:15,518 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-16 11:39:15,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:39:15,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash -849289916, now seen corresponding path program 1 times [2022-11-16 11:39:15,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:15,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813126240] [2022-11-16 11:39:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:15,882 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-16 11:39:15,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:15,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813126240] [2022-11-16 11:39:15,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813126240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:15,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:15,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:39:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381997658] [2022-11-16 11:39:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:15,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:15,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:15,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:15,885 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-11-16 11:39:15,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 122 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:15,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:15,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-11-16 11:39:15,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:16,495 INFO L130 PetriNetUnfolder]: 609/1361 cut-off events. [2022-11-16 11:39:16,496 INFO L131 PetriNetUnfolder]: For 12542/18356 co-relation queries the response was YES. [2022-11-16 11:39:16,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8087 conditions, 1361 events. 609/1361 cut-off events. For 12542/18356 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7782 event pairs, 205 based on Foata normal form. 22/1308 useless extension candidates. Maximal degree in co-relation 7998. Up to 693 conditions per place. [2022-11-16 11:39:16,518 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 46 selfloop transitions, 8 changer transitions 28/160 dead transitions. [2022-11-16 11:39:16,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 160 transitions, 1360 flow [2022-11-16 11:39:16,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:39:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:39:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2022-11-16 11:39:16,522 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-11-16 11:39:16,522 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 870 transitions. [2022-11-16 11:39:16,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions. [2022-11-16 11:39:16,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:16,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions. [2022-11-16 11:39:16,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:16,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:16,529 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:16,529 INFO L175 Difference]: Start difference. First operand has 152 places, 122 transitions, 649 flow. Second operand 9 states and 870 transitions. [2022-11-16 11:39:16,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 160 transitions, 1360 flow [2022-11-16 11:39:16,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 160 transitions, 1263 flow, removed 32 selfloop flow, removed 17 redundant places. [2022-11-16 11:39:16,548 INFO L231 Difference]: Finished difference. Result has 141 places, 122 transitions, 618 flow [2022-11-16 11:39:16,549 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=618, PETRI_PLACES=141, PETRI_TRANSITIONS=122} [2022-11-16 11:39:16,552 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places. [2022-11-16 11:39:16,553 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 122 transitions, 618 flow [2022-11-16 11:39:16,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:16,554 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:16,554 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-16 11:39:16,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:39:16,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1030828978, now seen corresponding path program 1 times [2022-11-16 11:39:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:16,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071257559] [2022-11-16 11:39:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:18,602 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-16 11:39:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:18,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071257559] [2022-11-16 11:39:18,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071257559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:18,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:18,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 11:39:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889564024] [2022-11-16 11:39:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:18,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:39:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:18,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:39:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:39:18,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-16 11:39:18,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 122 transitions, 618 flow. Second operand has 15 states, 15 states have (on average 84.53333333333333) internal successors, (1268), 15 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:18,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:18,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-16 11:39:18,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:20,081 INFO L130 PetriNetUnfolder]: 743/1702 cut-off events. [2022-11-16 11:39:20,081 INFO L131 PetriNetUnfolder]: For 14731/23407 co-relation queries the response was YES. [2022-11-16 11:39:20,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9458 conditions, 1702 events. 743/1702 cut-off events. For 14731/23407 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10602 event pairs, 51 based on Foata normal form. 195/1796 useless extension candidates. Maximal degree in co-relation 9371. Up to 893 conditions per place. [2022-11-16 11:39:20,103 INFO L137 encePairwiseOnDemand]: 96/114 looper letters, 42 selfloop transitions, 27 changer transitions 47/193 dead transitions. [2022-11-16 11:39:20,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 193 transitions, 1765 flow [2022-11-16 11:39:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:39:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:39:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1401 transitions. [2022-11-16 11:39:20,109 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7680921052631579 [2022-11-16 11:39:20,109 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1401 transitions. [2022-11-16 11:39:20,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1401 transitions. [2022-11-16 11:39:20,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:20,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1401 transitions. [2022-11-16 11:39:20,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 87.5625) internal successors, (1401), 16 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:20,119 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-16 11:39:20,120 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-16 11:39:20,120 INFO L175 Difference]: Start difference. First operand has 141 places, 122 transitions, 618 flow. Second operand 16 states and 1401 transitions. [2022-11-16 11:39:20,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 193 transitions, 1765 flow [2022-11-16 11:39:20,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 193 transitions, 1729 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-11-16 11:39:20,149 INFO L231 Difference]: Finished difference. Result has 151 places, 136 transitions, 914 flow [2022-11-16 11:39:20,150 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=914, PETRI_PLACES=151, PETRI_TRANSITIONS=136} [2022-11-16 11:39:20,152 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2022-11-16 11:39:20,152 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 136 transitions, 914 flow [2022-11-16 11:39:20,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 84.53333333333333) internal successors, (1268), 15 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:20,153 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:20,153 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-16 11:39:20,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:39:20,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 387011386, now seen corresponding path program 2 times [2022-11-16 11:39:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:20,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315287975] [2022-11-16 11:39:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:21,657 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-16 11:39:21,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:21,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315287975] [2022-11-16 11:39:21,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315287975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:21,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:21,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:39:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654449040] [2022-11-16 11:39:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:21,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:39:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:39:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:39:21,662 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-16 11:39:21,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 136 transitions, 914 flow. Second operand has 14 states, 14 states have (on average 85.57142857142857) internal successors, (1198), 14 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:21,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:21,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-16 11:39:21,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:22,819 INFO L130 PetriNetUnfolder]: 826/1828 cut-off events. [2022-11-16 11:39:22,819 INFO L131 PetriNetUnfolder]: For 32438/54182 co-relation queries the response was YES. [2022-11-16 11:39:22,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13512 conditions, 1828 events. 826/1828 cut-off events. For 32438/54182 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11401 event pairs, 62 based on Foata normal form. 193/1911 useless extension candidates. Maximal degree in co-relation 13418. Up to 1021 conditions per place. [2022-11-16 11:39:22,854 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 57 selfloop transitions, 36 changer transitions 45/216 dead transitions. [2022-11-16 11:39:22,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 216 transitions, 2683 flow [2022-11-16 11:39:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:39:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:39:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1247 transitions. [2022-11-16 11:39:22,860 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.781328320802005 [2022-11-16 11:39:22,860 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1247 transitions. [2022-11-16 11:39:22,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1247 transitions. [2022-11-16 11:39:22,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:22,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1247 transitions. [2022-11-16 11:39:22,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.07142857142857) internal successors, (1247), 14 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:22,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:22,869 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:22,869 INFO L175 Difference]: Start difference. First operand has 151 places, 136 transitions, 914 flow. Second operand 14 states and 1247 transitions. [2022-11-16 11:39:22,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 216 transitions, 2683 flow [2022-11-16 11:39:22,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 216 transitions, 2534 flow, removed 56 selfloop flow, removed 9 redundant places. [2022-11-16 11:39:22,931 INFO L231 Difference]: Finished difference. Result has 156 places, 160 transitions, 1368 flow [2022-11-16 11:39:22,932 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1368, PETRI_PLACES=156, PETRI_TRANSITIONS=160} [2022-11-16 11:39:22,932 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2022-11-16 11:39:22,933 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 160 transitions, 1368 flow [2022-11-16 11:39:22,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.57142857142857) internal successors, (1198), 14 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:22,934 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:22,934 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-16 11:39:22,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:39:22,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1479023362, now seen corresponding path program 3 times [2022-11-16 11:39:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267079865] [2022-11-16 11:39:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:24,731 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-16 11:39:24,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:24,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267079865] [2022-11-16 11:39:24,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267079865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:24,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:24,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 11:39:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225825513] [2022-11-16 11:39:24,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:24,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:39:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:24,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:39:24,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:39:24,735 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-11-16 11:39:24,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 160 transitions, 1368 flow. Second operand has 15 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:24,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:24,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-11-16 11:39:24,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:26,151 INFO L130 PetriNetUnfolder]: 940/2047 cut-off events. [2022-11-16 11:39:26,151 INFO L131 PetriNetUnfolder]: For 55941/68881 co-relation queries the response was YES. [2022-11-16 11:39:26,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17556 conditions, 2047 events. 940/2047 cut-off events. For 55941/68881 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12926 event pairs, 107 based on Foata normal form. 217/2120 useless extension candidates. Maximal degree in co-relation 17460. Up to 1189 conditions per place. [2022-11-16 11:39:26,183 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 77 selfloop transitions, 29 changer transitions 47/232 dead transitions. [2022-11-16 11:39:26,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 232 transitions, 3330 flow [2022-11-16 11:39:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:39:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:39:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1342 transitions. [2022-11-16 11:39:26,194 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7847953216374269 [2022-11-16 11:39:26,195 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1342 transitions. [2022-11-16 11:39:26,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1342 transitions. [2022-11-16 11:39:26,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:26,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1342 transitions. [2022-11-16 11:39:26,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.46666666666667) internal successors, (1342), 15 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:26,203 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-16 11:39:26,204 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-16 11:39:26,205 INFO L175 Difference]: Start difference. First operand has 156 places, 160 transitions, 1368 flow. Second operand 15 states and 1342 transitions. [2022-11-16 11:39:26,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 232 transitions, 3330 flow [2022-11-16 11:39:26,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 232 transitions, 2865 flow, removed 209 selfloop flow, removed 12 redundant places. [2022-11-16 11:39:26,270 INFO L231 Difference]: Finished difference. Result has 159 places, 167 transitions, 1421 flow [2022-11-16 11:39:26,271 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1421, PETRI_PLACES=159, PETRI_TRANSITIONS=167} [2022-11-16 11:39:26,271 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2022-11-16 11:39:26,272 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 167 transitions, 1421 flow [2022-11-16 11:39:26,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 86.4) internal successors, (1296), 15 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:26,273 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:26,273 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-16 11:39:26,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:39:26,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1011226856, now seen corresponding path program 4 times [2022-11-16 11:39:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:26,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449767988] [2022-11-16 11:39:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:27,738 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-16 11:39:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:27,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449767988] [2022-11-16 11:39:27,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449767988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:27,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:27,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:39:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179389326] [2022-11-16 11:39:27,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:27,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:39:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:39:27,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:39:27,741 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-11-16 11:39:27,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 167 transitions, 1421 flow. Second operand has 11 states, 11 states have (on average 84.18181818181819) internal successors, (926), 11 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:27,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:27,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-11-16 11:39:27,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:29,592 INFO L130 PetriNetUnfolder]: 994/2386 cut-off events. [2022-11-16 11:39:29,592 INFO L131 PetriNetUnfolder]: For 54180/95675 co-relation queries the response was YES. [2022-11-16 11:39:29,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19293 conditions, 2386 events. 994/2386 cut-off events. For 54180/95675 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 17908 event pairs, 77 based on Foata normal form. 191/2439 useless extension candidates. Maximal degree in co-relation 19192. Up to 1340 conditions per place. [2022-11-16 11:39:29,623 INFO L137 encePairwiseOnDemand]: 103/114 looper letters, 94 selfloop transitions, 31 changer transitions 67/268 dead transitions. [2022-11-16 11:39:29,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 268 transitions, 4212 flow [2022-11-16 11:39:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:39:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:39:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1396 transitions. [2022-11-16 11:39:29,628 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7653508771929824 [2022-11-16 11:39:29,629 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1396 transitions. [2022-11-16 11:39:29,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1396 transitions. [2022-11-16 11:39:29,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:29,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1396 transitions. [2022-11-16 11:39:29,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 87.25) internal successors, (1396), 16 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:29,637 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-16 11:39:29,638 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-16 11:39:29,638 INFO L175 Difference]: Start difference. First operand has 159 places, 167 transitions, 1421 flow. Second operand 16 states and 1396 transitions. [2022-11-16 11:39:29,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 268 transitions, 4212 flow [2022-11-16 11:39:29,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 268 transitions, 3882 flow, removed 144 selfloop flow, removed 13 redundant places. [2022-11-16 11:39:29,726 INFO L231 Difference]: Finished difference. Result has 167 places, 182 transitions, 1870 flow [2022-11-16 11:39:29,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1870, PETRI_PLACES=167, PETRI_TRANSITIONS=182} [2022-11-16 11:39:29,727 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 48 predicate places. [2022-11-16 11:39:29,728 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 182 transitions, 1870 flow [2022-11-16 11:39:29,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.18181818181819) internal successors, (926), 11 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:29,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:29,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, 1, 1] [2022-11-16 11:39:29,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:39:29,729 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2036087294, now seen corresponding path program 1 times [2022-11-16 11:39:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:29,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226557739] [2022-11-16 11:39:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:29,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:31,358 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-16 11:39:31,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:31,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226557739] [2022-11-16 11:39:31,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226557739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:31,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:31,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:39:31,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228050402] [2022-11-16 11:39:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:31,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:39:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:39:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:39:31,361 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 114 [2022-11-16 11:39:31,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 182 transitions, 1870 flow. Second operand has 14 states, 14 states have (on average 78.14285714285714) internal successors, (1094), 14 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:31,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:31,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 114 [2022-11-16 11:39:31,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:33,872 INFO L130 PetriNetUnfolder]: 911/2214 cut-off events. [2022-11-16 11:39:33,872 INFO L131 PetriNetUnfolder]: For 36443/87584 co-relation queries the response was YES. [2022-11-16 11:39:33,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17211 conditions, 2214 events. 911/2214 cut-off events. For 36443/87584 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 16493 event pairs, 30 based on Foata normal form. 63/2154 useless extension candidates. Maximal degree in co-relation 17103. Up to 1174 conditions per place. [2022-11-16 11:39:33,903 INFO L137 encePairwiseOnDemand]: 93/114 looper letters, 94 selfloop transitions, 101 changer transitions 44/301 dead transitions. [2022-11-16 11:39:33,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 301 transitions, 4517 flow [2022-11-16 11:39:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:39:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-16 11:39:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1796 transitions. [2022-11-16 11:39:33,908 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7161084529505582 [2022-11-16 11:39:33,909 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1796 transitions. [2022-11-16 11:39:33,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1796 transitions. [2022-11-16 11:39:33,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:33,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1796 transitions. [2022-11-16 11:39:33,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 81.63636363636364) internal successors, (1796), 22 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:33,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 114.0) internal successors, (2622), 23 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:33,930 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 114.0) internal successors, (2622), 23 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:33,931 INFO L175 Difference]: Start difference. First operand has 167 places, 182 transitions, 1870 flow. Second operand 22 states and 1796 transitions. [2022-11-16 11:39:33,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 301 transitions, 4517 flow [2022-11-16 11:39:34,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 301 transitions, 4355 flow, removed 76 selfloop flow, removed 12 redundant places. [2022-11-16 11:39:34,041 INFO L231 Difference]: Finished difference. Result has 179 places, 228 transitions, 3002 flow [2022-11-16 11:39:34,042 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3002, PETRI_PLACES=179, PETRI_TRANSITIONS=228} [2022-11-16 11:39:34,042 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 60 predicate places. [2022-11-16 11:39:34,043 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 228 transitions, 3002 flow [2022-11-16 11:39:34,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.14285714285714) internal successors, (1094), 14 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:34,043 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:34,044 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-16 11:39:34,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:39:34,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash 76058852, now seen corresponding path program 2 times [2022-11-16 11:39:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:34,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553586422] [2022-11-16 11:39:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:34,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:35,681 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-16 11:39:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:35,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553586422] [2022-11-16 11:39:35,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553586422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:35,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:35,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:39:35,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068907015] [2022-11-16 11:39:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:35,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:39:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:35,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:39:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:39:35,684 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-11-16 11:39:35,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 228 transitions, 3002 flow. Second operand has 14 states, 14 states have (on average 84.71428571428571) internal successors, (1186), 14 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:35,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:35,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-11-16 11:39:35,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:37,020 INFO L130 PetriNetUnfolder]: 647/1780 cut-off events. [2022-11-16 11:39:37,020 INFO L131 PetriNetUnfolder]: For 39505/101232 co-relation queries the response was YES. [2022-11-16 11:39:37,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14733 conditions, 1780 events. 647/1780 cut-off events. For 39505/101232 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 13484 event pairs, 54 based on Foata normal form. 140/1827 useless extension candidates. Maximal degree in co-relation 14621. Up to 908 conditions per place. [2022-11-16 11:39:37,046 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 85 selfloop transitions, 76 changer transitions 32/278 dead transitions. [2022-11-16 11:39:37,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 278 transitions, 4700 flow [2022-11-16 11:39:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:39:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:39:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1397 transitions. [2022-11-16 11:39:37,049 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7658991228070176 [2022-11-16 11:39:37,049 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1397 transitions. [2022-11-16 11:39:37,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1397 transitions. [2022-11-16 11:39:37,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:37,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1397 transitions. [2022-11-16 11:39:37,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 87.3125) internal successors, (1397), 16 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:37,057 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-16 11:39:37,058 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-16 11:39:37,059 INFO L175 Difference]: Start difference. First operand has 179 places, 228 transitions, 3002 flow. Second operand 16 states and 1397 transitions. [2022-11-16 11:39:37,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 278 transitions, 4700 flow [2022-11-16 11:39:37,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 278 transitions, 4382 flow, removed 147 selfloop flow, removed 13 redundant places. [2022-11-16 11:39:37,168 INFO L231 Difference]: Finished difference. Result has 184 places, 240 transitions, 3396 flow [2022-11-16 11:39:37,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=2830, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3396, PETRI_PLACES=184, PETRI_TRANSITIONS=240} [2022-11-16 11:39:37,169 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 65 predicate places. [2022-11-16 11:39:37,169 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 240 transitions, 3396 flow [2022-11-16 11:39:37,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 84.71428571428571) internal successors, (1186), 14 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:37,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:37,171 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-16 11:39:37,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:39:37,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -554458396, now seen corresponding path program 3 times [2022-11-16 11:39:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:37,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453444443] [2022-11-16 11:39:37,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:39,333 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-16 11:39:39,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:39,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453444443] [2022-11-16 11:39:39,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453444443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:39,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:39,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-16 11:39:39,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471789556] [2022-11-16 11:39:39,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:39,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:39:39,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:39,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:39:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:39:39,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-11-16 11:39:39,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 240 transitions, 3396 flow. Second operand has 16 states, 16 states have (on average 85.4375) internal successors, (1367), 16 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:39,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:39,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-11-16 11:39:39,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:40,312 INFO L130 PetriNetUnfolder]: 593/1648 cut-off events. [2022-11-16 11:39:40,312 INFO L131 PetriNetUnfolder]: For 33924/95989 co-relation queries the response was YES. [2022-11-16 11:39:40,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13788 conditions, 1648 events. 593/1648 cut-off events. For 33924/95989 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 12395 event pairs, 44 based on Foata normal form. 71/1626 useless extension candidates. Maximal degree in co-relation 13674. Up to 804 conditions per place. [2022-11-16 11:39:40,331 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 104 selfloop transitions, 60 changer transitions 31/279 dead transitions. [2022-11-16 11:39:40,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 279 transitions, 4739 flow [2022-11-16 11:39:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:39:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 11:39:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1485 transitions. [2022-11-16 11:39:40,335 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7662538699690402 [2022-11-16 11:39:40,335 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1485 transitions. [2022-11-16 11:39:40,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1485 transitions. [2022-11-16 11:39:40,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:40,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1485 transitions. [2022-11-16 11:39:40,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 87.3529411764706) internal successors, (1485), 17 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-16 11:39:40,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:40,344 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:40,344 INFO L175 Difference]: Start difference. First operand has 184 places, 240 transitions, 3396 flow. Second operand 17 states and 1485 transitions. [2022-11-16 11:39:40,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 279 transitions, 4739 flow [2022-11-16 11:39:40,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 279 transitions, 4369 flow, removed 176 selfloop flow, removed 11 redundant places. [2022-11-16 11:39:40,496 INFO L231 Difference]: Finished difference. Result has 191 places, 238 transitions, 3308 flow [2022-11-16 11:39:40,497 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=3142, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3308, PETRI_PLACES=191, PETRI_TRANSITIONS=238} [2022-11-16 11:39:40,499 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 72 predicate places. [2022-11-16 11:39:40,499 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 238 transitions, 3308 flow [2022-11-16 11:39:40,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 85.4375) internal successors, (1367), 16 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:40,500 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:40,500 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-16 11:39:40,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:39:40,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:40,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash -485817257, now seen corresponding path program 1 times [2022-11-16 11:39:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:40,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182391911] [2022-11-16 11:39:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:40,765 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-16 11:39:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:40,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182391911] [2022-11-16 11:39:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182391911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:40,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:40,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:39:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213263342] [2022-11-16 11:39:40,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:40,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:40,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:40,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:40,773 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-16 11:39:40,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 238 transitions, 3308 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-16 11:39:40,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:40,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-16 11:39:40,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:42,833 INFO L130 PetriNetUnfolder]: 4391/8824 cut-off events. [2022-11-16 11:39:42,833 INFO L131 PetriNetUnfolder]: For 316994/319347 co-relation queries the response was YES. [2022-11-16 11:39:42,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60236 conditions, 8824 events. 4391/8824 cut-off events. For 316994/319347 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 76571 event pairs, 158 based on Foata normal form. 538/9099 useless extension candidates. Maximal degree in co-relation 60124. Up to 3122 conditions per place. [2022-11-16 11:39:42,915 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 174 selfloop transitions, 7 changer transitions 243/514 dead transitions. [2022-11-16 11:39:42,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 514 transitions, 11270 flow [2022-11-16 11:39:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:39:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:39:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-11-16 11:39:42,918 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8570175438596491 [2022-11-16 11:39:42,918 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 977 transitions. [2022-11-16 11:39:42,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 977 transitions. [2022-11-16 11:39:42,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:42,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 977 transitions. [2022-11-16 11:39:42,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:42,923 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-16 11:39:42,924 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-16 11:39:42,924 INFO L175 Difference]: Start difference. First operand has 191 places, 238 transitions, 3308 flow. Second operand 10 states and 977 transitions. [2022-11-16 11:39:42,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 514 transitions, 11270 flow [2022-11-16 11:39:43,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 514 transitions, 10316 flow, removed 282 selfloop flow, removed 18 redundant places. [2022-11-16 11:39:43,274 INFO L231 Difference]: Finished difference. Result has 181 places, 196 transitions, 2393 flow [2022-11-16 11:39:43,274 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=2348, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2393, PETRI_PLACES=181, PETRI_TRANSITIONS=196} [2022-11-16 11:39:43,275 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 62 predicate places. [2022-11-16 11:39:43,275 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 196 transitions, 2393 flow [2022-11-16 11:39:43,276 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-16 11:39:43,276 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:43,276 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-16 11:39:43,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:39:43,276 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2107543508, now seen corresponding path program 1 times [2022-11-16 11:39:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:43,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878922190] [2022-11-16 11:39:43,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:43,639 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-16 11:39:43,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:43,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878922190] [2022-11-16 11:39:43,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878922190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:43,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:43,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:39:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002853696] [2022-11-16 11:39:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:43,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:39:43,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:43,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:39:43,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:39:43,642 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-16 11:39:43,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 196 transitions, 2393 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-16 11:39:43,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:43,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-16 11:39:43,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:44,900 INFO L130 PetriNetUnfolder]: 1916/4417 cut-off events. [2022-11-16 11:39:44,901 INFO L131 PetriNetUnfolder]: For 131481/132472 co-relation queries the response was YES. [2022-11-16 11:39:44,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32037 conditions, 4417 events. 1916/4417 cut-off events. For 131481/132472 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 37523 event pairs, 142 based on Foata normal form. 290/4656 useless extension candidates. Maximal degree in co-relation 31932. Up to 1503 conditions per place. [2022-11-16 11:39:44,938 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 141 selfloop transitions, 18 changer transitions 124/372 dead transitions. [2022-11-16 11:39:44,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 372 transitions, 7334 flow [2022-11-16 11:39:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:39:44,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:39:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1070 transitions. [2022-11-16 11:39:44,941 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8532695374800638 [2022-11-16 11:39:44,941 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1070 transitions. [2022-11-16 11:39:44,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1070 transitions. [2022-11-16 11:39:44,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:44,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1070 transitions. [2022-11-16 11:39:44,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.27272727272727) internal successors, (1070), 11 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:44,947 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-16 11:39:44,947 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-16 11:39:44,948 INFO L175 Difference]: Start difference. First operand has 181 places, 196 transitions, 2393 flow. Second operand 11 states and 1070 transitions. [2022-11-16 11:39:44,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 372 transitions, 7334 flow [2022-11-16 11:39:45,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 372 transitions, 6449 flow, removed 395 selfloop flow, removed 10 redundant places. [2022-11-16 11:39:45,103 INFO L231 Difference]: Finished difference. Result has 182 places, 185 transitions, 1895 flow [2022-11-16 11:39:45,103 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1895, PETRI_PLACES=182, PETRI_TRANSITIONS=185} [2022-11-16 11:39:45,104 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 63 predicate places. [2022-11-16 11:39:45,104 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 185 transitions, 1895 flow [2022-11-16 11:39:45,105 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-16 11:39:45,105 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:45,105 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-16 11:39:45,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:39:45,106 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:45,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1272997491, now seen corresponding path program 1 times [2022-11-16 11:39:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:45,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571688404] [2022-11-16 11:39:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:45,431 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-16 11:39:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:45,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571688404] [2022-11-16 11:39:45,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571688404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:45,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:45,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:39:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956421411] [2022-11-16 11:39:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:45,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:39:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:45,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:39:45,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:39:45,435 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-11-16 11:39:45,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 185 transitions, 1895 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-16 11:39:45,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:45,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-11-16 11:39:45,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:46,807 INFO L130 PetriNetUnfolder]: 1682/4120 cut-off events. [2022-11-16 11:39:46,807 INFO L131 PetriNetUnfolder]: For 84076/84673 co-relation queries the response was YES. [2022-11-16 11:39:46,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28247 conditions, 4120 events. 1682/4120 cut-off events. For 84076/84673 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 36605 event pairs, 134 based on Foata normal form. 155/4247 useless extension candidates. Maximal degree in co-relation 28143. Up to 1370 conditions per place. [2022-11-16 11:39:46,850 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 128 selfloop transitions, 22 changer transitions 106/345 dead transitions. [2022-11-16 11:39:46,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 345 transitions, 5802 flow [2022-11-16 11:39:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:39:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:39:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1321 transitions. [2022-11-16 11:39:46,859 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8276942355889725 [2022-11-16 11:39:46,859 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1321 transitions. [2022-11-16 11:39:46,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1321 transitions. [2022-11-16 11:39:46,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:46,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1321 transitions. [2022-11-16 11:39:46,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.35714285714286) internal successors, (1321), 14 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-16 11:39:46,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:46,869 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:46,870 INFO L175 Difference]: Start difference. First operand has 182 places, 185 transitions, 1895 flow. Second operand 14 states and 1321 transitions. [2022-11-16 11:39:46,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 345 transitions, 5802 flow [2022-11-16 11:39:47,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 345 transitions, 5445 flow, removed 95 selfloop flow, removed 6 redundant places. [2022-11-16 11:39:47,243 INFO L231 Difference]: Finished difference. Result has 196 places, 183 transitions, 1772 flow [2022-11-16 11:39:47,243 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1772, PETRI_PLACES=196, PETRI_TRANSITIONS=183} [2022-11-16 11:39:47,244 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 77 predicate places. [2022-11-16 11:39:47,244 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 183 transitions, 1772 flow [2022-11-16 11:39:47,244 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-16 11:39:47,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:47,244 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-16 11:39:47,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:39:47,244 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:47,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash 130481914, now seen corresponding path program 1 times [2022-11-16 11:39:47,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:47,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443140627] [2022-11-16 11:39:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:48,750 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-16 11:39:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:48,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443140627] [2022-11-16 11:39:48,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443140627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:48,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:48,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:39:48,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763797045] [2022-11-16 11:39:48,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:48,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:39:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:48,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:39:48,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:39:48,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-11-16 11:39:48,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 183 transitions, 1772 flow. Second operand has 12 states, 12 states have (on average 84.25) internal successors, (1011), 12 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:48,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:48,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-11-16 11:39:48,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:49,807 INFO L130 PetriNetUnfolder]: 380/2456 cut-off events. [2022-11-16 11:39:49,807 INFO L131 PetriNetUnfolder]: For 10109/10232 co-relation queries the response was YES. [2022-11-16 11:39:49,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9330 conditions, 2456 events. 380/2456 cut-off events. For 10109/10232 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 28878 event pairs, 17 based on Foata normal form. 4/2334 useless extension candidates. Maximal degree in co-relation 9213. Up to 350 conditions per place. [2022-11-16 11:39:49,834 INFO L137 encePairwiseOnDemand]: 100/114 looper letters, 61 selfloop transitions, 32 changer transitions 23/216 dead transitions. [2022-11-16 11:39:49,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 216 transitions, 2394 flow [2022-11-16 11:39:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:39:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:39:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1381 transitions. [2022-11-16 11:39:49,838 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7571271929824561 [2022-11-16 11:39:49,838 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1381 transitions. [2022-11-16 11:39:49,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1381 transitions. [2022-11-16 11:39:49,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:49,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1381 transitions. [2022-11-16 11:39:49,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.3125) internal successors, (1381), 16 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:49,845 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-16 11:39:49,845 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-16 11:39:49,846 INFO L175 Difference]: Start difference. First operand has 196 places, 183 transitions, 1772 flow. Second operand 16 states and 1381 transitions. [2022-11-16 11:39:49,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 216 transitions, 2394 flow [2022-11-16 11:39:49,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 216 transitions, 1962 flow, removed 196 selfloop flow, removed 20 redundant places. [2022-11-16 11:39:49,958 INFO L231 Difference]: Finished difference. Result has 198 places, 186 transitions, 1645 flow [2022-11-16 11:39:49,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1645, PETRI_PLACES=198, PETRI_TRANSITIONS=186} [2022-11-16 11:39:49,959 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 79 predicate places. [2022-11-16 11:39:49,959 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 186 transitions, 1645 flow [2022-11-16 11:39:49,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.25) internal successors, (1011), 12 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:49,960 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:49,960 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-16 11:39:49,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:39:49,961 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -520588892, now seen corresponding path program 2 times [2022-11-16 11:39:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:49,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014170678] [2022-11-16 11:39:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:51,876 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-16 11:39:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:51,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014170678] [2022-11-16 11:39:51,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014170678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:51,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:51,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 11:39:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438125068] [2022-11-16 11:39:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:51,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:39:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:39:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:39:51,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-11-16 11:39:51,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 186 transitions, 1645 flow. Second operand has 15 states, 15 states have (on average 86.6) internal successors, (1299), 15 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:51,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:51,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-11-16 11:39:51,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:52,733 INFO L130 PetriNetUnfolder]: 352/2329 cut-off events. [2022-11-16 11:39:52,733 INFO L131 PetriNetUnfolder]: For 4853/4886 co-relation queries the response was YES. [2022-11-16 11:39:52,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7259 conditions, 2329 events. 352/2329 cut-off events. For 4853/4886 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 27398 event pairs, 14 based on Foata normal form. 4/2209 useless extension candidates. Maximal degree in co-relation 7212. Up to 264 conditions per place. [2022-11-16 11:39:52,761 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 50 selfloop transitions, 29 changer transitions 20/202 dead transitions. [2022-11-16 11:39:52,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 202 transitions, 2050 flow [2022-11-16 11:39:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:39:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:39:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1242 transitions. [2022-11-16 11:39:52,764 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7781954887218046 [2022-11-16 11:39:52,764 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1242 transitions. [2022-11-16 11:39:52,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1242 transitions. [2022-11-16 11:39:52,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:52,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1242 transitions. [2022-11-16 11:39:52,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.71428571428571) internal successors, (1242), 14 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:52,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:52,771 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:52,772 INFO L175 Difference]: Start difference. First operand has 198 places, 186 transitions, 1645 flow. Second operand 14 states and 1242 transitions. [2022-11-16 11:39:52,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 202 transitions, 2050 flow [2022-11-16 11:39:52,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 202 transitions, 1896 flow, removed 53 selfloop flow, removed 15 redundant places. [2022-11-16 11:39:52,834 INFO L231 Difference]: Finished difference. Result has 191 places, 181 transitions, 1547 flow [2022-11-16 11:39:52,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1547, PETRI_PLACES=191, PETRI_TRANSITIONS=181} [2022-11-16 11:39:52,835 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 72 predicate places. [2022-11-16 11:39:52,835 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 181 transitions, 1547 flow [2022-11-16 11:39:52,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 86.6) internal successors, (1299), 15 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:52,836 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:52,836 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-16 11:39:52,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:39:52,836 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1613404944, now seen corresponding path program 3 times [2022-11-16 11:39:52,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:52,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952538148] [2022-11-16 11:39:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:52,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:54,618 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-16 11:39:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:54,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952538148] [2022-11-16 11:39:54,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952538148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:54,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:54,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 11:39:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632932888] [2022-11-16 11:39:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:54,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:39:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:39:54,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:39:54,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 114 [2022-11-16 11:39:54,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 181 transitions, 1547 flow. Second operand has 13 states, 13 states have (on average 77.61538461538461) internal successors, (1009), 13 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:54,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:54,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 114 [2022-11-16 11:39:54,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:55,980 INFO L130 PetriNetUnfolder]: 341/2073 cut-off events. [2022-11-16 11:39:55,981 INFO L131 PetriNetUnfolder]: For 3793/3826 co-relation queries the response was YES. [2022-11-16 11:39:55,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6377 conditions, 2073 events. 341/2073 cut-off events. For 3793/3826 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 23143 event pairs, 13 based on Foata normal form. 1/1965 useless extension candidates. Maximal degree in co-relation 6338. Up to 240 conditions per place. [2022-11-16 11:39:56,000 INFO L137 encePairwiseOnDemand]: 96/114 looper letters, 53 selfloop transitions, 37 changer transitions 37/208 dead transitions. [2022-11-16 11:39:56,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 208 transitions, 2077 flow [2022-11-16 11:39:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:39:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 11:39:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1345 transitions. [2022-11-16 11:39:56,004 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6940144478844169 [2022-11-16 11:39:56,004 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1345 transitions. [2022-11-16 11:39:56,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1345 transitions. [2022-11-16 11:39:56,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:56,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1345 transitions. [2022-11-16 11:39:56,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 79.11764705882354) internal successors, (1345), 17 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:56,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:56,012 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:56,012 INFO L175 Difference]: Start difference. First operand has 191 places, 181 transitions, 1547 flow. Second operand 17 states and 1345 transitions. [2022-11-16 11:39:56,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 208 transitions, 2077 flow [2022-11-16 11:39:56,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 208 transitions, 2026 flow, removed 8 selfloop flow, removed 11 redundant places. [2022-11-16 11:39:56,061 INFO L231 Difference]: Finished difference. Result has 199 places, 164 transitions, 1340 flow [2022-11-16 11:39:56,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1340, PETRI_PLACES=199, PETRI_TRANSITIONS=164} [2022-11-16 11:39:56,062 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 80 predicate places. [2022-11-16 11:39:56,062 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 164 transitions, 1340 flow [2022-11-16 11:39:56,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 77.61538461538461) internal successors, (1009), 13 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:56,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:56,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:39:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:39:56,063 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:56,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1897985598, now seen corresponding path program 4 times [2022-11-16 11:39:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:56,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517848968] [2022-11-16 11:39:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:57,941 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-16 11:39:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:57,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517848968] [2022-11-16 11:39:57,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517848968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:57,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:57,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 11:39:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814803773] [2022-11-16 11:39:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:57,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:39:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:57,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:39:57,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:39:57,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 114 [2022-11-16 11:39:57,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 164 transitions, 1340 flow. Second operand has 17 states, 17 states have (on average 77.94117647058823) internal successors, (1325), 17 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:57,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:57,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 114 [2022-11-16 11:39:57,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:58,980 INFO L130 PetriNetUnfolder]: 204/1388 cut-off events. [2022-11-16 11:39:58,980 INFO L131 PetriNetUnfolder]: For 2645/2665 co-relation queries the response was YES. [2022-11-16 11:39:58,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 1388 events. 204/1388 cut-off events. For 2645/2665 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14169 event pairs, 12 based on Foata normal form. 1/1321 useless extension candidates. Maximal degree in co-relation 4165. Up to 162 conditions per place. [2022-11-16 11:39:58,993 INFO L137 encePairwiseOnDemand]: 93/114 looper letters, 38 selfloop transitions, 19 changer transitions 37/176 dead transitions. [2022-11-16 11:39:58,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 176 transitions, 1636 flow [2022-11-16 11:39:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:39:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-16 11:39:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1433 transitions. [2022-11-16 11:39:58,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6983430799220273 [2022-11-16 11:39:58,997 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1433 transitions. [2022-11-16 11:39:58,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1433 transitions. [2022-11-16 11:39:58,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:58,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1433 transitions. [2022-11-16 11:39:59,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 79.61111111111111) internal successors, (1433), 18 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:59,003 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-16 11:39:59,004 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-16 11:39:59,004 INFO L175 Difference]: Start difference. First operand has 199 places, 164 transitions, 1340 flow. Second operand 18 states and 1433 transitions. [2022-11-16 11:39:59,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 176 transitions, 1636 flow [2022-11-16 11:39:59,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 176 transitions, 1554 flow, removed 23 selfloop flow, removed 17 redundant places. [2022-11-16 11:39:59,034 INFO L231 Difference]: Finished difference. Result has 197 places, 139 transitions, 913 flow [2022-11-16 11:39:59,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=913, PETRI_PLACES=197, PETRI_TRANSITIONS=139} [2022-11-16 11:39:59,035 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 78 predicate places. [2022-11-16 11:39:59,035 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 139 transitions, 913 flow [2022-11-16 11:39:59,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 77.94117647058823) internal successors, (1325), 17 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:59,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:59,036 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-16 11:39:59,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:39:59,037 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:39:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash 961108108, now seen corresponding path program 5 times [2022-11-16 11:39:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:59,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836199466] [2022-11-16 11:39:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:59,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:01,489 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-16 11:40:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:01,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836199466] [2022-11-16 11:40:01,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836199466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:01,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:01,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:40:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146487922] [2022-11-16 11:40:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:01,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:40:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:40:01,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:40:01,492 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-11-16 11:40:01,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 139 transitions, 913 flow. Second operand has 14 states, 14 states have (on average 83.92857142857143) internal successors, (1175), 14 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:01,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:01,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-11-16 11:40:01,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:02,150 INFO L130 PetriNetUnfolder]: 169/1138 cut-off events. [2022-11-16 11:40:02,150 INFO L131 PetriNetUnfolder]: For 1747/1761 co-relation queries the response was YES. [2022-11-16 11:40:02,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 1138 events. 169/1138 cut-off events. For 1747/1761 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11105 event pairs, 2 based on Foata normal form. 1/1079 useless extension candidates. Maximal degree in co-relation 3134. Up to 150 conditions per place. [2022-11-16 11:40:02,156 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 29 selfloop transitions, 15 changer transitions 18/154 dead transitions. [2022-11-16 11:40:02,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 154 transitions, 1190 flow [2022-11-16 11:40:02,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:40:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:40:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1197 transitions. [2022-11-16 11:40:02,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-11-16 11:40:02,159 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1197 transitions. [2022-11-16 11:40:02,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1197 transitions. [2022-11-16 11:40:02,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:02,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1197 transitions. [2022-11-16 11:40:02,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 85.5) internal successors, (1197), 14 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:02,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:02,165 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:02,165 INFO L175 Difference]: Start difference. First operand has 197 places, 139 transitions, 913 flow. Second operand 14 states and 1197 transitions. [2022-11-16 11:40:02,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 154 transitions, 1190 flow [2022-11-16 11:40:02,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 154 transitions, 1068 flow, removed 28 selfloop flow, removed 22 redundant places. [2022-11-16 11:40:02,185 INFO L231 Difference]: Finished difference. Result has 179 places, 134 transitions, 791 flow [2022-11-16 11:40:02,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=791, PETRI_PLACES=179, PETRI_TRANSITIONS=134} [2022-11-16 11:40:02,186 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 60 predicate places. [2022-11-16 11:40:02,186 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 134 transitions, 791 flow [2022-11-16 11:40:02,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 83.92857142857143) internal successors, (1175), 14 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:02,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:02,187 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-16 11:40:02,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:40:02,188 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:40:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1238449700, now seen corresponding path program 6 times [2022-11-16 11:40:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:02,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250418267] [2022-11-16 11:40:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:03,046 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-16 11:40:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:03,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250418267] [2022-11-16 11:40:03,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250418267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:03,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:03,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:40:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619809570] [2022-11-16 11:40:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:03,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:40:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:03,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:40:03,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:40:03,049 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 114 [2022-11-16 11:40:03,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 134 transitions, 791 flow. Second operand has 12 states, 12 states have (on average 78.75) internal successors, (945), 12 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:03,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:03,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 114 [2022-11-16 11:40:03,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:03,912 INFO L130 PetriNetUnfolder]: 110/726 cut-off events. [2022-11-16 11:40:03,912 INFO L131 PetriNetUnfolder]: For 1063/1080 co-relation queries the response was YES. [2022-11-16 11:40:03,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 726 events. 110/726 cut-off events. For 1063/1080 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6042 event pairs, 0 based on Foata normal form. 1/688 useless extension candidates. Maximal degree in co-relation 1984. Up to 102 conditions per place. [2022-11-16 11:40:03,917 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 24 selfloop transitions, 10 changer transitions 31/145 dead transitions. [2022-11-16 11:40:03,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 145 transitions, 997 flow [2022-11-16 11:40:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:40:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:40:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1195 transitions. [2022-11-16 11:40:03,920 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6988304093567251 [2022-11-16 11:40:03,920 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1195 transitions. [2022-11-16 11:40:03,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1195 transitions. [2022-11-16 11:40:03,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:03,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1195 transitions. [2022-11-16 11:40:03,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 79.66666666666667) internal successors, (1195), 15 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:03,926 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-16 11:40:03,926 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-16 11:40:03,927 INFO L175 Difference]: Start difference. First operand has 179 places, 134 transitions, 791 flow. Second operand 15 states and 1195 transitions. [2022-11-16 11:40:03,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 145 transitions, 997 flow [2022-11-16 11:40:03,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 145 transitions, 925 flow, removed 16 selfloop flow, removed 15 redundant places. [2022-11-16 11:40:03,938 INFO L231 Difference]: Finished difference. Result has 178 places, 113 transitions, 504 flow [2022-11-16 11:40:03,939 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=504, PETRI_PLACES=178, PETRI_TRANSITIONS=113} [2022-11-16 11:40:03,939 INFO L288 CegarLoopForPetriNet]: 119 programPoint places, 59 predicate places. [2022-11-16 11:40:03,940 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 113 transitions, 504 flow [2022-11-16 11:40:03,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 78.75) internal successors, (945), 12 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:03,940 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:03,940 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-16 11:40:03,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:40:03,941 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:40:03,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:03,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1925006158, now seen corresponding path program 7 times [2022-11-16 11:40:03,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:03,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002716045] [2022-11-16 11:40:03,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:40:04,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:40:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:40:04,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:40:04,110 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:40:04,112 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 11:40:04,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:40:04,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 11:40:04,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 11:40:04,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 11:40:04,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:40:04,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:40:04,135 INFO L444 BasicCegarLoop]: Path program histogram: [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:40:04,141 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:40:04,142 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:40:04,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:40:04 BasicIcfg [2022-11-16 11:40:04,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:40:04,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:40:04,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:40:04,264 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:40:04,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:39:05" (3/4) ... [2022-11-16 11:40:04,267 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:40:04,406 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:40:04,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:40:04,407 INFO L158 Benchmark]: Toolchain (without parser) took 61019.08ms. Allocated memory was 123.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 83.1MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 226.4MB. Max. memory is 16.1GB. [2022-11-16 11:40:04,408 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 123.7MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:40:04,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.56ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 84.7MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:40:04,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.83ms. Allocated memory is still 123.7MB. Free memory was 84.7MB in the beginning and 82.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:40:04,409 INFO L158 Benchmark]: Boogie Preprocessor took 76.44ms. Allocated memory is still 123.7MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:40:04,409 INFO L158 Benchmark]: RCFGBuilder took 982.58ms. Allocated memory is still 123.7MB. Free memory was 80.0MB in the beginning and 82.7MB in the end (delta: -2.7MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-11-16 11:40:04,410 INFO L158 Benchmark]: TraceAbstraction took 59083.02ms. Allocated memory was 123.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 82.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. [2022-11-16 11:40:04,410 INFO L158 Benchmark]: Witness Printer took 142.90ms. Allocated memory is still 1.7GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 11:40:04,412 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.28ms. Allocated memory is still 123.7MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.56ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 84.7MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.83ms. Allocated memory is still 123.7MB. Free memory was 84.7MB in the beginning and 82.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.44ms. Allocated memory is still 123.7MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 982.58ms. Allocated memory is still 123.7MB. Free memory was 80.0MB in the beginning and 82.7MB in the end (delta: -2.7MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * TraceAbstraction took 59083.02ms. Allocated memory was 123.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 82.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. * Witness Printer took 142.90ms. Allocated memory is still 1.7GB. Free memory was 1.5GB in the beginning and 1.4GB 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L719] 0 _Bool x$flush_delayed; VAL [x$flush_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [x$flush_delayed=0, x$read_delayed_var={0:0}] [L737] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L738] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L720] 0 int x$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2537; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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: 58.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1663 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1663 mSDsluCounter, 2039 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1715 mSDsCounter, 496 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4425 IncrementalHoareTripleChecker+Invalid, 4921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 496 mSolverCounterUnsat, 324 mSDtfsCounter, 4425 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3396occurred in iteration=11, InterpolantAutomatonStates: 302, 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.2s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1804 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1695 ConstructedInterpolants, 0 QuantifiedInterpolants, 13373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-16 11:40:04,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_266e762f-b73b-4126-9ffa-9570ac3a3105/bin/uautomizer-tPACEb0tL8/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