./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN --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 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 --- 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-6b4ec56 [2022-11-20 09:34:39,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:34:39,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:34:39,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:34:39,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:34:39,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:34:39,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:34:39,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:34:39,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:34:39,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:34:39,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:34:39,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:34:39,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:34:40,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:34:40,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:34:40,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:34:40,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:34:40,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:34:40,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:34:40,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:34:40,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:34:40,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:34:40,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:34:40,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:34:40,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:34:40,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:34:40,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:34:40,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:34:40,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:34:40,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:34:40,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:34:40,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:34:40,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:34:40,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:34:40,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:34:40,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:34:40,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:34:40,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:34:40,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:34:40,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:34:40,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:34:40,062 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:34:40,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:34:40,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:34:40,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:34:40,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:34:40,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:34:40,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:34:40,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:34:40,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:34:40,122 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:34:40,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:34:40,124 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:34:40,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:34:40,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:34:40,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:34:40,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:34:40,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:34:40,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:34:40,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:34:40,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:34:40,128 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:34:40,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:34:40,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:34:40,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:34:40,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:34:40,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:34:40,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:34:40,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:34:40,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:34:40,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:34:40,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:34:40,133 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:34:40,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:34:40,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:34:40,134 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_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/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_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN 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 -> 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 [2022-11-20 09:34:40,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:34:40,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:34:40,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:34:40,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:34:40,539 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:34:40,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-11-20 09:34:44,155 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:34:44,420 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:34:44,422 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-11-20 09:34:44,437 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/data/90a7e075d/0fc7df9ac39d46c59e5d118f3cf7a6eb/FLAG8a32e3689 [2022-11-20 09:34:44,468 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/data/90a7e075d/0fc7df9ac39d46c59e5d118f3cf7a6eb [2022-11-20 09:34:44,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:34:44,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:34:44,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:34:44,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:34:44,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:34:44,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:44,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38547dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44, skipping insertion in model container [2022-11-20 09:34:44,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:44,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:34:44,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:34:44,860 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2022-11-20 09:34:44,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:34:44,895 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:34:44,955 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2022-11-20 09:34:44,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:34:44,984 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:34:44,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44 WrapperNode [2022-11-20 09:34:44,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:34:44,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:34:44,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:34:44,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:34:44,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,067 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-11-20 09:34:45,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:34:45,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:34:45,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:34:45,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:34:45,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,147 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:34:45,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:34:45,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:34:45,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:34:45,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (1/1) ... [2022-11-20 09:34:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:34:45,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:34:45,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:34:45,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1469311c-c655-4fb0-9e4d-c74b6f72bac1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:34:45,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:34:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:34:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:34:45,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:34:45,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 09:34:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 09:34:45,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 09:34:45,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 09:34:45,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 09:34:45,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 09:34:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:34:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 09:34:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:34:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:34:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:34:45,268 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:34:45,404 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:34:45,407 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:34:46,082 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:34:46,098 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:34:46,099 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 09:34:46,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:34:46 BoogieIcfgContainer [2022-11-20 09:34:46,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:34:46,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:34:46,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:34:46,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:34:46,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:34:44" (1/3) ... [2022-11-20 09:34:46,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b135980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:34:46, skipping insertion in model container [2022-11-20 09:34:46,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:34:44" (2/3) ... [2022-11-20 09:34:46,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b135980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:34:46, skipping insertion in model container [2022-11-20 09:34:46,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:34:46" (3/3) ... [2022-11-20 09:34:46,128 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-11-20 09:34:46,137 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 09:34:46,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:34:46,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:34:46,150 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:34:46,377 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 09:34:46,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 302 transitions, 628 flow [2022-11-20 09:34:46,601 INFO L130 PetriNetUnfolder]: 28/299 cut-off events. [2022-11-20 09:34:46,601 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 09:34:46,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 28/299 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 362 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 241. Up to 3 conditions per place. [2022-11-20 09:34:46,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 302 transitions, 628 flow [2022-11-20 09:34:46,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 288 transitions, 594 flow [2022-11-20 09:34:46,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:34:46,641 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;@6197e066, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:34:46,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 09:34:46,745 INFO L130 PetriNetUnfolder]: 28/287 cut-off events. [2022-11-20 09:34:46,746 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 09:34:46,746 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:46,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:34:46,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:34:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash -916364410, now seen corresponding path program 1 times [2022-11-20 09:34:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:46,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21486296] [2022-11-20 09:34:46,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:47,244 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-20 09:34:47,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:47,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21486296] [2022-11-20 09:34:47,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21486296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:47,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:47,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:34:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724394538] [2022-11-20 09:34:47,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:47,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:34:47,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:34:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:34:47,310 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 302 [2022-11-20 09:34:47,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 288 transitions, 594 flow. Second operand has 2 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:47,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:47,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 302 [2022-11-20 09:34:47,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:47,454 INFO L130 PetriNetUnfolder]: 15/275 cut-off events. [2022-11-20 09:34:47,454 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-20 09:34:47,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 275 events. 15/275 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 359 event pairs, 0 based on Foata normal form. 19/272 useless extension candidates. Maximal degree in co-relation 232. Up to 7 conditions per place. [2022-11-20 09:34:47,462 INFO L137 encePairwiseOnDemand]: 289/302 looper letters, 6 selfloop transitions, 0 changer transitions 7/275 dead transitions. [2022-11-20 09:34:47,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 275 transitions, 580 flow [2022-11-20 09:34:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:34:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 09:34:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 583 transitions. [2022-11-20 09:34:47,491 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9652317880794702 [2022-11-20 09:34:47,492 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 583 transitions. [2022-11-20 09:34:47,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 583 transitions. [2022-11-20 09:34:47,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:47,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 583 transitions. [2022-11-20 09:34:47,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 291.5) internal successors, (583), 2 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:47,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:47,531 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:47,534 INFO L175 Difference]: Start difference. First operand has 270 places, 288 transitions, 594 flow. Second operand 2 states and 583 transitions. [2022-11-20 09:34:47,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 275 transitions, 580 flow [2022-11-20 09:34:47,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 275 transitions, 568 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 09:34:47,554 INFO L231 Difference]: Finished difference. Result has 265 places, 268 transitions, 542 flow [2022-11-20 09:34:47,557 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=542, PETRI_PLACES=265, PETRI_TRANSITIONS=268} [2022-11-20 09:34:47,562 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, -5 predicate places. [2022-11-20 09:34:47,562 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 268 transitions, 542 flow [2022-11-20 09:34:47,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:47,563 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:47,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:34:47,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:34:47,565 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:34:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1029050077, now seen corresponding path program 1 times [2022-11-20 09:34:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:47,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224266874] [2022-11-20 09:34:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:47,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:34:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224266874] [2022-11-20 09:34:48,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224266874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:48,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:48,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:34:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504320818] [2022-11-20 09:34:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:48,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:34:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:48,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:34:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:34:48,961 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-20 09:34:48,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 268 transitions, 542 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:48,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:48,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-20 09:34:48,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:50,009 INFO L130 PetriNetUnfolder]: 490/1949 cut-off events. [2022-11-20 09:34:50,009 INFO L131 PetriNetUnfolder]: For 55/60 co-relation queries the response was YES. [2022-11-20 09:34:50,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2646 conditions, 1949 events. 490/1949 cut-off events. For 55/60 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 15074 event pairs, 221 based on Foata normal form. 2/1635 useless extension candidates. Maximal degree in co-relation 2643. Up to 493 conditions per place. [2022-11-20 09:34:50,037 INFO L137 encePairwiseOnDemand]: 291/302 looper letters, 84 selfloop transitions, 7 changer transitions 6/307 dead transitions. [2022-11-20 09:34:50,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 307 transitions, 825 flow [2022-11-20 09:34:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:34:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:34:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1882 transitions. [2022-11-20 09:34:50,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7789735099337748 [2022-11-20 09:34:50,045 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1882 transitions. [2022-11-20 09:34:50,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1882 transitions. [2022-11-20 09:34:50,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:50,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1882 transitions. [2022-11-20 09:34:50,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 235.25) internal successors, (1882), 8 states have internal predecessors, (1882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:50,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:50,063 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:50,063 INFO L175 Difference]: Start difference. First operand has 265 places, 268 transitions, 542 flow. Second operand 8 states and 1882 transitions. [2022-11-20 09:34:50,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 307 transitions, 825 flow [2022-11-20 09:34:50,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 307 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 09:34:50,076 INFO L231 Difference]: Finished difference. Result has 270 places, 272 transitions, 589 flow [2022-11-20 09:34:50,077 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=589, PETRI_PLACES=270, PETRI_TRANSITIONS=272} [2022-11-20 09:34:50,078 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 0 predicate places. [2022-11-20 09:34:50,078 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 272 transitions, 589 flow [2022-11-20 09:34:50,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:50,080 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:50,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:34:50,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:34:50,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:34:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1611176919, now seen corresponding path program 2 times [2022-11-20 09:34:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:50,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194528791] [2022-11-20 09:34:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:51,104 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-20 09:34:51,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:51,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194528791] [2022-11-20 09:34:51,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194528791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:51,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:51,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:34:51,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730106676] [2022-11-20 09:34:51,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:51,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:34:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:51,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:34:51,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:34:51,113 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-20 09:34:51,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 272 transitions, 589 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:51,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:51,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-20 09:34:51,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:52,145 INFO L130 PetriNetUnfolder]: 601/2410 cut-off events. [2022-11-20 09:34:52,145 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-11-20 09:34:52,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 2410 events. 601/2410 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 20247 event pairs, 315 based on Foata normal form. 1/2058 useless extension candidates. Maximal degree in co-relation 3611. Up to 587 conditions per place. [2022-11-20 09:34:52,166 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 87 selfloop transitions, 9 changer transitions 6/312 dead transitions. [2022-11-20 09:34:52,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 312 transitions, 924 flow [2022-11-20 09:34:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:34:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:34:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2106 transitions. [2022-11-20 09:34:52,172 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7748344370860927 [2022-11-20 09:34:52,172 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2106 transitions. [2022-11-20 09:34:52,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2106 transitions. [2022-11-20 09:34:52,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:52,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2106 transitions. [2022-11-20 09:34:52,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:52,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:52,188 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:52,188 INFO L175 Difference]: Start difference. First operand has 270 places, 272 transitions, 589 flow. Second operand 9 states and 2106 transitions. [2022-11-20 09:34:52,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 312 transitions, 924 flow [2022-11-20 09:34:52,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 312 transitions, 904 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-20 09:34:52,203 INFO L231 Difference]: Finished difference. Result has 277 places, 276 transitions, 640 flow [2022-11-20 09:34:52,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=640, PETRI_PLACES=277, PETRI_TRANSITIONS=276} [2022-11-20 09:34:52,207 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 7 predicate places. [2022-11-20 09:34:52,207 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 276 transitions, 640 flow [2022-11-20 09:34:52,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:52,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:52,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:34:52,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:34:52,210 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:34:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1906131139, now seen corresponding path program 3 times [2022-11-20 09:34:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:52,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529262728] [2022-11-20 09:34:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:53,491 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-20 09:34:53,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529262728] [2022-11-20 09:34:53,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529262728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:53,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:53,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:34:53,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364616416] [2022-11-20 09:34:53,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:53,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:34:53,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:53,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:34:53,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:34:53,504 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-20 09:34:53,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 276 transitions, 640 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:53,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:53,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-20 09:34:53,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:54,430 INFO L130 PetriNetUnfolder]: 694/2707 cut-off events. [2022-11-20 09:34:54,431 INFO L131 PetriNetUnfolder]: For 1220/1222 co-relation queries the response was YES. [2022-11-20 09:34:54,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 2707 events. 694/2707 cut-off events. For 1220/1222 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 23686 event pairs, 299 based on Foata normal form. 2/2322 useless extension candidates. Maximal degree in co-relation 4458. Up to 587 conditions per place. [2022-11-20 09:34:54,466 INFO L137 encePairwiseOnDemand]: 288/302 looper letters, 84 selfloop transitions, 20 changer transitions 4/318 dead transitions. [2022-11-20 09:34:54,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 318 transitions, 1011 flow [2022-11-20 09:34:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:34:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:34:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1886 transitions. [2022-11-20 09:34:54,473 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7806291390728477 [2022-11-20 09:34:54,473 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1886 transitions. [2022-11-20 09:34:54,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1886 transitions. [2022-11-20 09:34:54,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:54,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1886 transitions. [2022-11-20 09:34:54,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 235.75) internal successors, (1886), 8 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:54,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:54,496 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:54,497 INFO L175 Difference]: Start difference. First operand has 277 places, 276 transitions, 640 flow. Second operand 8 states and 1886 transitions. [2022-11-20 09:34:54,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 318 transitions, 1011 flow [2022-11-20 09:34:54,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 318 transitions, 983 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-20 09:34:54,520 INFO L231 Difference]: Finished difference. Result has 282 places, 286 transitions, 772 flow [2022-11-20 09:34:54,521 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=282, PETRI_TRANSITIONS=286} [2022-11-20 09:34:54,522 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 12 predicate places. [2022-11-20 09:34:54,522 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 286 transitions, 772 flow [2022-11-20 09:34:54,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:54,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:54,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:34:54,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:34:54,525 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:34:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash 509262923, now seen corresponding path program 4 times [2022-11-20 09:34:54,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:54,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080874899] [2022-11-20 09:34:54,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:54,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:55,198 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-20 09:34:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:55,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080874899] [2022-11-20 09:34:55,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080874899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:55,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:55,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:34:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305639781] [2022-11-20 09:34:55,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:55,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:34:55,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:55,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:34:55,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:34:55,205 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-20 09:34:55,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 286 transitions, 772 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:55,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:55,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-20 09:34:55,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:56,229 INFO L130 PetriNetUnfolder]: 693/3112 cut-off events. [2022-11-20 09:34:56,230 INFO L131 PetriNetUnfolder]: For 2904/3056 co-relation queries the response was YES. [2022-11-20 09:34:56,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5596 conditions, 3112 events. 693/3112 cut-off events. For 2904/3056 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 29966 event pairs, 355 based on Foata normal form. 10/2768 useless extension candidates. Maximal degree in co-relation 5581. Up to 852 conditions per place. [2022-11-20 09:34:56,275 INFO L137 encePairwiseOnDemand]: 291/302 looper letters, 101 selfloop transitions, 9 changer transitions 8/328 dead transitions. [2022-11-20 09:34:56,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 328 transitions, 1195 flow [2022-11-20 09:34:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:34:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:34:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1880 transitions. [2022-11-20 09:34:56,281 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7781456953642384 [2022-11-20 09:34:56,282 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1880 transitions. [2022-11-20 09:34:56,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1880 transitions. [2022-11-20 09:34:56,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:56,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1880 transitions. [2022-11-20 09:34:56,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:56,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:56,297 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:56,298 INFO L175 Difference]: Start difference. First operand has 282 places, 286 transitions, 772 flow. Second operand 8 states and 1880 transitions. [2022-11-20 09:34:56,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 328 transitions, 1195 flow [2022-11-20 09:34:56,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 328 transitions, 1161 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-11-20 09:34:56,325 INFO L231 Difference]: Finished difference. Result has 288 places, 291 transitions, 828 flow [2022-11-20 09:34:56,326 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=828, PETRI_PLACES=288, PETRI_TRANSITIONS=291} [2022-11-20 09:34:56,329 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 18 predicate places. [2022-11-20 09:34:56,330 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 291 transitions, 828 flow [2022-11-20 09:34:56,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:56,331 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:56,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:34:56,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:34:56,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:34:56,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 352801737, now seen corresponding path program 5 times [2022-11-20 09:34:56,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:56,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826059039] [2022-11-20 09:34:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:57,116 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-20 09:34:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:57,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826059039] [2022-11-20 09:34:57,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826059039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:57,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:57,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:34:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493595675] [2022-11-20 09:34:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:57,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:34:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:57,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:34:57,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:34:57,123 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-20 09:34:57,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 291 transitions, 828 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:57,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:57,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-20 09:34:57,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:58,134 INFO L130 PetriNetUnfolder]: 729/3403 cut-off events. [2022-11-20 09:34:58,135 INFO L131 PetriNetUnfolder]: For 3697/3849 co-relation queries the response was YES. [2022-11-20 09:34:58,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6281 conditions, 3403 events. 729/3403 cut-off events. For 3697/3849 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 33860 event pairs, 326 based on Foata normal form. 24/3036 useless extension candidates. Maximal degree in co-relation 6263. Up to 790 conditions per place. [2022-11-20 09:34:58,176 INFO L137 encePairwiseOnDemand]: 288/302 looper letters, 99 selfloop transitions, 21 changer transitions 5/335 dead transitions. [2022-11-20 09:34:58,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 335 transitions, 1299 flow [2022-11-20 09:34:58,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:34:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:34:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1885 transitions. [2022-11-20 09:34:58,182 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7802152317880795 [2022-11-20 09:34:58,182 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1885 transitions. [2022-11-20 09:34:58,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1885 transitions. [2022-11-20 09:34:58,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:58,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1885 transitions. [2022-11-20 09:34:58,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 235.625) internal successors, (1885), 8 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:58,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:58,196 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:58,196 INFO L175 Difference]: Start difference. First operand has 288 places, 291 transitions, 828 flow. Second operand 8 states and 1885 transitions. [2022-11-20 09:34:58,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 335 transitions, 1299 flow [2022-11-20 09:34:58,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 335 transitions, 1272 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-20 09:34:58,225 INFO L231 Difference]: Finished difference. Result has 294 places, 301 transitions, 989 flow [2022-11-20 09:34:58,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=989, PETRI_PLACES=294, PETRI_TRANSITIONS=301} [2022-11-20 09:34:58,229 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 24 predicate places. [2022-11-20 09:34:58,229 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 301 transitions, 989 flow [2022-11-20 09:34:58,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:58,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:58,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:34:58,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:34:58,231 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:34:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash 258072445, now seen corresponding path program 6 times [2022-11-20 09:34:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:58,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755430775] [2022-11-20 09:34:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:58,679 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-20 09:34:58,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:58,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755430775] [2022-11-20 09:34:58,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755430775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:58,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:58,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:34:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404996804] [2022-11-20 09:34:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:58,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:34:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:58,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:34:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:34:58,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-20 09:34:58,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 301 transitions, 989 flow. Second operand has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:58,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:58,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-20 09:34:58,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:59,895 INFO L130 PetriNetUnfolder]: 816/3922 cut-off events. [2022-11-20 09:34:59,895 INFO L131 PetriNetUnfolder]: For 7420/7571 co-relation queries the response was YES. [2022-11-20 09:34:59,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7901 conditions, 3922 events. 816/3922 cut-off events. For 7420/7571 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 40060 event pairs, 247 based on Foata normal form. 28/3537 useless extension candidates. Maximal degree in co-relation 7880. Up to 773 conditions per place. [2022-11-20 09:34:59,945 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 96 selfloop transitions, 35 changer transitions 5/346 dead transitions. [2022-11-20 09:34:59,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 346 transitions, 1536 flow [2022-11-20 09:34:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:34:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 09:34:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1662 transitions. [2022-11-20 09:34:59,951 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7861873226111636 [2022-11-20 09:34:59,952 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1662 transitions. [2022-11-20 09:34:59,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1662 transitions. [2022-11-20 09:34:59,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:59,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1662 transitions. [2022-11-20 09:34:59,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 237.42857142857142) internal successors, (1662), 7 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:59,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:59,966 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:59,966 INFO L175 Difference]: Start difference. First operand has 294 places, 301 transitions, 989 flow. Second operand 7 states and 1662 transitions. [2022-11-20 09:34:59,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 346 transitions, 1536 flow [2022-11-20 09:35:00,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 346 transitions, 1497 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-11-20 09:35:00,008 INFO L231 Difference]: Finished difference. Result has 299 places, 313 transitions, 1208 flow [2022-11-20 09:35:00,009 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1208, PETRI_PLACES=299, PETRI_TRANSITIONS=313} [2022-11-20 09:35:00,011 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 29 predicate places. [2022-11-20 09:35:00,011 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 313 transitions, 1208 flow [2022-11-20 09:35:00,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:00,033 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:00,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:00,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:35:00,034 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1381272335, now seen corresponding path program 1 times [2022-11-20 09:35:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:00,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870159463] [2022-11-20 09:35:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:00,213 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-20 09:35:00,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:00,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870159463] [2022-11-20 09:35:00,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870159463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:00,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:00,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:35:00,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836868196] [2022-11-20 09:35:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:00,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:35:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:00,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:35:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:35:00,219 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-20 09:35:00,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 313 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:00,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:00,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-20 09:35:00,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:00,738 INFO L130 PetriNetUnfolder]: 227/1806 cut-off events. [2022-11-20 09:35:00,739 INFO L131 PetriNetUnfolder]: For 3862/4136 co-relation queries the response was YES. [2022-11-20 09:35:00,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 1806 events. 227/1806 cut-off events. For 3862/4136 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 15286 event pairs, 35 based on Foata normal form. 8/1612 useless extension candidates. Maximal degree in co-relation 3598. Up to 175 conditions per place. [2022-11-20 09:35:00,768 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 14 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2022-11-20 09:35:00,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 319 transitions, 1257 flow [2022-11-20 09:35:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:35:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:35:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2022-11-20 09:35:00,772 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9392935982339956 [2022-11-20 09:35:00,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 851 transitions. [2022-11-20 09:35:00,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 851 transitions. [2022-11-20 09:35:00,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:00,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 851 transitions. [2022-11-20 09:35:00,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:00,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:00,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:00,782 INFO L175 Difference]: Start difference. First operand has 299 places, 313 transitions, 1208 flow. Second operand 3 states and 851 transitions. [2022-11-20 09:35:00,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 319 transitions, 1257 flow [2022-11-20 09:35:00,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 319 transitions, 1213 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-11-20 09:35:00,810 INFO L231 Difference]: Finished difference. Result has 298 places, 313 transitions, 1172 flow [2022-11-20 09:35:00,810 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=298, PETRI_TRANSITIONS=313} [2022-11-20 09:35:00,813 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 28 predicate places. [2022-11-20 09:35:00,813 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 313 transitions, 1172 flow [2022-11-20 09:35:00,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:00,814 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:00,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:00,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:35:00,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1309875019, now seen corresponding path program 1 times [2022-11-20 09:35:00,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:00,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847191842] [2022-11-20 09:35:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:01,076 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-20 09:35:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:01,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847191842] [2022-11-20 09:35:01,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847191842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:01,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:01,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:35:01,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429430950] [2022-11-20 09:35:01,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:01,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:35:01,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:01,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:35:01,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:35:01,082 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-20 09:35:01,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 313 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:01,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:01,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-20 09:35:01,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:01,563 INFO L130 PetriNetUnfolder]: 347/2045 cut-off events. [2022-11-20 09:35:01,563 INFO L131 PetriNetUnfolder]: For 3657/3829 co-relation queries the response was YES. [2022-11-20 09:35:01,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 2045 events. 347/2045 cut-off events. For 3657/3829 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 17717 event pairs, 101 based on Foata normal form. 10/1812 useless extension candidates. Maximal degree in co-relation 4023. Up to 194 conditions per place. [2022-11-20 09:35:01,601 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 12 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2022-11-20 09:35:01,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 317 transitions, 1211 flow [2022-11-20 09:35:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:35:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:35:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2022-11-20 09:35:01,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9370860927152318 [2022-11-20 09:35:01,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2022-11-20 09:35:01,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2022-11-20 09:35:01,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:01,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2022-11-20 09:35:01,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:01,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:01,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:01,613 INFO L175 Difference]: Start difference. First operand has 298 places, 313 transitions, 1172 flow. Second operand 3 states and 849 transitions. [2022-11-20 09:35:01,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 317 transitions, 1211 flow [2022-11-20 09:35:01,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 317 transitions, 1199 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-20 09:35:01,634 INFO L231 Difference]: Finished difference. Result has 299 places, 313 transitions, 1168 flow [2022-11-20 09:35:01,635 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=299, PETRI_TRANSITIONS=313} [2022-11-20 09:35:01,636 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 29 predicate places. [2022-11-20 09:35:01,636 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 313 transitions, 1168 flow [2022-11-20 09:35:01,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:01,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:01,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:01,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:35:01,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2129309629, now seen corresponding path program 1 times [2022-11-20 09:35:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:01,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224696385] [2022-11-20 09:35:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:01,813 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-20 09:35:01,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:01,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224696385] [2022-11-20 09:35:01,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224696385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:01,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:01,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:35:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95957370] [2022-11-20 09:35:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:01,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:35:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:01,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:35:01,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:35:01,820 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-20 09:35:01,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 313 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:01,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:01,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-20 09:35:01,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:02,412 INFO L130 PetriNetUnfolder]: 378/2509 cut-off events. [2022-11-20 09:35:02,412 INFO L131 PetriNetUnfolder]: For 4360/4593 co-relation queries the response was YES. [2022-11-20 09:35:02,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4925 conditions, 2509 events. 378/2509 cut-off events. For 4360/4593 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 23068 event pairs, 134 based on Foata normal form. 17/2271 useless extension candidates. Maximal degree in co-relation 4900. Up to 262 conditions per place. [2022-11-20 09:35:02,449 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 13 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2022-11-20 09:35:02,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 318 transitions, 1212 flow [2022-11-20 09:35:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:35:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:35:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 850 transitions. [2022-11-20 09:35:02,453 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9381898454746137 [2022-11-20 09:35:02,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 850 transitions. [2022-11-20 09:35:02,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 850 transitions. [2022-11-20 09:35:02,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:02,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 850 transitions. [2022-11-20 09:35:02,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:02,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:02,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:02,460 INFO L175 Difference]: Start difference. First operand has 299 places, 313 transitions, 1168 flow. Second operand 3 states and 850 transitions. [2022-11-20 09:35:02,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 318 transitions, 1212 flow [2022-11-20 09:35:02,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 318 transitions, 1194 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-20 09:35:02,486 INFO L231 Difference]: Finished difference. Result has 300 places, 313 transitions, 1158 flow [2022-11-20 09:35:02,487 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=300, PETRI_TRANSITIONS=313} [2022-11-20 09:35:02,489 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 30 predicate places. [2022-11-20 09:35:02,489 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 313 transitions, 1158 flow [2022-11-20 09:35:02,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:02,490 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:02,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:02,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:35:02,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1426829239, now seen corresponding path program 1 times [2022-11-20 09:35:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:02,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76345992] [2022-11-20 09:35:02,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:03,143 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-20 09:35:03,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76345992] [2022-11-20 09:35:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76345992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:03,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:03,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:03,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190448104] [2022-11-20 09:35:03,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:03,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:03,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:03,150 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:03,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 313 transitions, 1158 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:03,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:03,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:03,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:04,646 INFO L130 PetriNetUnfolder]: 1001/5402 cut-off events. [2022-11-20 09:35:04,646 INFO L131 PetriNetUnfolder]: For 11311/12095 co-relation queries the response was YES. [2022-11-20 09:35:04,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11361 conditions, 5402 events. 1001/5402 cut-off events. For 11311/12095 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 58358 event pairs, 305 based on Foata normal form. 44/5099 useless extension candidates. Maximal degree in co-relation 11335. Up to 782 conditions per place. [2022-11-20 09:35:04,709 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 133 selfloop transitions, 12 changer transitions 4/366 dead transitions. [2022-11-20 09:35:04,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 366 transitions, 1836 flow [2022-11-20 09:35:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:35:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:35:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2130 transitions. [2022-11-20 09:35:04,716 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7836644591611479 [2022-11-20 09:35:04,717 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2130 transitions. [2022-11-20 09:35:04,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2130 transitions. [2022-11-20 09:35:04,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:04,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2130 transitions. [2022-11-20 09:35:04,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 236.66666666666666) internal successors, (2130), 9 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:04,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:04,731 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:04,731 INFO L175 Difference]: Start difference. First operand has 300 places, 313 transitions, 1158 flow. Second operand 9 states and 2130 transitions. [2022-11-20 09:35:04,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 366 transitions, 1836 flow [2022-11-20 09:35:04,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 366 transitions, 1792 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-11-20 09:35:04,780 INFO L231 Difference]: Finished difference. Result has 311 places, 319 transitions, 1271 flow [2022-11-20 09:35:04,781 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1271, PETRI_PLACES=311, PETRI_TRANSITIONS=319} [2022-11-20 09:35:04,782 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 41 predicate places. [2022-11-20 09:35:04,782 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 319 transitions, 1271 flow [2022-11-20 09:35:04,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:04,783 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:04,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:04,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:35:04,785 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:04,786 INFO L85 PathProgramCache]: Analyzing trace with hash 305356645, now seen corresponding path program 2 times [2022-11-20 09:35:04,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:04,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218758986] [2022-11-20 09:35:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:04,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:35:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218758986] [2022-11-20 09:35:05,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218758986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:05,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:05,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967427028] [2022-11-20 09:35:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:05,476 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:05,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 319 transitions, 1271 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:05,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:05,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:05,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:07,099 INFO L130 PetriNetUnfolder]: 958/4879 cut-off events. [2022-11-20 09:35:07,099 INFO L131 PetriNetUnfolder]: For 10606/11369 co-relation queries the response was YES. [2022-11-20 09:35:07,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 4879 events. 958/4879 cut-off events. For 10606/11369 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 51022 event pairs, 525 based on Foata normal form. 65/4550 useless extension candidates. Maximal degree in co-relation 10703. Up to 1137 conditions per place. [2022-11-20 09:35:07,168 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 121 selfloop transitions, 16 changer transitions 5/359 dead transitions. [2022-11-20 09:35:07,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 359 transitions, 1809 flow [2022-11-20 09:35:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:35:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:35:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2127 transitions. [2022-11-20 09:35:07,183 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.782560706401766 [2022-11-20 09:35:07,184 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2127 transitions. [2022-11-20 09:35:07,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2127 transitions. [2022-11-20 09:35:07,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:07,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2127 transitions. [2022-11-20 09:35:07,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 236.33333333333334) internal successors, (2127), 9 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:07,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:07,297 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:07,297 INFO L175 Difference]: Start difference. First operand has 311 places, 319 transitions, 1271 flow. Second operand 9 states and 2127 transitions. [2022-11-20 09:35:07,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 359 transitions, 1809 flow [2022-11-20 09:35:07,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 359 transitions, 1765 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-11-20 09:35:07,342 INFO L231 Difference]: Finished difference. Result has 317 places, 323 transitions, 1358 flow [2022-11-20 09:35:07,343 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1358, PETRI_PLACES=317, PETRI_TRANSITIONS=323} [2022-11-20 09:35:07,344 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 47 predicate places. [2022-11-20 09:35:07,344 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 323 transitions, 1358 flow [2022-11-20 09:35:07,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:07,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:07,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:07,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:35:07,346 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1643521659, now seen corresponding path program 3 times [2022-11-20 09:35:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:07,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296287478] [2022-11-20 09:35:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:35:08,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296287478] [2022-11-20 09:35:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296287478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:08,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788771348] [2022-11-20 09:35:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:08,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:08,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:08,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 323 transitions, 1358 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:08,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:08,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:08,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:09,920 INFO L130 PetriNetUnfolder]: 1137/6495 cut-off events. [2022-11-20 09:35:09,921 INFO L131 PetriNetUnfolder]: For 12522/13386 co-relation queries the response was YES. [2022-11-20 09:35:09,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13636 conditions, 6495 events. 1137/6495 cut-off events. For 12522/13386 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 73157 event pairs, 192 based on Foata normal form. 71/6160 useless extension candidates. Maximal degree in co-relation 13602. Up to 669 conditions per place. [2022-11-20 09:35:10,012 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 145 selfloop transitions, 34 changer transitions 5/401 dead transitions. [2022-11-20 09:35:10,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 401 transitions, 2289 flow [2022-11-20 09:35:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:35:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:35:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2153 transitions. [2022-11-20 09:35:10,021 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7921265636497424 [2022-11-20 09:35:10,021 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2153 transitions. [2022-11-20 09:35:10,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2153 transitions. [2022-11-20 09:35:10,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:10,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2153 transitions. [2022-11-20 09:35:10,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 239.22222222222223) internal successors, (2153), 9 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:10,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:10,038 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:10,038 INFO L175 Difference]: Start difference. First operand has 317 places, 323 transitions, 1358 flow. Second operand 9 states and 2153 transitions. [2022-11-20 09:35:10,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 401 transitions, 2289 flow [2022-11-20 09:35:10,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 401 transitions, 2229 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-11-20 09:35:10,107 INFO L231 Difference]: Finished difference. Result has 324 places, 340 transitions, 1670 flow [2022-11-20 09:35:10,108 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1670, PETRI_PLACES=324, PETRI_TRANSITIONS=340} [2022-11-20 09:35:10,109 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 54 predicate places. [2022-11-20 09:35:10,109 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 340 transitions, 1670 flow [2022-11-20 09:35:10,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:10,110 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:10,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:10,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:35:10,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1208714119, now seen corresponding path program 4 times [2022-11-20 09:35:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:10,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345112677] [2022-11-20 09:35:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:10,580 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-20 09:35:10,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:10,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345112677] [2022-11-20 09:35:10,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345112677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:10,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:10,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:10,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657861904] [2022-11-20 09:35:10,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:10,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:10,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:10,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:10,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:10,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 340 transitions, 1670 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:10,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:10,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:10,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:12,390 INFO L130 PetriNetUnfolder]: 1173/6605 cut-off events. [2022-11-20 09:35:12,390 INFO L131 PetriNetUnfolder]: For 18213/18994 co-relation queries the response was YES. [2022-11-20 09:35:12,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14871 conditions, 6605 events. 1173/6605 cut-off events. For 18213/18994 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 74381 event pairs, 181 based on Foata normal form. 112/6253 useless extension candidates. Maximal degree in co-relation 14833. Up to 1025 conditions per place. [2022-11-20 09:35:12,465 INFO L137 encePairwiseOnDemand]: 292/302 looper letters, 109 selfloop transitions, 75 changer transitions 4/405 dead transitions. [2022-11-20 09:35:12,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 405 transitions, 2506 flow [2022-11-20 09:35:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:35:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:35:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1922 transitions. [2022-11-20 09:35:12,472 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7955298013245033 [2022-11-20 09:35:12,472 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1922 transitions. [2022-11-20 09:35:12,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1922 transitions. [2022-11-20 09:35:12,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:12,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1922 transitions. [2022-11-20 09:35:12,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 240.25) internal successors, (1922), 8 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:12,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:12,485 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:12,486 INFO L175 Difference]: Start difference. First operand has 324 places, 340 transitions, 1670 flow. Second operand 8 states and 1922 transitions. [2022-11-20 09:35:12,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 405 transitions, 2506 flow [2022-11-20 09:35:12,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 405 transitions, 2414 flow, removed 45 selfloop flow, removed 3 redundant places. [2022-11-20 09:35:12,574 INFO L231 Difference]: Finished difference. Result has 331 places, 360 transitions, 2128 flow [2022-11-20 09:35:12,574 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2128, PETRI_PLACES=331, PETRI_TRANSITIONS=360} [2022-11-20 09:35:12,575 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 61 predicate places. [2022-11-20 09:35:12,575 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 360 transitions, 2128 flow [2022-11-20 09:35:12,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:12,576 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:12,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:12,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:35:12,577 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:12,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1648470413, now seen corresponding path program 1 times [2022-11-20 09:35:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:12,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396763980] [2022-11-20 09:35:12,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:13,297 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-20 09:35:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:13,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396763980] [2022-11-20 09:35:13,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396763980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:13,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:13,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:13,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508449825] [2022-11-20 09:35:13,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:13,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:13,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:13,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:13,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:13,304 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:13,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 360 transitions, 2128 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:13,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:13,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:13,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:15,297 INFO L130 PetriNetUnfolder]: 1249/7743 cut-off events. [2022-11-20 09:35:15,297 INFO L131 PetriNetUnfolder]: For 21522/21759 co-relation queries the response was YES. [2022-11-20 09:35:15,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17143 conditions, 7743 events. 1249/7743 cut-off events. For 21522/21759 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 92758 event pairs, 406 based on Foata normal form. 78/7297 useless extension candidates. Maximal degree in co-relation 17102. Up to 1037 conditions per place. [2022-11-20 09:35:15,412 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 132 selfloop transitions, 23 changer transitions 6/421 dead transitions. [2022-11-20 09:35:15,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 421 transitions, 2962 flow [2022-11-20 09:35:15,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:35:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:35:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2127 transitions. [2022-11-20 09:35:15,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.782560706401766 [2022-11-20 09:35:15,419 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2127 transitions. [2022-11-20 09:35:15,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2127 transitions. [2022-11-20 09:35:15,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:15,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2127 transitions. [2022-11-20 09:35:15,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 236.33333333333334) internal successors, (2127), 9 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:15,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:15,434 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:15,434 INFO L175 Difference]: Start difference. First operand has 331 places, 360 transitions, 2128 flow. Second operand 9 states and 2127 transitions. [2022-11-20 09:35:15,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 421 transitions, 2962 flow [2022-11-20 09:35:15,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 421 transitions, 2892 flow, removed 35 selfloop flow, removed 2 redundant places. [2022-11-20 09:35:15,575 INFO L231 Difference]: Finished difference. Result has 340 places, 367 transitions, 2244 flow [2022-11-20 09:35:15,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2244, PETRI_PLACES=340, PETRI_TRANSITIONS=367} [2022-11-20 09:35:15,577 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 70 predicate places. [2022-11-20 09:35:15,577 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 367 transitions, 2244 flow [2022-11-20 09:35:15,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:15,578 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:15,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:15,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:35:15,579 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2077705807, now seen corresponding path program 2 times [2022-11-20 09:35:15,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:15,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069051211] [2022-11-20 09:35:15,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:15,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:16,286 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-20 09:35:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:16,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069051211] [2022-11-20 09:35:16,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069051211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:16,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:16,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437316900] [2022-11-20 09:35:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:16,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:16,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:16,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:16,296 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:16,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 367 transitions, 2244 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:16,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:16,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:16,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:18,494 INFO L130 PetriNetUnfolder]: 1185/6820 cut-off events. [2022-11-20 09:35:18,494 INFO L131 PetriNetUnfolder]: For 21022/21352 co-relation queries the response was YES. [2022-11-20 09:35:18,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16028 conditions, 6820 events. 1185/6820 cut-off events. For 21022/21352 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 78033 event pairs, 194 based on Foata normal form. 59/6496 useless extension candidates. Maximal degree in co-relation 15983. Up to 1365 conditions per place. [2022-11-20 09:35:18,553 INFO L137 encePairwiseOnDemand]: 291/302 looper letters, 129 selfloop transitions, 23 changer transitions 12/422 dead transitions. [2022-11-20 09:35:18,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 422 transitions, 2972 flow [2022-11-20 09:35:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:35:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:35:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1912 transitions. [2022-11-20 09:35:18,559 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7913907284768212 [2022-11-20 09:35:18,559 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1912 transitions. [2022-11-20 09:35:18,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1912 transitions. [2022-11-20 09:35:18,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:18,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1912 transitions. [2022-11-20 09:35:18,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:18,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:18,571 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:18,571 INFO L175 Difference]: Start difference. First operand has 340 places, 367 transitions, 2244 flow. Second operand 8 states and 1912 transitions. [2022-11-20 09:35:18,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 422 transitions, 2972 flow [2022-11-20 09:35:18,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 422 transitions, 2918 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-11-20 09:35:18,680 INFO L231 Difference]: Finished difference. Result has 344 places, 373 transitions, 2317 flow [2022-11-20 09:35:18,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2317, PETRI_PLACES=344, PETRI_TRANSITIONS=373} [2022-11-20 09:35:18,682 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 74 predicate places. [2022-11-20 09:35:18,685 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 373 transitions, 2317 flow [2022-11-20 09:35:18,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:18,686 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:18,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:18,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:35:18,686 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2033665457, now seen corresponding path program 3 times [2022-11-20 09:35:18,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:18,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490966352] [2022-11-20 09:35:18,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:18,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:19,329 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-20 09:35:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:19,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490966352] [2022-11-20 09:35:19,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490966352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:19,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:19,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228862271] [2022-11-20 09:35:19,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:19,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:19,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:19,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:19,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:19,334 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:19,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 373 transitions, 2317 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:19,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:19,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:19,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:21,418 INFO L130 PetriNetUnfolder]: 1335/7789 cut-off events. [2022-11-20 09:35:21,419 INFO L131 PetriNetUnfolder]: For 24029/24532 co-relation queries the response was YES. [2022-11-20 09:35:21,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18372 conditions, 7789 events. 1335/7789 cut-off events. For 24029/24532 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 92277 event pairs, 475 based on Foata normal form. 103/7291 useless extension candidates. Maximal degree in co-relation 18325. Up to 1585 conditions per place. [2022-11-20 09:35:21,509 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 122 selfloop transitions, 22 changer transitions 11/411 dead transitions. [2022-11-20 09:35:21,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 411 transitions, 2880 flow [2022-11-20 09:35:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:35:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:35:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2127 transitions. [2022-11-20 09:35:21,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.782560706401766 [2022-11-20 09:35:21,516 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2127 transitions. [2022-11-20 09:35:21,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2127 transitions. [2022-11-20 09:35:21,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:21,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2127 transitions. [2022-11-20 09:35:21,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 236.33333333333334) internal successors, (2127), 9 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:21,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:21,530 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:21,531 INFO L175 Difference]: Start difference. First operand has 344 places, 373 transitions, 2317 flow. Second operand 9 states and 2127 transitions. [2022-11-20 09:35:21,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 411 transitions, 2880 flow [2022-11-20 09:35:21,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 411 transitions, 2802 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-20 09:35:21,695 INFO L231 Difference]: Finished difference. Result has 346 places, 375 transitions, 2328 flow [2022-11-20 09:35:21,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2328, PETRI_PLACES=346, PETRI_TRANSITIONS=375} [2022-11-20 09:35:21,696 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 76 predicate places. [2022-11-20 09:35:21,697 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 375 transitions, 2328 flow [2022-11-20 09:35:21,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:21,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:21,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:21,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:35:21,698 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1683541845, now seen corresponding path program 1 times [2022-11-20 09:35:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:21,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660052579] [2022-11-20 09:35:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:22,412 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-20 09:35:22,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:22,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660052579] [2022-11-20 09:35:22,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660052579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:22,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:22,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408731853] [2022-11-20 09:35:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:22,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:22,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:22,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:22,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:22,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:22,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 375 transitions, 2328 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:22,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:22,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:22,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:24,499 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([815] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][387], [Black: 323#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 450#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 453#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 391#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0))), Black: 389#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0))), Black: 513#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 383#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 511#true, Black: 522#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 592#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 587#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 590#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 594#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 287#true, 72#L124-2true, 442#(<= ~count2~0 ~count1~0), Black: 346#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 466#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 474#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 338#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 477#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), 577#true, Black: 411#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 348#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 543#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 535#(<= ~count1~0 ~count3~0), 405#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 413#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 545#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 600#true, Black: 427#(= thread1Thread1of1ForFork0_~stop~0 0), 496#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), 57#L89true, 519#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0))), 556#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 302#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0) (<= ~res1~0 0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 437#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 361#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 370#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 367#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 490#(<= ~count2~0 ~count1~0), Black: 491#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 560#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), Black: 499#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0))]) [2022-11-20 09:35:24,500 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-20 09:35:24,500 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-20 09:35:24,500 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-20 09:35:24,500 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-20 09:35:24,518 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([815] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][387], [361#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 323#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 450#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 453#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 391#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0))), Black: 389#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0))), Black: 383#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 511#true, Black: 522#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), 513#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 592#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 587#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 590#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 594#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 287#true, 72#L124-2true, 442#(<= ~count2~0 ~count1~0), Black: 346#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), 132#L88-1true, Black: 466#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 474#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 338#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 477#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 411#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 577#true, Black: 348#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 543#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 405#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 545#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 413#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 535#(<= ~count1~0 ~count3~0), 600#true, Black: 427#(= thread1Thread1of1ForFork0_~stop~0 0), 496#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), 556#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 302#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0) (<= ~res1~0 0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 437#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 300#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~res1~0 0))), Black: 370#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 490#(<= ~count2~0 ~count1~0), Black: 367#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 491#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 560#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), Black: 499#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0))]) [2022-11-20 09:35:24,518 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-11-20 09:35:24,518 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-20 09:35:24,518 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-20 09:35:24,518 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-20 09:35:24,614 INFO L130 PetriNetUnfolder]: 1348/7852 cut-off events. [2022-11-20 09:35:24,614 INFO L131 PetriNetUnfolder]: For 29792/31236 co-relation queries the response was YES. [2022-11-20 09:35:24,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19616 conditions, 7852 events. 1348/7852 cut-off events. For 29792/31236 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 93764 event pairs, 437 based on Foata normal form. 98/7394 useless extension candidates. Maximal degree in co-relation 19569. Up to 1542 conditions per place. [2022-11-20 09:35:24,688 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 165 selfloop transitions, 23 changer transitions 7/420 dead transitions. [2022-11-20 09:35:24,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 420 transitions, 3111 flow [2022-11-20 09:35:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:35:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:35:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2128 transitions. [2022-11-20 09:35:24,693 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7829286239882266 [2022-11-20 09:35:24,693 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2128 transitions. [2022-11-20 09:35:24,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2128 transitions. [2022-11-20 09:35:24,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:24,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2128 transitions. [2022-11-20 09:35:24,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 236.44444444444446) internal successors, (2128), 9 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:24,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:24,707 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:24,707 INFO L175 Difference]: Start difference. First operand has 346 places, 375 transitions, 2328 flow. Second operand 9 states and 2128 transitions. [2022-11-20 09:35:24,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 420 transitions, 3111 flow [2022-11-20 09:35:24,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 420 transitions, 3021 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-11-20 09:35:24,843 INFO L231 Difference]: Finished difference. Result has 350 places, 379 transitions, 2414 flow [2022-11-20 09:35:24,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2414, PETRI_PLACES=350, PETRI_TRANSITIONS=379} [2022-11-20 09:35:24,845 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 80 predicate places. [2022-11-20 09:35:24,845 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 379 transitions, 2414 flow [2022-11-20 09:35:24,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:24,846 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:24,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:24,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:35:24,846 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:24,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:24,847 INFO L85 PathProgramCache]: Analyzing trace with hash -239094717, now seen corresponding path program 2 times [2022-11-20 09:35:24,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:24,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605939576] [2022-11-20 09:35:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:25,492 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-20 09:35:25,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605939576] [2022-11-20 09:35:25,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605939576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:25,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:25,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 09:35:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257519692] [2022-11-20 09:35:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:25,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:35:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:25,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:35:25,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:35:25,498 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 302 [2022-11-20 09:35:25,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 379 transitions, 2414 flow. Second operand has 14 states, 14 states have (on average 205.21428571428572) internal successors, (2873), 14 states have internal predecessors, (2873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:25,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:25,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 302 [2022-11-20 09:35:25,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:31,139 INFO L130 PetriNetUnfolder]: 4426/20866 cut-off events. [2022-11-20 09:35:31,139 INFO L131 PetriNetUnfolder]: For 64077/65327 co-relation queries the response was YES. [2022-11-20 09:35:31,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49010 conditions, 20866 events. 4426/20866 cut-off events. For 64077/65327 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 286723 event pairs, 1404 based on Foata normal form. 196/18846 useless extension candidates. Maximal degree in co-relation 48961. Up to 2439 conditions per place. [2022-11-20 09:35:31,633 INFO L137 encePairwiseOnDemand]: 281/302 looper letters, 187 selfloop transitions, 57 changer transitions 9/505 dead transitions. [2022-11-20 09:35:31,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 505 transitions, 4037 flow [2022-11-20 09:35:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:35:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-20 09:35:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4168 transitions. [2022-11-20 09:35:31,640 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6900662251655629 [2022-11-20 09:35:31,641 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4168 transitions. [2022-11-20 09:35:31,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4168 transitions. [2022-11-20 09:35:31,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:31,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4168 transitions. [2022-11-20 09:35:31,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 208.4) internal successors, (4168), 20 states have internal predecessors, (4168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:31,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:31,662 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:31,662 INFO L175 Difference]: Start difference. First operand has 350 places, 379 transitions, 2414 flow. Second operand 20 states and 4168 transitions. [2022-11-20 09:35:31,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 505 transitions, 4037 flow [2022-11-20 09:35:31,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 505 transitions, 3981 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-11-20 09:35:31,972 INFO L231 Difference]: Finished difference. Result has 372 places, 406 transitions, 2869 flow [2022-11-20 09:35:31,973 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2376, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2869, PETRI_PLACES=372, PETRI_TRANSITIONS=406} [2022-11-20 09:35:31,974 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 102 predicate places. [2022-11-20 09:35:31,974 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 406 transitions, 2869 flow [2022-11-20 09:35:31,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 205.21428571428572) internal successors, (2873), 14 states have internal predecessors, (2873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:31,975 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:31,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:31,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:35:31,976 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:31,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash 697951053, now seen corresponding path program 4 times [2022-11-20 09:35:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:31,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716219439] [2022-11-20 09:35:31,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:32,606 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-20 09:35:32,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:32,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716219439] [2022-11-20 09:35:32,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716219439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:32,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:32,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646893534] [2022-11-20 09:35:32,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:32,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:32,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:32,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:32,611 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:32,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 406 transitions, 2869 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:32,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:32,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:32,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:37,648 INFO L130 PetriNetUnfolder]: 2799/17109 cut-off events. [2022-11-20 09:35:37,649 INFO L131 PetriNetUnfolder]: For 64319/65354 co-relation queries the response was YES. [2022-11-20 09:35:37,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41968 conditions, 17109 events. 2799/17109 cut-off events. For 64319/65354 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 238090 event pairs, 1187 based on Foata normal form. 145/15994 useless extension candidates. Maximal degree in co-relation 41911. Up to 3740 conditions per place. [2022-11-20 09:35:37,845 INFO L137 encePairwiseOnDemand]: 294/302 looper letters, 137 selfloop transitions, 23 changer transitions 12/433 dead transitions. [2022-11-20 09:35:37,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 433 transitions, 3320 flow [2022-11-20 09:35:37,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:35:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:35:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1896 transitions. [2022-11-20 09:35:37,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7847682119205298 [2022-11-20 09:35:37,850 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1896 transitions. [2022-11-20 09:35:37,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1896 transitions. [2022-11-20 09:35:37,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:37,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1896 transitions. [2022-11-20 09:35:37,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:37,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:37,860 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:37,860 INFO L175 Difference]: Start difference. First operand has 372 places, 406 transitions, 2869 flow. Second operand 8 states and 1896 transitions. [2022-11-20 09:35:37,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 433 transitions, 3320 flow [2022-11-20 09:35:38,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 433 transitions, 3270 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-20 09:35:38,186 INFO L231 Difference]: Finished difference. Result has 373 places, 402 transitions, 2793 flow [2022-11-20 09:35:38,187 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2829, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2793, PETRI_PLACES=373, PETRI_TRANSITIONS=402} [2022-11-20 09:35:38,187 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 103 predicate places. [2022-11-20 09:35:38,188 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 402 transitions, 2793 flow [2022-11-20 09:35:38,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:38,188 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:38,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:38,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 09:35:38,189 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:38,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:38,190 INFO L85 PathProgramCache]: Analyzing trace with hash -286846357, now seen corresponding path program 5 times [2022-11-20 09:35:38,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:38,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126320103] [2022-11-20 09:35:38,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:38,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:38,727 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-20 09:35:38,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:38,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126320103] [2022-11-20 09:35:38,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126320103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:38,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:38,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734438472] [2022-11-20 09:35:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:38,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:38,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:38,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:38,733 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:38,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 402 transitions, 2793 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:38,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:38,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:38,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:43,134 INFO L130 PetriNetUnfolder]: 2485/15340 cut-off events. [2022-11-20 09:35:43,135 INFO L131 PetriNetUnfolder]: For 60478/61673 co-relation queries the response was YES. [2022-11-20 09:35:43,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39054 conditions, 15340 events. 2485/15340 cut-off events. For 60478/61673 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 208986 event pairs, 519 based on Foata normal form. 268/14830 useless extension candidates. Maximal degree in co-relation 38996. Up to 3358 conditions per place. [2022-11-20 09:35:43,341 INFO L137 encePairwiseOnDemand]: 289/302 looper letters, 146 selfloop transitions, 38 changer transitions 10/453 dead transitions. [2022-11-20 09:35:43,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 453 transitions, 3543 flow [2022-11-20 09:35:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:35:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:35:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2141 transitions. [2022-11-20 09:35:43,345 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7877115526122148 [2022-11-20 09:35:43,345 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2141 transitions. [2022-11-20 09:35:43,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2141 transitions. [2022-11-20 09:35:43,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:43,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2141 transitions. [2022-11-20 09:35:43,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 237.88888888888889) internal successors, (2141), 9 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:43,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:43,356 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:43,356 INFO L175 Difference]: Start difference. First operand has 373 places, 402 transitions, 2793 flow. Second operand 9 states and 2141 transitions. [2022-11-20 09:35:43,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 453 transitions, 3543 flow [2022-11-20 09:35:43,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 453 transitions, 3457 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-11-20 09:35:43,719 INFO L231 Difference]: Finished difference. Result has 373 places, 405 transitions, 2851 flow [2022-11-20 09:35:43,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2725, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2851, PETRI_PLACES=373, PETRI_TRANSITIONS=405} [2022-11-20 09:35:43,720 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 103 predicate places. [2022-11-20 09:35:43,720 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 405 transitions, 2851 flow [2022-11-20 09:35:43,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:43,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:43,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:43,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 09:35:43,721 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:43,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash -623622787, now seen corresponding path program 6 times [2022-11-20 09:35:43,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:43,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121486085] [2022-11-20 09:35:43,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:43,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:35:44,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:44,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121486085] [2022-11-20 09:35:44,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121486085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:44,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:44,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:35:44,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241629751] [2022-11-20 09:35:44,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:44,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:35:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:44,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:44,234 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:35:44,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 405 transitions, 2851 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:44,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:44,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:35:44,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:35:47,786 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] thread3EXIT-->L125-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][450], [579#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 391#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0))), Black: 389#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0))), Black: 513#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 383#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 522#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 654#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 652#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 634#(<= ~res2~0 0), Black: 658#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 656#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 411#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 664#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 405#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 646#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 545#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 413#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (<= 1 ~res3~0)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 535#(<= ~count1~0 ~count3~0), Black: 432#(= thread3Thread1of1ForFork2_~stop~2 0), Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 85#L125-2true, Black: 560#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 725#(<= ~count1~0 ~count3~0), 543#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 338#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 662#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 602#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 700#true, Black: 442#(<= ~count2~0 ~count1~0), Black: 450#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 453#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 715#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 712#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 717#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 710#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), 488#true, Black: 587#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 590#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), 287#true, Black: 466#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 511#true, Black: 346#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 474#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 477#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 348#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), 403#true, Black: 610#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 612#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), Black: 361#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 370#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 367#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0)))), Black: 490#(<= ~count2~0 ~count1~0), Black: 491#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 499#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 496#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0))]) [2022-11-20 09:35:47,786 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is not cut-off event [2022-11-20 09:35:47,787 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-20 09:35:47,787 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-20 09:35:47,787 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is not cut-off event [2022-11-20 09:35:48,737 INFO L130 PetriNetUnfolder]: 2599/17123 cut-off events. [2022-11-20 09:35:48,737 INFO L131 PetriNetUnfolder]: For 65432/66382 co-relation queries the response was YES. [2022-11-20 09:35:48,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42054 conditions, 17123 events. 2599/17123 cut-off events. For 65432/66382 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 240504 event pairs, 808 based on Foata normal form. 134/16218 useless extension candidates. Maximal degree in co-relation 41997. Up to 2138 conditions per place. [2022-11-20 09:35:48,961 INFO L137 encePairwiseOnDemand]: 291/302 looper letters, 165 selfloop transitions, 33 changer transitions 18/473 dead transitions. [2022-11-20 09:35:48,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 473 transitions, 4108 flow [2022-11-20 09:35:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:35:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:35:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1901 transitions. [2022-11-20 09:35:48,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7868377483443708 [2022-11-20 09:35:48,965 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1901 transitions. [2022-11-20 09:35:48,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1901 transitions. [2022-11-20 09:35:48,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:48,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1901 transitions. [2022-11-20 09:35:48,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 237.625) internal successors, (1901), 8 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:48,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:48,976 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:48,977 INFO L175 Difference]: Start difference. First operand has 373 places, 405 transitions, 2851 flow. Second operand 8 states and 1901 transitions. [2022-11-20 09:35:48,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 473 transitions, 4108 flow [2022-11-20 09:35:49,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 473 transitions, 4038 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-11-20 09:35:49,336 INFO L231 Difference]: Finished difference. Result has 379 places, 415 transitions, 3145 flow [2022-11-20 09:35:49,337 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2813, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3145, PETRI_PLACES=379, PETRI_TRANSITIONS=415} [2022-11-20 09:35:49,337 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 109 predicate places. [2022-11-20 09:35:49,337 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 415 transitions, 3145 flow [2022-11-20 09:35:49,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:49,338 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:35:49,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:35:49,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 09:35:49,338 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:35:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash -515708533, now seen corresponding path program 5 times [2022-11-20 09:35:49,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:49,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160604527] [2022-11-20 09:35:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:49,918 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-20 09:35:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:49,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160604527] [2022-11-20 09:35:49,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160604527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:49,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:49,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 09:35:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428818720] [2022-11-20 09:35:49,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:49,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:35:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:35:49,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:35:49,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 302 [2022-11-20 09:35:49,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 415 transitions, 3145 flow. Second operand has 14 states, 14 states have (on average 205.21428571428572) internal successors, (2873), 14 states have internal predecessors, (2873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:49,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:35:49,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 302 [2022-11-20 09:35:49,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:01,884 INFO L130 PetriNetUnfolder]: 8395/39799 cut-off events. [2022-11-20 09:36:01,884 INFO L131 PetriNetUnfolder]: For 147057/149918 co-relation queries the response was YES. [2022-11-20 09:36:02,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99396 conditions, 39799 events. 8395/39799 cut-off events. For 147057/149918 co-relation queries the response was YES. Maximal size of possible extension queue 1749. Compared 605913 event pairs, 3147 based on Foata normal form. 515/35796 useless extension candidates. Maximal degree in co-relation 99335. Up to 5566 conditions per place. [2022-11-20 09:36:02,429 INFO L137 encePairwiseOnDemand]: 279/302 looper letters, 237 selfloop transitions, 58 changer transitions 12/585 dead transitions. [2022-11-20 09:36:02,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 585 transitions, 5216 flow [2022-11-20 09:36:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:36:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-20 09:36:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4187 transitions. [2022-11-20 09:36:02,434 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6932119205298013 [2022-11-20 09:36:02,435 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4187 transitions. [2022-11-20 09:36:02,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4187 transitions. [2022-11-20 09:36:02,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:02,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4187 transitions. [2022-11-20 09:36:02,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 209.35) internal successors, (4187), 20 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:02,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:02,451 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:02,451 INFO L175 Difference]: Start difference. First operand has 379 places, 415 transitions, 3145 flow. Second operand 20 states and 4187 transitions. [2022-11-20 09:36:02,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 585 transitions, 5216 flow [2022-11-20 09:36:03,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 585 transitions, 5144 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-11-20 09:36:03,411 INFO L231 Difference]: Finished difference. Result has 399 places, 444 transitions, 3556 flow [2022-11-20 09:36:03,412 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3102, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3556, PETRI_PLACES=399, PETRI_TRANSITIONS=444} [2022-11-20 09:36:03,412 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 129 predicate places. [2022-11-20 09:36:03,413 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 444 transitions, 3556 flow [2022-11-20 09:36:03,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 205.21428571428572) internal successors, (2873), 14 states have internal predecessors, (2873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:03,413 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:03,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:36:03,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 09:36:03,414 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:03,415 INFO L85 PathProgramCache]: Analyzing trace with hash -41298564, now seen corresponding path program 1 times [2022-11-20 09:36:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:03,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238926046] [2022-11-20 09:36:03,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:03,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:03,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:03,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238926046] [2022-11-20 09:36:03,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238926046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:03,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:03,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:36:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809218806] [2022-11-20 09:36:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:03,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:36:03,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:03,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:36:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:36:03,816 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-20 09:36:03,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 444 transitions, 3556 flow. Second operand has 7 states, 7 states have (on average 232.71428571428572) internal successors, (1629), 7 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:03,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:03,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-20 09:36:03,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand