./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-8393723 [2022-11-18 19:49:09,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:49:09,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:49:09,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:49:09,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:49:09,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:49:09,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:49:09,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:49:09,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:49:09,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:49:09,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:49:09,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:49:09,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:49:09,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:49:09,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:49:09,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:49:09,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:49:09,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:49:09,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:49:09,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:49:09,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:49:09,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:49:09,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:49:09,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:49:10,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:49:10,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:49:10,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:49:10,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:49:10,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:49:10,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:49:10,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:49:10,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:49:10,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:49:10,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:49:10,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:49:10,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:49:10,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:49:10,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:49:10,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:49:10,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:49:10,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:49:10,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:49:10,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:49:10,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:49:10,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:49:10,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:49:10,064 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:49:10,064 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:49:10,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:49:10,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:49:10,065 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:49:10,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:49:10,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:49:10,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:49:10,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:49:10,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:49:10,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:49:10,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:49:10,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:49:10,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:49:10,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:49:10,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:49:10,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:49:10,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:49:10,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:49:10,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:49:10,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:49:10,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:49:10,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:49:10,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:49:10,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:49:10,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:49:10,072 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:49:10,072 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:49:10,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:49:10,073 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_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 [2022-11-18 19:49:10,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:49:10,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:49:10,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:49:10,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:49:10,412 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:49:10,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-11-18 19:49:10,475 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/data/3f6d917b3/0bdc77eff1f44f7ba6df30a3bd296018/FLAG4d918fb57 [2022-11-18 19:49:11,034 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:49:11,035 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-11-18 19:49:11,042 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/data/3f6d917b3/0bdc77eff1f44f7ba6df30a3bd296018/FLAG4d918fb57 [2022-11-18 19:49:11,423 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/data/3f6d917b3/0bdc77eff1f44f7ba6df30a3bd296018 [2022-11-18 19:49:11,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:49:11,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:49:11,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:49:11,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:49:11,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:49:11,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:11,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7260dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11, skipping insertion in model container [2022-11-18 19:49:11,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:11,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:49:11,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:49:11,772 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2022-11-18 19:49:11,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:49:11,808 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:49:11,862 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3292,3305] [2022-11-18 19:49:11,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:49:11,881 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:49:11,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11 WrapperNode [2022-11-18 19:49:11,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:49:11,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:49:11,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:49:11,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:49:11,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:11,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:11,955 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-11-18 19:49:11,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:49:11,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:49:11,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:49:11,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:49:11,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:11,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:11,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:11,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:11,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:12,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:12,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:12,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:12,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:49:12,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:49:12,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:49:12,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:49:12,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (1/1) ... [2022-11-18 19:49:12,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:49:12,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:49:12,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:49:12,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d29ed-43c6-49f1-ba00-296604fc841c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:49:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:49:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:49:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:49:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:49:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 19:49:12,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 19:49:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 19:49:12,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 19:49:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 19:49:12,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 19:49:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:49:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:49:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:49:12,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:49:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:49:12,125 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:49:12,317 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:49:12,331 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:49:12,761 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:49:12,772 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:49:12,773 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-18 19:49:12,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:49:12 BoogieIcfgContainer [2022-11-18 19:49:12,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:49:12,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:49:12,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:49:12,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:49:12,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:49:11" (1/3) ... [2022-11-18 19:49:12,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf4aa1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:49:12, skipping insertion in model container [2022-11-18 19:49:12,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:11" (2/3) ... [2022-11-18 19:49:12,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf4aa1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:49:12, skipping insertion in model container [2022-11-18 19:49:12,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:49:12" (3/3) ... [2022-11-18 19:49:12,786 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-11-18 19:49:12,795 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:49:12,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:49:12,806 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:49:12,806 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:49:12,963 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 19:49:13,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 302 transitions, 628 flow [2022-11-18 19:49:13,184 INFO L130 PetriNetUnfolder]: 28/299 cut-off events. [2022-11-18 19:49:13,185 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 19:49:13,194 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-18 19:49:13,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 302 transitions, 628 flow [2022-11-18 19:49:13,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 288 transitions, 594 flow [2022-11-18 19:49:13,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:49:13,245 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;@34e405d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:49:13,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 19:49:13,372 INFO L130 PetriNetUnfolder]: 28/287 cut-off events. [2022-11-18 19:49:13,372 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 19:49:13,373 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:13,373 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-18 19:49:13,374 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-18 19:49:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash 899097834, now seen corresponding path program 1 times [2022-11-18 19:49:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:13,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762253190] [2022-11-18 19:49:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:13,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:13,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762253190] [2022-11-18 19:49:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762253190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:13,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:13,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:49:13,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744043528] [2022-11-18 19:49:13,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:13,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:49:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:49:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:49:13,922 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 302 [2022-11-18 19:49:13,928 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-18 19:49:13,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:13,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 302 [2022-11-18 19:49:13,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:14,038 INFO L130 PetriNetUnfolder]: 15/275 cut-off events. [2022-11-18 19:49:14,038 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-18 19:49:14,041 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-18 19:49:14,042 INFO L137 encePairwiseOnDemand]: 289/302 looper letters, 6 selfloop transitions, 0 changer transitions 7/275 dead transitions. [2022-11-18 19:49:14,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 275 transitions, 580 flow [2022-11-18 19:49:14,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:49:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 19:49:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 583 transitions. [2022-11-18 19:49:14,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9652317880794702 [2022-11-18 19:49:14,068 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 583 transitions. [2022-11-18 19:49:14,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 583 transitions. [2022-11-18 19:49:14,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:14,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 583 transitions. [2022-11-18 19:49:14,082 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-18 19:49:14,091 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-18 19:49:14,092 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-18 19:49:14,094 INFO L175 Difference]: Start difference. First operand has 270 places, 288 transitions, 594 flow. Second operand 2 states and 583 transitions. [2022-11-18 19:49:14,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 275 transitions, 580 flow [2022-11-18 19:49:14,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 275 transitions, 568 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 19:49:14,116 INFO L231 Difference]: Finished difference. Result has 265 places, 268 transitions, 542 flow [2022-11-18 19:49:14,118 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-18 19:49:14,124 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, -5 predicate places. [2022-11-18 19:49:14,125 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 268 transitions, 542 flow [2022-11-18 19:49:14,125 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-18 19:49:14,125 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:14,126 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-18 19:49:14,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:49:14,127 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-18 19:49:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 786412167, now seen corresponding path program 1 times [2022-11-18 19:49:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:14,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936837145] [2022-11-18 19:49:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:15,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:15,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936837145] [2022-11-18 19:49:15,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936837145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:15,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:15,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:15,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27195005] [2022-11-18 19:49:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:15,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:15,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:15,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:15,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:15,225 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-18 19:49:15,227 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-18 19:49:15,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:15,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-18 19:49:15,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:15,981 INFO L130 PetriNetUnfolder]: 490/1949 cut-off events. [2022-11-18 19:49:15,981 INFO L131 PetriNetUnfolder]: For 55/60 co-relation queries the response was YES. [2022-11-18 19:49:15,989 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 15069 event pairs, 221 based on Foata normal form. 2/1635 useless extension candidates. Maximal degree in co-relation 2643. Up to 492 conditions per place. [2022-11-18 19:49:16,006 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 83 selfloop transitions, 8 changer transitions 6/307 dead transitions. [2022-11-18 19:49:16,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 825 flow [2022-11-18 19:49:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:49:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:49:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2105 transitions. [2022-11-18 19:49:16,011 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7744665194996321 [2022-11-18 19:49:16,011 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2105 transitions. [2022-11-18 19:49:16,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2105 transitions. [2022-11-18 19:49:16,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:16,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2105 transitions. [2022-11-18 19:49:16,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 233.88888888888889) internal successors, (2105), 9 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:16,024 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-18 19:49:16,026 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-18 19:49:16,026 INFO L175 Difference]: Start difference. First operand has 265 places, 268 transitions, 542 flow. Second operand 9 states and 2105 transitions. [2022-11-18 19:49:16,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 825 flow [2022-11-18 19:49:16,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 307 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 19:49:16,033 INFO L231 Difference]: Finished difference. Result has 271 places, 272 transitions, 591 flow [2022-11-18 19:49:16,034 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=591, PETRI_PLACES=271, PETRI_TRANSITIONS=272} [2022-11-18 19:49:16,034 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 1 predicate places. [2022-11-18 19:49:16,035 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 272 transitions, 591 flow [2022-11-18 19:49:16,036 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-18 19:49:16,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:16,036 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:16,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:49:16,037 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-18 19:49:16,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash 204285325, now seen corresponding path program 2 times [2022-11-18 19:49:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:16,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995490189] [2022-11-18 19:49:16,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:16,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:16,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995490189] [2022-11-18 19:49:16,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995490189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:16,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:16,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264159102] [2022-11-18 19:49:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:16,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:16,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:16,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:16,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:16,905 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-18 19:49:16,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 272 transitions, 591 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-18 19:49:16,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:16,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-18 19:49:16,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:17,811 INFO L130 PetriNetUnfolder]: 850/2684 cut-off events. [2022-11-18 19:49:17,813 INFO L131 PetriNetUnfolder]: For 621/621 co-relation queries the response was YES. [2022-11-18 19:49:17,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 2684 events. 850/2684 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 21055 event pairs, 101 based on Foata normal form. 2/2314 useless extension candidates. Maximal degree in co-relation 4278. Up to 683 conditions per place. [2022-11-18 19:49:17,841 INFO L137 encePairwiseOnDemand]: 287/302 looper letters, 98 selfloop transitions, 17 changer transitions 10/335 dead transitions. [2022-11-18 19:49:17,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 335 transitions, 1040 flow [2022-11-18 19:49:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:49:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 19:49:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2576 transitions. [2022-11-18 19:49:17,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7754364840457556 [2022-11-18 19:49:17,848 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2576 transitions. [2022-11-18 19:49:17,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2576 transitions. [2022-11-18 19:49:17,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:17,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2576 transitions. [2022-11-18 19:49:17,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 234.1818181818182) internal successors, (2576), 11 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:17,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 302.0) internal successors, (3624), 12 states have internal predecessors, (3624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:17,866 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 302.0) internal successors, (3624), 12 states have internal predecessors, (3624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:17,866 INFO L175 Difference]: Start difference. First operand has 271 places, 272 transitions, 591 flow. Second operand 11 states and 2576 transitions. [2022-11-18 19:49:17,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 335 transitions, 1040 flow [2022-11-18 19:49:17,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 335 transitions, 1015 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-18 19:49:17,877 INFO L231 Difference]: Finished difference. Result has 281 places, 285 transitions, 711 flow [2022-11-18 19:49:17,878 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=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=711, PETRI_PLACES=281, PETRI_TRANSITIONS=285} [2022-11-18 19:49:17,880 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 11 predicate places. [2022-11-18 19:49:17,880 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 285 transitions, 711 flow [2022-11-18 19:49:17,882 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-18 19:49:17,882 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:17,883 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-18 19:49:17,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:49:17,883 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-18 19:49:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1045950575, now seen corresponding path program 3 times [2022-11-18 19:49:17,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:17,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167592024] [2022-11-18 19:49:17,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:18,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:18,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167592024] [2022-11-18 19:49:18,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167592024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:18,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:18,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49746620] [2022-11-18 19:49:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:18,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:18,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:18,442 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-18 19:49:18,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 285 transitions, 711 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-18 19:49:18,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:18,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-18 19:49:18,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:19,325 INFO L130 PetriNetUnfolder]: 836/2995 cut-off events. [2022-11-18 19:49:19,325 INFO L131 PetriNetUnfolder]: For 2036/2502 co-relation queries the response was YES. [2022-11-18 19:49:19,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5615 conditions, 2995 events. 836/2995 cut-off events. For 2036/2502 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 26148 event pairs, 284 based on Foata normal form. 10/2566 useless extension candidates. Maximal degree in co-relation 5601. Up to 760 conditions per place. [2022-11-18 19:49:19,359 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 94 selfloop transitions, 19 changer transitions 4/327 dead transitions. [2022-11-18 19:49:19,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 327 transitions, 1141 flow [2022-11-18 19:49:19,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:49:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:49:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1663 transitions. [2022-11-18 19:49:19,365 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7866603595080416 [2022-11-18 19:49:19,365 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1663 transitions. [2022-11-18 19:49:19,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1663 transitions. [2022-11-18 19:49:19,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:19,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1663 transitions. [2022-11-18 19:49:19,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 237.57142857142858) internal successors, (1663), 7 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:19,383 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-18 19:49:19,384 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-18 19:49:19,385 INFO L175 Difference]: Start difference. First operand has 281 places, 285 transitions, 711 flow. Second operand 7 states and 1663 transitions. [2022-11-18 19:49:19,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 327 transitions, 1141 flow [2022-11-18 19:49:19,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 327 transitions, 1099 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-11-18 19:49:19,410 INFO L231 Difference]: Finished difference. Result has 283 places, 295 transitions, 851 flow [2022-11-18 19:49:19,411 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=851, PETRI_PLACES=283, PETRI_TRANSITIONS=295} [2022-11-18 19:49:19,413 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 13 predicate places. [2022-11-18 19:49:19,418 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 295 transitions, 851 flow [2022-11-18 19:49:19,419 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-18 19:49:19,419 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:19,419 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-18 19:49:19,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:49:19,420 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-18 19:49:19,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 235625509, now seen corresponding path program 4 times [2022-11-18 19:49:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:19,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653610624] [2022-11-18 19:49:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:20,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653610624] [2022-11-18 19:49:20,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653610624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:20,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:20,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646855026] [2022-11-18 19:49:20,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:20,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:20,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:20,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:20,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:20,277 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-18 19:49:20,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 295 transitions, 851 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-18 19:49:20,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:20,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-18 19:49:20,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:21,230 INFO L130 PetriNetUnfolder]: 950/3286 cut-off events. [2022-11-18 19:49:21,230 INFO L131 PetriNetUnfolder]: For 5198/5961 co-relation queries the response was YES. [2022-11-18 19:49:21,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7023 conditions, 3286 events. 950/3286 cut-off events. For 5198/5961 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 28847 event pairs, 116 based on Foata normal form. 75/2978 useless extension candidates. Maximal degree in co-relation 7007. Up to 824 conditions per place. [2022-11-18 19:49:21,269 INFO L137 encePairwiseOnDemand]: 284/302 looper letters, 102 selfloop transitions, 32 changer transitions 5/349 dead transitions. [2022-11-18 19:49:21,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 349 transitions, 1409 flow [2022-11-18 19:49:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:49:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:49:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2128 transitions. [2022-11-18 19:49:21,275 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7829286239882266 [2022-11-18 19:49:21,275 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2128 transitions. [2022-11-18 19:49:21,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2128 transitions. [2022-11-18 19:49:21,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:21,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2128 transitions. [2022-11-18 19:49:21,281 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-18 19:49:21,286 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-18 19:49:21,288 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-18 19:49:21,288 INFO L175 Difference]: Start difference. First operand has 283 places, 295 transitions, 851 flow. Second operand 9 states and 2128 transitions. [2022-11-18 19:49:21,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 349 transitions, 1409 flow [2022-11-18 19:49:21,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 349 transitions, 1363 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-11-18 19:49:21,326 INFO L231 Difference]: Finished difference. Result has 291 places, 305 transitions, 1040 flow [2022-11-18 19:49:21,327 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1040, PETRI_PLACES=291, PETRI_TRANSITIONS=305} [2022-11-18 19:49:21,328 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 21 predicate places. [2022-11-18 19:49:21,328 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 305 transitions, 1040 flow [2022-11-18 19:49:21,329 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-18 19:49:21,329 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:21,329 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-18 19:49:21,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:49:21,330 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-18 19:49:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -762082599, now seen corresponding path program 5 times [2022-11-18 19:49:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:21,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549305666] [2022-11-18 19:49:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:21,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:21,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549305666] [2022-11-18 19:49:21,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549305666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:21,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:21,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011134874] [2022-11-18 19:49:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:21,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:21,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:21,974 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-18 19:49:21,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 305 transitions, 1040 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-18 19:49:21,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:21,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-18 19:49:21,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:22,971 INFO L130 PetriNetUnfolder]: 993/3655 cut-off events. [2022-11-18 19:49:22,971 INFO L131 PetriNetUnfolder]: For 8857/9791 co-relation queries the response was YES. [2022-11-18 19:49:22,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8488 conditions, 3655 events. 993/3655 cut-off events. For 8857/9791 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 34148 event pairs, 138 based on Foata normal form. 72/3369 useless extension candidates. Maximal degree in co-relation 8469. Up to 1044 conditions per place. [2022-11-18 19:49:23,012 INFO L137 encePairwiseOnDemand]: 288/302 looper letters, 124 selfloop transitions, 18 changer transitions 10/362 dead transitions. [2022-11-18 19:49:23,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 362 transitions, 1647 flow [2022-11-18 19:49:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:49:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:49:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1900 transitions. [2022-11-18 19:49:23,018 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7864238410596026 [2022-11-18 19:49:23,018 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1900 transitions. [2022-11-18 19:49:23,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1900 transitions. [2022-11-18 19:49:23,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:23,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1900 transitions. [2022-11-18 19:49:23,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 237.5) internal successors, (1900), 8 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:23,030 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-18 19:49:23,031 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-18 19:49:23,031 INFO L175 Difference]: Start difference. First operand has 291 places, 305 transitions, 1040 flow. Second operand 8 states and 1900 transitions. [2022-11-18 19:49:23,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 362 transitions, 1647 flow [2022-11-18 19:49:23,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 362 transitions, 1591 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-11-18 19:49:23,111 INFO L231 Difference]: Finished difference. Result has 297 places, 310 transitions, 1104 flow [2022-11-18 19:49:23,111 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1104, PETRI_PLACES=297, PETRI_TRANSITIONS=310} [2022-11-18 19:49:23,114 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 27 predicate places. [2022-11-18 19:49:23,115 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 310 transitions, 1104 flow [2022-11-18 19:49:23,116 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-18 19:49:23,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:23,116 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-18 19:49:23,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:49:23,117 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-18 19:49:23,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1785579015, now seen corresponding path program 6 times [2022-11-18 19:49:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:23,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832998110] [2022-11-18 19:49:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832998110] [2022-11-18 19:49:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832998110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:23,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:23,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893913719] [2022-11-18 19:49:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:23,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:23,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:23,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:23,883 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 302 [2022-11-18 19:49:23,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 310 transitions, 1104 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-18 19:49:23,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:23,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 302 [2022-11-18 19:49:23,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:24,932 INFO L130 PetriNetUnfolder]: 968/4361 cut-off events. [2022-11-18 19:49:24,933 INFO L131 PetriNetUnfolder]: For 9855/10269 co-relation queries the response was YES. [2022-11-18 19:49:24,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9362 conditions, 4361 events. 968/4361 cut-off events. For 9855/10269 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 44923 event pairs, 249 based on Foata normal form. 68/3963 useless extension candidates. Maximal degree in co-relation 9339. Up to 871 conditions per place. [2022-11-18 19:49:24,985 INFO L137 encePairwiseOnDemand]: 288/302 looper letters, 105 selfloop transitions, 41 changer transitions 5/361 dead transitions. [2022-11-18 19:49:24,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 361 transitions, 1765 flow [2022-11-18 19:49:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:49:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:49:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1885 transitions. [2022-11-18 19:49:24,990 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7802152317880795 [2022-11-18 19:49:24,990 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1885 transitions. [2022-11-18 19:49:24,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1885 transitions. [2022-11-18 19:49:24,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:24,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1885 transitions. [2022-11-18 19:49:24,996 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-18 19:49:25,001 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-18 19:49:25,013 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-18 19:49:25,021 INFO L175 Difference]: Start difference. First operand has 297 places, 310 transitions, 1104 flow. Second operand 8 states and 1885 transitions. [2022-11-18 19:49:25,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 361 transitions, 1765 flow [2022-11-18 19:49:25,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 361 transitions, 1725 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-11-18 19:49:25,075 INFO L231 Difference]: Finished difference. Result has 304 places, 323 transitions, 1370 flow [2022-11-18 19:49:25,076 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1370, PETRI_PLACES=304, PETRI_TRANSITIONS=323} [2022-11-18 19:49:25,077 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 34 predicate places. [2022-11-18 19:49:25,077 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 323 transitions, 1370 flow [2022-11-18 19:49:25,078 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-18 19:49:25,078 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:25,079 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-18 19:49:25,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:49:25,079 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-18 19:49:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1202193495, now seen corresponding path program 1 times [2022-11-18 19:49:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:25,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397959327] [2022-11-18 19:49:25,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:25,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:25,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397959327] [2022-11-18 19:49:25,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397959327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:25,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:25,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:49:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408343384] [2022-11-18 19:49:25,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:25,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:49:25,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:25,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:49:25,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:49:25,265 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-18 19:49:25,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 323 transitions, 1370 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-18 19:49:25,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:25,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-18 19:49:25,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:25,684 INFO L130 PetriNetUnfolder]: 310/1901 cut-off events. [2022-11-18 19:49:25,685 INFO L131 PetriNetUnfolder]: For 4828/5085 co-relation queries the response was YES. [2022-11-18 19:49:25,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 1901 events. 310/1901 cut-off events. For 4828/5085 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15987 event pairs, 45 based on Foata normal form. 24/1733 useless extension candidates. Maximal degree in co-relation 4151. Up to 296 conditions per place. [2022-11-18 19:49:25,715 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 14 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2022-11-18 19:49:25,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 329 transitions, 1419 flow [2022-11-18 19:49:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:49:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:49:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2022-11-18 19:49:25,722 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9392935982339956 [2022-11-18 19:49:25,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 851 transitions. [2022-11-18 19:49:25,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 851 transitions. [2022-11-18 19:49:25,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:25,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 851 transitions. [2022-11-18 19:49:25,725 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-18 19:49:25,727 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-18 19:49:25,727 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-18 19:49:25,727 INFO L175 Difference]: Start difference. First operand has 304 places, 323 transitions, 1370 flow. Second operand 3 states and 851 transitions. [2022-11-18 19:49:25,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 329 transitions, 1419 flow [2022-11-18 19:49:25,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 329 transitions, 1363 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-11-18 19:49:25,758 INFO L231 Difference]: Finished difference. Result has 302 places, 323 transitions, 1322 flow [2022-11-18 19:49:25,759 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=302, PETRI_TRANSITIONS=323} [2022-11-18 19:49:25,762 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 32 predicate places. [2022-11-18 19:49:25,762 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 323 transitions, 1322 flow [2022-11-18 19:49:25,762 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-18 19:49:25,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:25,763 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-18 19:49:25,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:49:25,763 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-18 19:49:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash -48409571, now seen corresponding path program 1 times [2022-11-18 19:49:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:25,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329013106] [2022-11-18 19:49:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:25,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329013106] [2022-11-18 19:49:25,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329013106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:25,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:25,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:49:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479927547] [2022-11-18 19:49:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:25,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:49:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:49:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:49:25,921 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-18 19:49:25,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 323 transitions, 1322 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-18 19:49:25,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:25,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-18 19:49:25,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:26,420 INFO L130 PetriNetUnfolder]: 516/2726 cut-off events. [2022-11-18 19:49:26,420 INFO L131 PetriNetUnfolder]: For 7429/7831 co-relation queries the response was YES. [2022-11-18 19:49:26,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6071 conditions, 2726 events. 516/2726 cut-off events. For 7429/7831 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 25369 event pairs, 101 based on Foata normal form. 18/2445 useless extension candidates. Maximal degree in co-relation 6044. Up to 378 conditions per place. [2022-11-18 19:49:26,453 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 12 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2022-11-18 19:49:26,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 327 transitions, 1361 flow [2022-11-18 19:49:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:49:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:49:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2022-11-18 19:49:26,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9370860927152318 [2022-11-18 19:49:26,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2022-11-18 19:49:26,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2022-11-18 19:49:26,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:26,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2022-11-18 19:49:26,459 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-18 19:49:26,461 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-18 19:49:26,461 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-18 19:49:26,461 INFO L175 Difference]: Start difference. First operand has 302 places, 323 transitions, 1322 flow. Second operand 3 states and 849 transitions. [2022-11-18 19:49:26,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 327 transitions, 1361 flow [2022-11-18 19:49:26,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 327 transitions, 1349 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-18 19:49:26,492 INFO L231 Difference]: Finished difference. Result has 303 places, 323 transitions, 1318 flow [2022-11-18 19:49:26,492 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=303, PETRI_TRANSITIONS=323} [2022-11-18 19:49:26,494 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 33 predicate places. [2022-11-18 19:49:26,494 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 323 transitions, 1318 flow [2022-11-18 19:49:26,494 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-18 19:49:26,494 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:26,495 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-18 19:49:26,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:49:26,495 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-18 19:49:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1306535191, now seen corresponding path program 1 times [2022-11-18 19:49:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:26,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535311377] [2022-11-18 19:49:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:26,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535311377] [2022-11-18 19:49:26,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535311377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:26,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:26,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:49:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945117477] [2022-11-18 19:49:26,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:26,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:49:26,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:49:26,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:49:26,659 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 302 [2022-11-18 19:49:26,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 323 transitions, 1318 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-18 19:49:26,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:26,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 302 [2022-11-18 19:49:26,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:27,210 INFO L130 PetriNetUnfolder]: 462/2860 cut-off events. [2022-11-18 19:49:27,211 INFO L131 PetriNetUnfolder]: For 5960/6222 co-relation queries the response was YES. [2022-11-18 19:49:27,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 2860 events. 462/2860 cut-off events. For 5960/6222 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 27022 event pairs, 115 based on Foata normal form. 31/2644 useless extension candidates. Maximal degree in co-relation 5997. Up to 406 conditions per place. [2022-11-18 19:49:27,257 INFO L137 encePairwiseOnDemand]: 299/302 looper letters, 13 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2022-11-18 19:49:27,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 328 transitions, 1362 flow [2022-11-18 19:49:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:49:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:49:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 850 transitions. [2022-11-18 19:49:27,260 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9381898454746137 [2022-11-18 19:49:27,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 850 transitions. [2022-11-18 19:49:27,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 850 transitions. [2022-11-18 19:49:27,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:27,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 850 transitions. [2022-11-18 19:49:27,263 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-18 19:49:27,265 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-18 19:49:27,265 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-18 19:49:27,266 INFO L175 Difference]: Start difference. First operand has 303 places, 323 transitions, 1318 flow. Second operand 3 states and 850 transitions. [2022-11-18 19:49:27,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 328 transitions, 1362 flow [2022-11-18 19:49:27,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 328 transitions, 1344 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-18 19:49:27,299 INFO L231 Difference]: Finished difference. Result has 304 places, 323 transitions, 1308 flow [2022-11-18 19:49:27,301 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=304, PETRI_TRANSITIONS=323} [2022-11-18 19:49:27,302 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 34 predicate places. [2022-11-18 19:49:27,302 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 323 transitions, 1308 flow [2022-11-18 19:49:27,303 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-18 19:49:27,303 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:27,303 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-18 19:49:27,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:49:27,303 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-18 19:49:27,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2070629245, now seen corresponding path program 1 times [2022-11-18 19:49:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:27,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309926642] [2022-11-18 19:49:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:27,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309926642] [2022-11-18 19:49:27,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309926642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:27,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:27,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728008394] [2022-11-18 19:49:27,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:27,748 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:27,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 323 transitions, 1308 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-18 19:49:27,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:27,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:27,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:29,117 INFO L130 PetriNetUnfolder]: 1012/4992 cut-off events. [2022-11-18 19:49:29,117 INFO L131 PetriNetUnfolder]: For 14537/15358 co-relation queries the response was YES. [2022-11-18 19:49:29,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12122 conditions, 4992 events. 1012/4992 cut-off events. For 14537/15358 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 51339 event pairs, 122 based on Foata normal form. 86/4844 useless extension candidates. Maximal degree in co-relation 12093. Up to 755 conditions per place. [2022-11-18 19:49:29,195 INFO L137 encePairwiseOnDemand]: 289/302 looper letters, 146 selfloop transitions, 47 changer transitions 5/417 dead transitions. [2022-11-18 19:49:29,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 417 transitions, 2537 flow [2022-11-18 19:49:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:49:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:49:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2383 transitions. [2022-11-18 19:49:29,203 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7890728476821192 [2022-11-18 19:49:29,203 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2383 transitions. [2022-11-18 19:49:29,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2383 transitions. [2022-11-18 19:49:29,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:29,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2383 transitions. [2022-11-18 19:49:29,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 238.3) internal successors, (2383), 10 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:29,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:29,219 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:29,219 INFO L175 Difference]: Start difference. First operand has 304 places, 323 transitions, 1308 flow. Second operand 10 states and 2383 transitions. [2022-11-18 19:49:29,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 417 transitions, 2537 flow [2022-11-18 19:49:29,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 417 transitions, 2477 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-11-18 19:49:29,320 INFO L231 Difference]: Finished difference. Result has 317 places, 354 transitions, 1860 flow [2022-11-18 19:49:29,320 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1860, PETRI_PLACES=317, PETRI_TRANSITIONS=354} [2022-11-18 19:49:29,321 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 47 predicate places. [2022-11-18 19:49:29,321 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 354 transitions, 1860 flow [2022-11-18 19:49:29,322 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-18 19:49:29,322 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:29,323 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-18 19:49:29,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:49:29,323 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-18 19:49:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1262580947, now seen corresponding path program 2 times [2022-11-18 19:49:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:29,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497610547] [2022-11-18 19:49:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:29,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497610547] [2022-11-18 19:49:29,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497610547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:29,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:29,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415096406] [2022-11-18 19:49:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:29,725 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:29,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 354 transitions, 1860 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-18 19:49:29,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:29,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:29,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:31,280 INFO L130 PetriNetUnfolder]: 1254/6599 cut-off events. [2022-11-18 19:49:31,280 INFO L131 PetriNetUnfolder]: For 21645/22990 co-relation queries the response was YES. [2022-11-18 19:49:31,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16469 conditions, 6599 events. 1254/6599 cut-off events. For 21645/22990 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 74036 event pairs, 260 based on Foata normal form. 148/6358 useless extension candidates. Maximal degree in co-relation 16434. Up to 947 conditions per place. [2022-11-18 19:49:31,362 INFO L137 encePairwiseOnDemand]: 292/302 looper letters, 172 selfloop transitions, 50 changer transitions 4/445 dead transitions. [2022-11-18 19:49:31,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 445 transitions, 3181 flow [2022-11-18 19:49:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:49:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:49:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1927 transitions. [2022-11-18 19:49:31,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7975993377483444 [2022-11-18 19:49:31,367 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1927 transitions. [2022-11-18 19:49:31,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1927 transitions. [2022-11-18 19:49:31,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:31,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1927 transitions. [2022-11-18 19:49:31,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 240.875) internal successors, (1927), 8 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:31,377 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-18 19:49:31,378 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-18 19:49:31,378 INFO L175 Difference]: Start difference. First operand has 317 places, 354 transitions, 1860 flow. Second operand 8 states and 1927 transitions. [2022-11-18 19:49:31,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 445 transitions, 3181 flow [2022-11-18 19:49:31,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 445 transitions, 3057 flow, removed 61 selfloop flow, removed 3 redundant places. [2022-11-18 19:49:31,488 INFO L231 Difference]: Finished difference. Result has 325 places, 387 transitions, 2505 flow [2022-11-18 19:49:31,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2505, PETRI_PLACES=325, PETRI_TRANSITIONS=387} [2022-11-18 19:49:31,489 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 55 predicate places. [2022-11-18 19:49:31,490 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 387 transitions, 2505 flow [2022-11-18 19:49:31,490 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-18 19:49:31,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:31,491 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-18 19:49:31,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:49:31,492 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-18 19:49:31,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash 824522733, now seen corresponding path program 1 times [2022-11-18 19:49:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:31,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241562720] [2022-11-18 19:49:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:31,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241562720] [2022-11-18 19:49:31,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241562720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:31,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:31,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263589419] [2022-11-18 19:49:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:31,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:31,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:31,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 387 transitions, 2505 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-18 19:49:31,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:31,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:31,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:33,357 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[][415], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), 498#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 410#true, 473#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~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: 325#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(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: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 315#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 486#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 488#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 364#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 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))), 85#L125-2true, 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: 439#(= thread3Thread1of1ForFork2_~stop~2 0), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-18 19:49:33,358 INFO L383 tUnfolder$Statistics]: this new event has 193 ancestors and is not cut-off event [2022-11-18 19:49:33,358 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-18 19:49:33,358 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is not cut-off event [2022-11-18 19:49:33,358 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-18 19:49:33,362 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[][414], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), 410#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~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: 325#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0))), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(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: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 486#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 488#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 496#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 364#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))), 475#(<= ~count2~0 ~count1~0), 449#(<= ~count2~0 ~count1~0), 85#L125-2true, 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: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 313#true, Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-18 19:49:33,363 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is not cut-off event [2022-11-18 19:49:33,363 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is not cut-off event [2022-11-18 19:49:33,363 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 19:49:33,363 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-18 19:49:33,381 INFO L130 PetriNetUnfolder]: 1137/6122 cut-off events. [2022-11-18 19:49:33,381 INFO L131 PetriNetUnfolder]: For 21543/22327 co-relation queries the response was YES. [2022-11-18 19:49:33,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15878 conditions, 6122 events. 1137/6122 cut-off events. For 21543/22327 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 67583 event pairs, 194 based on Foata normal form. 78/5836 useless extension candidates. Maximal degree in co-relation 15838. Up to 1293 conditions per place. [2022-11-18 19:49:33,451 INFO L137 encePairwiseOnDemand]: 291/302 looper letters, 131 selfloop transitions, 32 changer transitions 13/436 dead transitions. [2022-11-18 19:49:33,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 436 transitions, 3165 flow [2022-11-18 19:49:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:49:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:49:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1912 transitions. [2022-11-18 19:49:33,457 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7913907284768212 [2022-11-18 19:49:33,457 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1912 transitions. [2022-11-18 19:49:33,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1912 transitions. [2022-11-18 19:49:33,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:33,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1912 transitions. [2022-11-18 19:49:33,462 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-18 19:49:33,466 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-18 19:49:33,467 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-18 19:49:33,467 INFO L175 Difference]: Start difference. First operand has 325 places, 387 transitions, 2505 flow. Second operand 8 states and 1912 transitions. [2022-11-18 19:49:33,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 436 transitions, 3165 flow [2022-11-18 19:49:33,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 436 transitions, 3047 flow, removed 56 selfloop flow, removed 4 redundant places. [2022-11-18 19:49:33,626 INFO L231 Difference]: Finished difference. Result has 330 places, 391 transitions, 2542 flow [2022-11-18 19:49:33,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2413, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2542, PETRI_PLACES=330, PETRI_TRANSITIONS=391} [2022-11-18 19:49:33,628 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 60 predicate places. [2022-11-18 19:49:33,628 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 391 transitions, 2542 flow [2022-11-18 19:49:33,629 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-18 19:49:33,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:33,629 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-18 19:49:33,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:49:33,629 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-18 19:49:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:33,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1355129075, now seen corresponding path program 2 times [2022-11-18 19:49:33,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:33,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259568285] [2022-11-18 19:49:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:34,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:34,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259568285] [2022-11-18 19:49:34,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259568285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:34,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:34,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:34,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939956278] [2022-11-18 19:49:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:34,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:34,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:34,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:34,069 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:34,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 391 transitions, 2542 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-18 19:49:34,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:34,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:35,403 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[][456], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 511#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~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: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), Black: 507#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 509#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 498#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 410#true, 473#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~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: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(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: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 315#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), 447#true, Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 364#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 85#L125-2true, 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: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), 388#true]) [2022-11-18 19:49:35,403 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is not cut-off event [2022-11-18 19:49:35,403 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 19:49:35,404 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 19:49:35,404 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is not cut-off event [2022-11-18 19:49:35,464 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[][456], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 511#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~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: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), Black: 507#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 509#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 498#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 410#true, 473#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~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: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(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: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 315#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 364#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 85#L125-2true, 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: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-18 19:49:35,464 INFO L383 tUnfolder$Statistics]: this new event has 193 ancestors and is not cut-off event [2022-11-18 19:49:35,464 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is not cut-off event [2022-11-18 19:49:35,464 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-18 19:49:35,464 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-18 19:49:35,488 INFO L130 PetriNetUnfolder]: 1195/7053 cut-off events. [2022-11-18 19:49:35,488 INFO L131 PetriNetUnfolder]: For 23765/24597 co-relation queries the response was YES. [2022-11-18 19:49:35,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17968 conditions, 7053 events. 1195/7053 cut-off events. For 23765/24597 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 82111 event pairs, 139 based on Foata normal form. 164/6833 useless extension candidates. Maximal degree in co-relation 17927. Up to 996 conditions per place. [2022-11-18 19:49:35,556 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 159 selfloop transitions, 55 changer transitions 4/478 dead transitions. [2022-11-18 19:49:35,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 478 transitions, 3664 flow [2022-11-18 19:49:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:49:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:49:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2152 transitions. [2022-11-18 19:49:35,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7917586460632818 [2022-11-18 19:49:35,562 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2152 transitions. [2022-11-18 19:49:35,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2152 transitions. [2022-11-18 19:49:35,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:35,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2152 transitions. [2022-11-18 19:49:35,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 239.11111111111111) internal successors, (2152), 9 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:35,573 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-18 19:49:35,574 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-18 19:49:35,574 INFO L175 Difference]: Start difference. First operand has 330 places, 391 transitions, 2542 flow. Second operand 9 states and 2152 transitions. [2022-11-18 19:49:35,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 478 transitions, 3664 flow [2022-11-18 19:49:35,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 478 transitions, 3585 flow, removed 32 selfloop flow, removed 4 redundant places. [2022-11-18 19:49:35,740 INFO L231 Difference]: Finished difference. Result has 335 places, 412 transitions, 2924 flow [2022-11-18 19:49:35,741 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2493, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2924, PETRI_PLACES=335, PETRI_TRANSITIONS=412} [2022-11-18 19:49:35,741 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 65 predicate places. [2022-11-18 19:49:35,742 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 412 transitions, 2924 flow [2022-11-18 19:49:35,742 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-18 19:49:35,742 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:35,743 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-18 19:49:35,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:49:35,743 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-18 19:49:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1992335965, now seen corresponding path program 3 times [2022-11-18 19:49:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:35,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106362005] [2022-11-18 19:49:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:36,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:36,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106362005] [2022-11-18 19:49:36,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106362005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:36,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:36,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:36,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366727948] [2022-11-18 19:49:36,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:36,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:36,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:36,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:36,191 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:36,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 412 transitions, 2924 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-18 19:49:36,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:36,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:36,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:37,788 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[][427], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 498#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), 410#true, 473#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~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: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(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: 519#(<= ~count1~0 ~count3~0), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 533#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~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: 531#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 475#(<= ~count2~0 ~count1~0), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), 542#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 364#true, Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 85#L125-2true, 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: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-18 19:49:37,788 INFO L383 tUnfolder$Statistics]: this new event has 193 ancestors and is not cut-off event [2022-11-18 19:49:37,788 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is not cut-off event [2022-11-18 19:49:37,789 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-18 19:49:37,789 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-18 19:49:37,849 INFO L130 PetriNetUnfolder]: 1233/7269 cut-off events. [2022-11-18 19:49:37,850 INFO L131 PetriNetUnfolder]: For 28506/29485 co-relation queries the response was YES. [2022-11-18 19:49:37,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18836 conditions, 7269 events. 1233/7269 cut-off events. For 28506/29485 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 84984 event pairs, 372 based on Foata normal form. 122/6927 useless extension candidates. Maximal degree in co-relation 18792. Up to 1425 conditions per place. [2022-11-18 19:49:37,946 INFO L137 encePairwiseOnDemand]: 290/302 looper letters, 159 selfloop transitions, 22 changer transitions 9/448 dead transitions. [2022-11-18 19:49:37,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 448 transitions, 3538 flow [2022-11-18 19:49:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:49:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:49:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2127 transitions. [2022-11-18 19:49:37,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.782560706401766 [2022-11-18 19:49:37,952 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2127 transitions. [2022-11-18 19:49:37,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2127 transitions. [2022-11-18 19:49:37,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:37,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2127 transitions. [2022-11-18 19:49:37,958 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-18 19:49:37,963 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-18 19:49:37,964 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-18 19:49:37,964 INFO L175 Difference]: Start difference. First operand has 335 places, 412 transitions, 2924 flow. Second operand 9 states and 2127 transitions. [2022-11-18 19:49:37,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 448 transitions, 3538 flow [2022-11-18 19:49:38,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 448 transitions, 3443 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-11-18 19:49:38,146 INFO L231 Difference]: Finished difference. Result has 341 places, 412 transitions, 2904 flow [2022-11-18 19:49:38,147 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2839, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2904, PETRI_PLACES=341, PETRI_TRANSITIONS=412} [2022-11-18 19:49:38,147 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 71 predicate places. [2022-11-18 19:49:38,147 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 412 transitions, 2904 flow [2022-11-18 19:49:38,148 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-18 19:49:38,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:38,148 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:38,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 19:49:38,149 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-18 19:49:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 991306587, now seen corresponding path program 1 times [2022-11-18 19:49:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:38,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575991360] [2022-11-18 19:49:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:38,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575991360] [2022-11-18 19:49:38,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575991360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:38,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:38,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:38,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393813716] [2022-11-18 19:49:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:38,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:38,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:38,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:38,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:38,401 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:38,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 412 transitions, 2904 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-18 19:49:38,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:38,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:38,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:39,794 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[][405], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 410#true, 517#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 519#(<= ~count1~0 ~count3~0), Black: 399#(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: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), 287#true, 72#L124-2true, 540#true, 565#(<= ~count3~0 ~count2~0), 224#thread3ENTRYtrue, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 496#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), Black: 553#(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))), 364#true, Black: 555#(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: 557#(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)), Black: 550#(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: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 434#(= thread1Thread1of1ForFork0_~stop~0 0), 449#(<= ~count2~0 ~count1~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: 439#(= thread3Thread1of1ForFork2_~stop~2 0), 313#true, Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-18 19:49:39,794 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is not cut-off event [2022-11-18 19:49:39,794 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is not cut-off event [2022-11-18 19:49:39,794 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2022-11-18 19:49:39,794 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-11-18 19:49:39,795 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[][405], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 410#true, 517#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 519#(<= ~count1~0 ~count3~0), Black: 399#(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: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), 287#true, 72#L124-2true, 540#true, 565#(<= ~count3~0 ~count2~0), 122#L100true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 496#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), Black: 553#(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))), 364#true, Black: 555#(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: 557#(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)), Black: 550#(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: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 434#(= thread1Thread1of1ForFork0_~stop~0 0), 449#(<= ~count2~0 ~count1~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))), 313#true, Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-18 19:49:39,795 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-18 19:49:39,795 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-18 19:49:39,795 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-18 19:49:39,796 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-18 19:49:39,809 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[][405], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 399#(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: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), 58#L89true, 287#true, 72#L124-2true, 565#(<= ~count3~0 ~count2~0), 540#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), Black: 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), 496#true, Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), Black: 553#(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))), 364#true, Black: 555#(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: 557#(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)), Black: 550#(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))), 519#(<= ~count1~0 ~count3~0), Black: 292#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 434#(= thread1Thread1of1ForFork0_~stop~0 0), 449#(<= ~count2~0 ~count1~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))), 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 313#true, Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), 388#true]) [2022-11-18 19:49:39,810 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-18 19:49:39,810 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-18 19:49:39,810 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-18 19:49:39,810 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-18 19:49:39,900 INFO L130 PetriNetUnfolder]: 1394/7739 cut-off events. [2022-11-18 19:49:39,900 INFO L131 PetriNetUnfolder]: For 35371/36661 co-relation queries the response was YES. [2022-11-18 19:49:39,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21295 conditions, 7739 events. 1394/7739 cut-off events. For 35371/36661 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 91710 event pairs, 371 based on Foata normal form. 146/7419 useless extension candidates. Maximal degree in co-relation 21249. Up to 1163 conditions per place. [2022-11-18 19:49:39,974 INFO L137 encePairwiseOnDemand]: 293/302 looper letters, 204 selfloop transitions, 21 changer transitions 6/472 dead transitions. [2022-11-18 19:49:39,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 472 transitions, 3971 flow [2022-11-18 19:49:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:49:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:49:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1677 transitions. [2022-11-18 19:49:39,980 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.793282876064333 [2022-11-18 19:49:39,980 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1677 transitions. [2022-11-18 19:49:39,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1677 transitions. [2022-11-18 19:49:39,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:39,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1677 transitions. [2022-11-18 19:49:39,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:39,991 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-18 19:49:39,992 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-18 19:49:39,992 INFO L175 Difference]: Start difference. First operand has 341 places, 412 transitions, 2904 flow. Second operand 7 states and 1677 transitions. [2022-11-18 19:49:39,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 472 transitions, 3971 flow [2022-11-18 19:49:40,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 472 transitions, 3887 flow, removed 23 selfloop flow, removed 6 redundant places. [2022-11-18 19:49:40,154 INFO L231 Difference]: Finished difference. Result has 344 places, 421 transitions, 3082 flow [2022-11-18 19:49:40,155 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3082, PETRI_PLACES=344, PETRI_TRANSITIONS=421} [2022-11-18 19:49:40,155 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 74 predicate places. [2022-11-18 19:49:40,155 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 421 transitions, 3082 flow [2022-11-18 19:49:40,156 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-18 19:49:40,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:40,156 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-18 19:49:40,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 19:49:40,157 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-18 19:49:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1489914153, now seen corresponding path program 2 times [2022-11-18 19:49:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:40,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593270528] [2022-11-18 19:49:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:40,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:40,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593270528] [2022-11-18 19:49:40,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593270528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:40,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:40,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 19:49:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333575167] [2022-11-18 19:49:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:40,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 19:49:40,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:40,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 19:49:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:49:40,597 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 302 [2022-11-18 19:49:40,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 421 transitions, 3082 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-18 19:49:40,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:40,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 302 [2022-11-18 19:49:40,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:45,255 INFO L130 PetriNetUnfolder]: 4779/21759 cut-off events. [2022-11-18 19:49:45,255 INFO L131 PetriNetUnfolder]: For 84540/86558 co-relation queries the response was YES. [2022-11-18 19:49:45,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56501 conditions, 21759 events. 4779/21759 cut-off events. For 84540/86558 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 298273 event pairs, 1204 based on Foata normal form. 275/19709 useless extension candidates. Maximal degree in co-relation 56452. Up to 3001 conditions per place. [2022-11-18 19:49:45,466 INFO L137 encePairwiseOnDemand]: 281/302 looper letters, 197 selfloop transitions, 93 changer transitions 15/571 dead transitions. [2022-11-18 19:49:45,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 571 transitions, 5247 flow [2022-11-18 19:49:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 19:49:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-18 19:49:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4168 transitions. [2022-11-18 19:49:45,474 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6900662251655629 [2022-11-18 19:49:45,474 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4168 transitions. [2022-11-18 19:49:45,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4168 transitions. [2022-11-18 19:49:45,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:45,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4168 transitions. [2022-11-18 19:49:45,485 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-18 19:49:45,495 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-18 19:49:45,497 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-18 19:49:45,497 INFO L175 Difference]: Start difference. First operand has 344 places, 421 transitions, 3082 flow. Second operand 20 states and 4168 transitions. [2022-11-18 19:49:45,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 571 transitions, 5247 flow [2022-11-18 19:49:45,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 571 transitions, 5183 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-18 19:49:45,878 INFO L231 Difference]: Finished difference. Result has 367 places, 469 transitions, 4001 flow [2022-11-18 19:49:45,878 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3040, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4001, PETRI_PLACES=367, PETRI_TRANSITIONS=469} [2022-11-18 19:49:45,879 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 97 predicate places. [2022-11-18 19:49:45,879 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 469 transitions, 4001 flow [2022-11-18 19:49:45,879 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-18 19:49:45,879 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:45,880 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-18 19:49:45,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 19:49:45,880 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-18 19:49:45,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1117367067, now seen corresponding path program 4 times [2022-11-18 19:49:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:45,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736783857] [2022-11-18 19:49:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736783857] [2022-11-18 19:49:46,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736783857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:46,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:46,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749044070] [2022-11-18 19:49:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:46,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:46,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:46,400 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:46,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 469 transitions, 4001 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-18 19:49:46,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:46,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:46,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:49,960 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[][475], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 596#(<= ~res2~0 0), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 618#(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: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 473#true, Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 519#(<= ~count1~0 ~count3~0), Black: 399#(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: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), 642#true, Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 553#(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))), 364#true, Black: 550#(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))), 85#L125-2true, 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: 439#(= thread3Thread1of1ForFork2_~stop~2 0), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 565#(<= ~count3~0 ~count2~0), Black: 574#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 1) ~count1~0))), 410#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), 585#true, Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), 542#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 571#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 1) ~count1~0))), Black: 620#(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: 608#(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|)), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), Black: 614#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 630#(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) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 626#(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: 616#(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: 628#(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) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 624#(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)), 388#true]) [2022-11-18 19:49:49,960 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is not cut-off event [2022-11-18 19:49:49,960 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is not cut-off event [2022-11-18 19:49:49,960 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is not cut-off event [2022-11-18 19:49:49,961 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is not cut-off event [2022-11-18 19:49:50,018 INFO L130 PetriNetUnfolder]: 2669/16315 cut-off events. [2022-11-18 19:49:50,019 INFO L131 PetriNetUnfolder]: For 80550/82457 co-relation queries the response was YES. [2022-11-18 19:49:50,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44413 conditions, 16315 events. 2669/16315 cut-off events. For 80550/82457 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 224509 event pairs, 966 based on Foata normal form. 178/15489 useless extension candidates. Maximal degree in co-relation 44357. Up to 3454 conditions per place. [2022-11-18 19:49:50,212 INFO L137 encePairwiseOnDemand]: 294/302 looper letters, 185 selfloop transitions, 35 changer transitions 12/497 dead transitions. [2022-11-18 19:49:50,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 497 transitions, 4593 flow [2022-11-18 19:49:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:49:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:49:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1896 transitions. [2022-11-18 19:49:50,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7847682119205298 [2022-11-18 19:49:50,218 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1896 transitions. [2022-11-18 19:49:50,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1896 transitions. [2022-11-18 19:49:50,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:50,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1896 transitions. [2022-11-18 19:49:50,224 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-18 19:49:50,228 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-18 19:49:50,228 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-18 19:49:50,228 INFO L175 Difference]: Start difference. First operand has 367 places, 469 transitions, 4001 flow. Second operand 8 states and 1896 transitions. [2022-11-18 19:49:50,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 497 transitions, 4593 flow [2022-11-18 19:49:50,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 497 transitions, 4513 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-11-18 19:49:50,712 INFO L231 Difference]: Finished difference. Result has 368 places, 465 transitions, 3941 flow [2022-11-18 19:49:50,712 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3937, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3941, PETRI_PLACES=368, PETRI_TRANSITIONS=465} [2022-11-18 19:49:50,713 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 98 predicate places. [2022-11-18 19:49:50,713 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 465 transitions, 3941 flow [2022-11-18 19:49:50,714 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-18 19:49:50,714 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:50,714 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-18 19:49:50,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 19:49:50,714 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-18 19:49:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1388413625, now seen corresponding path program 5 times [2022-11-18 19:49:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:50,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172675702] [2022-11-18 19:49:50,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:51,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:51,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172675702] [2022-11-18 19:49:51,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172675702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:51,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:51,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:51,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375912990] [2022-11-18 19:49:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:51,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:51,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:51,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:51,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:51,197 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:51,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 465 transitions, 3941 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-18 19:49:51,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:51,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:51,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:54,978 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[][478], [Black: 376#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 596#(<= ~res2~0 0), Black: 366#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 618#(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: 374#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 500#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0)), 661#true, 473#true, Black: 654#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 652#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 656#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 396#(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: 390#(or (and (not (<= ~count1~0 ~count3~0)) (= ~res3~0 1)) (and (<= ~count1~0 ~count3~0) (= (+ ~res3~0 1) 0))), Black: 519#(<= ~count1~0 ~count3~0), Black: 399#(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: 529#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), 642#true, Black: 418#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 420#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 412#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 553#(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))), 364#true, Black: 550#(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))), 85#L125-2true, 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: 439#(= thread3Thread1of1ForFork2_~stop~2 0), Black: 444#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 565#(<= ~count3~0 ~count2~0), Black: 574#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 1) ~count1~0))), 410#true, Black: 317#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)), Black: 461#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 451#(or (<= ~res2~0 0) (<= 1 ~res3~0)), Black: 457#(and (or (<= ~res2~0 0) (<= 1 ~res3~0)) (<= ~count2~0 ~count1~0)), Black: 459#(and (or (<= ~res2~0 0) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 287#true, Black: 350#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0))), 447#true, Black: 353#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (<= 1 ~res3~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0))), 344#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 475#(<= ~count2~0 ~count1~0), 542#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 484#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0))), Black: 481#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), Black: 476#(or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)), 571#(and (<= ~count3~0 ~count2~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 1) ~count1~0))), Black: 620#(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))), 527#(and (<= ~count1~0 ~count3~0) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0))), Black: 608#(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: 614#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 626#(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: 616#(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)), 388#true, Black: 624#(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))]) [2022-11-18 19:49:54,978 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is not cut-off event [2022-11-18 19:49:54,978 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is not cut-off event [2022-11-18 19:49:54,978 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is not cut-off event [2022-11-18 19:49:54,978 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is not cut-off event [2022-11-18 19:49:55,026 INFO L130 PetriNetUnfolder]: 2656/16742 cut-off events. [2022-11-18 19:49:55,026 INFO L131 PetriNetUnfolder]: For 79187/81258 co-relation queries the response was YES. [2022-11-18 19:49:55,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44915 conditions, 16742 events. 2656/16742 cut-off events. For 79187/81258 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 232418 event pairs, 918 based on Foata normal form. 180/15938 useless extension candidates. Maximal degree in co-relation 44858. Up to 3456 conditions per place. [2022-11-18 19:49:55,218 INFO L137 encePairwiseOnDemand]: 293/302 looper letters, 189 selfloop transitions, 39 changer transitions 8/501 dead transitions. [2022-11-18 19:49:55,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 501 transitions, 4636 flow [2022-11-18 19:49:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:49:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:49:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1674 transitions. [2022-11-18 19:49:55,221 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7918637653736992 [2022-11-18 19:49:55,221 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1674 transitions. [2022-11-18 19:49:55,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1674 transitions. [2022-11-18 19:49:55,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:55,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1674 transitions. [2022-11-18 19:49:55,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.14285714285714) internal successors, (1674), 7 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:55,227 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-18 19:49:55,228 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-18 19:49:55,228 INFO L175 Difference]: Start difference. First operand has 368 places, 465 transitions, 3941 flow. Second operand 7 states and 1674 transitions. [2022-11-18 19:49:55,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 501 transitions, 4636 flow [2022-11-18 19:49:55,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 501 transitions, 4510 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-11-18 19:49:55,572 INFO L231 Difference]: Finished difference. Result has 367 places, 470 transitions, 3982 flow [2022-11-18 19:49:55,573 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3833, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3982, PETRI_PLACES=367, PETRI_TRANSITIONS=470} [2022-11-18 19:49:55,573 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 97 predicate places. [2022-11-18 19:49:55,573 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 470 transitions, 3982 flow [2022-11-18 19:49:55,574 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-18 19:49:55,574 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:49:55,574 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-18 19:49:55,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 19:49:55,574 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-18 19:49:55,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:55,575 INFO L85 PathProgramCache]: Analyzing trace with hash -838506953, now seen corresponding path program 6 times [2022-11-18 19:49:55,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:55,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362988916] [2022-11-18 19:49:55,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:55,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362988916] [2022-11-18 19:49:56,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362988916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:56,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:56,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:49:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385195249] [2022-11-18 19:49:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:56,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:49:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:56,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:49:56,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:56,178 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:49:56,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 470 transitions, 3982 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-18 19:49:56,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:49:56,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:49:56,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:49:59,777 INFO L130 PetriNetUnfolder]: 2672/16907 cut-off events. [2022-11-18 19:49:59,777 INFO L131 PetriNetUnfolder]: For 79465/81384 co-relation queries the response was YES. [2022-11-18 19:49:59,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45365 conditions, 16907 events. 2672/16907 cut-off events. For 79465/81384 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 234866 event pairs, 696 based on Foata normal form. 248/16240 useless extension candidates. Maximal degree in co-relation 45308. Up to 2365 conditions per place. [2022-11-18 19:49:59,974 INFO L137 encePairwiseOnDemand]: 291/302 looper letters, 214 selfloop transitions, 33 changer transitions 11/523 dead transitions. [2022-11-18 19:49:59,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 523 transitions, 4966 flow [2022-11-18 19:49:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:49:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:49:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1901 transitions. [2022-11-18 19:49:59,978 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7868377483443708 [2022-11-18 19:49:59,978 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1901 transitions. [2022-11-18 19:49:59,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1901 transitions. [2022-11-18 19:49:59,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:49:59,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1901 transitions. [2022-11-18 19:49:59,982 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-18 19:49:59,985 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-18 19:49:59,986 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-18 19:49:59,986 INFO L175 Difference]: Start difference. First operand has 367 places, 470 transitions, 3982 flow. Second operand 8 states and 1901 transitions. [2022-11-18 19:49:59,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 523 transitions, 4966 flow [2022-11-18 19:50:00,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 523 transitions, 4904 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-11-18 19:50:00,514 INFO L231 Difference]: Finished difference. Result has 373 places, 472 transitions, 4020 flow [2022-11-18 19:50:00,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3936, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4020, PETRI_PLACES=373, PETRI_TRANSITIONS=472} [2022-11-18 19:50:00,515 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 103 predicate places. [2022-11-18 19:50:00,515 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 472 transitions, 4020 flow [2022-11-18 19:50:00,516 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-18 19:50:00,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:00,516 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-18 19:50:00,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 19:50:00,517 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-18 19:50:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1829309927, now seen corresponding path program 3 times [2022-11-18 19:50:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:00,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174439481] [2022-11-18 19:50:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:50:00,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174439481] [2022-11-18 19:50:00,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174439481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:00,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:00,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 19:50:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108729121] [2022-11-18 19:50:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:00,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 19:50:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 19:50:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:50:00,941 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 302 [2022-11-18 19:50:00,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 472 transitions, 4020 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-18 19:50:00,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:00,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 302 [2022-11-18 19:50:00,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:10,679 INFO L130 PetriNetUnfolder]: 9059/41889 cut-off events. [2022-11-18 19:50:10,680 INFO L131 PetriNetUnfolder]: For 190078/193915 co-relation queries the response was YES. [2022-11-18 19:50:11,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114525 conditions, 41889 events. 9059/41889 cut-off events. For 190078/193915 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 635588 event pairs, 2354 based on Foata normal form. 686/38174 useless extension candidates. Maximal degree in co-relation 114466. Up to 6119 conditions per place. [2022-11-18 19:50:11,216 INFO L137 encePairwiseOnDemand]: 279/302 looper letters, 268 selfloop transitions, 77 changer transitions 22/671 dead transitions. [2022-11-18 19:50:11,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 671 transitions, 6711 flow [2022-11-18 19:50:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 19:50:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-18 19:50:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4187 transitions. [2022-11-18 19:50:11,221 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6932119205298013 [2022-11-18 19:50:11,221 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4187 transitions. [2022-11-18 19:50:11,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4187 transitions. [2022-11-18 19:50:11,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:11,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4187 transitions. [2022-11-18 19:50:11,226 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-18 19:50:11,230 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-18 19:50:11,231 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-18 19:50:11,231 INFO L175 Difference]: Start difference. First operand has 373 places, 472 transitions, 4020 flow. Second operand 20 states and 4187 transitions. [2022-11-18 19:50:11,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 671 transitions, 6711 flow [2022-11-18 19:50:12,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 671 transitions, 6654 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-11-18 19:50:12,735 INFO L231 Difference]: Finished difference. Result has 394 places, 509 transitions, 4627 flow [2022-11-18 19:50:12,736 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3985, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4627, PETRI_PLACES=394, PETRI_TRANSITIONS=509} [2022-11-18 19:50:12,736 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 124 predicate places. [2022-11-18 19:50:12,736 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 509 transitions, 4627 flow [2022-11-18 19:50:12,737 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-18 19:50:12,737 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:12,738 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-18 19:50:12,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 19:50:12,738 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-18 19:50:12,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash -122927118, now seen corresponding path program 1 times [2022-11-18 19:50:12,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:12,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273242184] [2022-11-18 19:50:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:13,011 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-18 19:50:13,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:13,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273242184] [2022-11-18 19:50:13,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273242184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:13,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:13,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:50:13,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997145872] [2022-11-18 19:50:13,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:13,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:50:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:13,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:50:13,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:50:13,014 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:50:13,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 509 transitions, 4627 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-18 19:50:13,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:13,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:50:13,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:50:21,045 INFO L130 PetriNetUnfolder]: 5577/33636 cut-off events. [2022-11-18 19:50:21,045 INFO L131 PetriNetUnfolder]: For 185533/193085 co-relation queries the response was YES. [2022-11-18 19:50:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97386 conditions, 33636 events. 5577/33636 cut-off events. For 185533/193085 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 520520 event pairs, 1811 based on Foata normal form. 640/32417 useless extension candidates. Maximal degree in co-relation 97317. Up to 6647 conditions per place. [2022-11-18 19:50:21,536 INFO L137 encePairwiseOnDemand]: 293/302 looper letters, 232 selfloop transitions, 33 changer transitions 6/549 dead transitions. [2022-11-18 19:50:21,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 549 transitions, 5504 flow [2022-11-18 19:50:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:50:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:50:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1675 transitions. [2022-11-18 19:50:21,539 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7923368022705771 [2022-11-18 19:50:21,539 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1675 transitions. [2022-11-18 19:50:21,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1675 transitions. [2022-11-18 19:50:21,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:50:21,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1675 transitions. [2022-11-18 19:50:21,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.28571428571428) internal successors, (1675), 7 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:50:21,542 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-18 19:50:21,543 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-18 19:50:21,543 INFO L175 Difference]: Start difference. First operand has 394 places, 509 transitions, 4627 flow. Second operand 7 states and 1675 transitions. [2022-11-18 19:50:21,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 549 transitions, 5504 flow [2022-11-18 19:50:23,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 549 transitions, 5444 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-11-18 19:50:23,068 INFO L231 Difference]: Finished difference. Result has 398 places, 511 transitions, 4727 flow [2022-11-18 19:50:23,069 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=4577, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4727, PETRI_PLACES=398, PETRI_TRANSITIONS=511} [2022-11-18 19:50:23,069 INFO L288 CegarLoopForPetriNet]: 270 programPoint places, 128 predicate places. [2022-11-18 19:50:23,069 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 511 transitions, 4727 flow [2022-11-18 19:50:23,070 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-18 19:50:23,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:50:23,070 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-18 19:50:23,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 19:50:23,071 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-18 19:50:23,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1513361687, now seen corresponding path program 1 times [2022-11-18 19:50:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:50:23,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230657914] [2022-11-18 19:50:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:50:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:23,481 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-18 19:50:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:50:23,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230657914] [2022-11-18 19:50:23,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230657914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:23,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:23,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:50:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115258728] [2022-11-18 19:50:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:23,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:50:23,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:50:23,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:50:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:50:23,488 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 302 [2022-11-18 19:50:23,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 511 transitions, 4727 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-18 19:50:23,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:50:23,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 302 [2022-11-18 19:50:23,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand