./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/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_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/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_8aac0564-6414-4273-a303-e30dfd0dbdc9/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 e9065224c0b163ad014fc0aee4009feab43ed37ef70e06d8d8f3b14d045f755a --- 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 20:27:43,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:27:43,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:27:43,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:27:43,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:27:43,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:27:43,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:27:43,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:27:43,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:27:43,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:27:43,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:27:43,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:27:43,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:27:43,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:27:43,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:27:43,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:27:43,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:27:43,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:27:43,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:27:43,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:27:43,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:27:43,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:27:43,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:27:43,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:27:43,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:27:43,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:27:43,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:27:43,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:27:43,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:27:43,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:27:43,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:27:43,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:27:43,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:27:43,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:27:43,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:27:43,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:27:43,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:27:43,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:27:43,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:27:43,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:27:43,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:27:43,752 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:27:43,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:27:43,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:27:43,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:27:43,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:27:43,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:27:43,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:27:43,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:27:43,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:27:43,775 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:27:43,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:27:43,776 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:27:43,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:27:43,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:27:43,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:27:43,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:27:43,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:27:43,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:27:43,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:27:43,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:27:43,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:27:43,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:27:43,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:27:43,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:27:43,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:27:43,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:27:43,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:27:43,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:27:43,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:27:43,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:27:43,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:27:43,779 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:27:43,780 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:27:43,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:27:43,780 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_8aac0564-6414-4273-a303-e30dfd0dbdc9/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_8aac0564-6414-4273-a303-e30dfd0dbdc9/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 -> e9065224c0b163ad014fc0aee4009feab43ed37ef70e06d8d8f3b14d045f755a [2022-11-18 20:27:44,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:27:44,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:27:44,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:27:44,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:27:44,069 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:27:44,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2022-11-18 20:27:44,136 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/data/1f4333bb4/4166d545b9a341bd9c654caada3af1ff/FLAG18b2d8bdc [2022-11-18 20:27:44,693 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:27:44,694 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2022-11-18 20:27:44,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/data/1f4333bb4/4166d545b9a341bd9c654caada3af1ff/FLAG18b2d8bdc [2022-11-18 20:27:45,022 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/data/1f4333bb4/4166d545b9a341bd9c654caada3af1ff [2022-11-18 20:27:45,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:27:45,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:27:45,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:27:45,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:27:45,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:27:45,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46535453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45, skipping insertion in model container [2022-11-18 20:27:45,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:27:45,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:27:45,302 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_8aac0564-6414-4273-a303-e30dfd0dbdc9/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2022-11-18 20:27:45,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:27:45,320 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:27:45,342 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_8aac0564-6414-4273-a303-e30dfd0dbdc9/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2022-11-18 20:27:45,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:27:45,361 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:27:45,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45 WrapperNode [2022-11-18 20:27:45,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:27:45,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:27:45,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:27:45,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:27:45,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,406 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 174 [2022-11-18 20:27:45,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:27:45,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:27:45,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:27:45,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:27:45,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,436 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:27:45,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:27:45,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:27:45,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:27:45,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (1/1) ... [2022-11-18 20:27:45,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:27:45,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:45,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:27:45,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:27:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:27:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 20:27:45,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 20:27:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 20:27:45,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 20:27:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:27:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:27:45,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:27:45,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:27:45,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:27:45,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:27:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:27:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:27:45,539 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 20:27:45,653 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:27:45,655 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:27:46,204 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:27:46,214 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:27:46,214 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:27:46,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:27:46 BoogieIcfgContainer [2022-11-18 20:27:46,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:27:46,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:27:46,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:27:46,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:27:46,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:27:45" (1/3) ... [2022-11-18 20:27:46,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39aa2907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:27:46, skipping insertion in model container [2022-11-18 20:27:46,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:27:45" (2/3) ... [2022-11-18 20:27:46,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39aa2907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:27:46, skipping insertion in model container [2022-11-18 20:27:46,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:27:46" (3/3) ... [2022-11-18 20:27:46,227 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2022-11-18 20:27:46,236 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:27:46,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:27:46,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:27:46,257 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:27:46,391 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 20:27:46,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 212 transitions, 440 flow [2022-11-18 20:27:46,579 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-11-18 20:27:46,579 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 20:27:46,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 210 events. 19/210 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 216 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 150. Up to 3 conditions per place. [2022-11-18 20:27:46,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 212 transitions, 440 flow [2022-11-18 20:27:46,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 201 transitions, 414 flow [2022-11-18 20:27:46,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:27:46,631 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;@53d63e8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:27:46,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-18 20:27:46,719 INFO L130 PetriNetUnfolder]: 19/200 cut-off events. [2022-11-18 20:27:46,719 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 20:27:46,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:46,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:27:46,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:46,730 INFO L85 PathProgramCache]: Analyzing trace with hash 492419075, now seen corresponding path program 1 times [2022-11-18 20:27:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:46,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729410935] [2022-11-18 20:27:46,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:47,114 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 20:27:47,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:47,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729410935] [2022-11-18 20:27:47,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729410935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:47,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:47,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:27:47,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002861363] [2022-11-18 20:27:47,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:47,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:27:47,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:27:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:27:47,182 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 212 [2022-11-18 20:27:47,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 201 transitions, 414 flow. Second operand has 2 states, 2 states have (on average 200.0) internal successors, (400), 2 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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 20:27:47,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:47,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 212 [2022-11-18 20:27:47,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:47,292 INFO L130 PetriNetUnfolder]: 8/190 cut-off events. [2022-11-18 20:27:47,293 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-11-18 20:27:47,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 190 events. 8/190 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 13/188 useless extension candidates. Maximal degree in co-relation 143. Up to 5 conditions per place. [2022-11-18 20:27:47,298 INFO L137 encePairwiseOnDemand]: 201/212 looper letters, 4 selfloop transitions, 0 changer transitions 5/190 dead transitions. [2022-11-18 20:27:47,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 400 flow [2022-11-18 20:27:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:27:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 20:27:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 407 transitions. [2022-11-18 20:27:47,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9599056603773585 [2022-11-18 20:27:47,328 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 407 transitions. [2022-11-18 20:27:47,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 407 transitions. [2022-11-18 20:27:47,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:47,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 407 transitions. [2022-11-18 20:27:47,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 203.5) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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 20:27:47,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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 20:27:47,355 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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 20:27:47,357 INFO L175 Difference]: Start difference. First operand has 189 places, 201 transitions, 414 flow. Second operand 2 states and 407 transitions. [2022-11-18 20:27:47,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 400 flow [2022-11-18 20:27:47,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 392 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:27:47,370 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 374 flow [2022-11-18 20:27:47,372 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=374, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2022-11-18 20:27:47,379 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2022-11-18 20:27:47,379 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 374 flow [2022-11-18 20:27:47,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 200.0) internal successors, (400), 2 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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 20:27:47,380 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:47,380 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] [2022-11-18 20:27:47,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:27:47,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:47,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:47,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1077908319, now seen corresponding path program 1 times [2022-11-18 20:27:47,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:47,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142517385] [2022-11-18 20:27:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:47,784 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 20:27:47,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142517385] [2022-11-18 20:27:47,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142517385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:47,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:47,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:27:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034758012] [2022-11-18 20:27:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:47,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:27:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:47,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:27:47,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:27:47,789 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 212 [2022-11-18 20:27:47,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 374 flow. Second operand has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states 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 20:27:47,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:47,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 212 [2022-11-18 20:27:47,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:47,959 INFO L130 PetriNetUnfolder]: 8/197 cut-off events. [2022-11-18 20:27:47,959 INFO L131 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2022-11-18 20:27:47,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 197 events. 8/197 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 235. Up to 25 conditions per place. [2022-11-18 20:27:47,965 INFO L137 encePairwiseOnDemand]: 202/212 looper letters, 28 selfloop transitions, 8 changer transitions 0/193 dead transitions. [2022-11-18 20:27:47,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 193 transitions, 462 flow [2022-11-18 20:27:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:27:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:27:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 898 transitions. [2022-11-18 20:27:47,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8471698113207548 [2022-11-18 20:27:47,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 898 transitions. [2022-11-18 20:27:47,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 898 transitions. [2022-11-18 20:27:47,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:47,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 898 transitions. [2022-11-18 20:27:47,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.6) internal successors, (898), 5 states have internal predecessors, (898), 0 states have call successors, (0), 0 states 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 20:27:47,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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 20:27:47,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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 20:27:47,980 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 374 flow. Second operand 5 states and 898 transitions. [2022-11-18 20:27:47,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 193 transitions, 462 flow [2022-11-18 20:27:47,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 193 transitions, 462 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:27:47,988 INFO L231 Difference]: Finished difference. Result has 186 places, 187 transitions, 406 flow [2022-11-18 20:27:47,989 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=186, PETRI_TRANSITIONS=187} [2022-11-18 20:27:47,989 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2022-11-18 20:27:47,990 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 187 transitions, 406 flow [2022-11-18 20:27:47,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states 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 20:27:47,991 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:47,991 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] [2022-11-18 20:27:47,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:27:47,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2006790397, now seen corresponding path program 1 times [2022-11-18 20:27:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:47,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637097371] [2022-11-18 20:27:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:27:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637097371] [2022-11-18 20:27:48,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637097371] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:48,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769133957] [2022-11-18 20:27:48,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:48,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:48,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:48,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:48,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:27:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:48,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:27:48,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:27:48,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:27:48,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769133957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:27:48,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:27:48,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-11-18 20:27:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627622886] [2022-11-18 20:27:48,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:27:48,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:27:48,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:48,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:27:48,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:27:48,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 212 [2022-11-18 20:27:48,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 187 transitions, 406 flow. Second operand has 15 states, 15 states have (on average 173.33333333333334) internal successors, (2600), 15 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states 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 20:27:48,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:48,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 212 [2022-11-18 20:27:48,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:49,099 INFO L130 PetriNetUnfolder]: 8/215 cut-off events. [2022-11-18 20:27:49,100 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-18 20:27:49,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 215 events. 8/215 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 174 event pairs, 0 based on Foata normal form. 4/211 useless extension candidates. Maximal degree in co-relation 285. Up to 19 conditions per place. [2022-11-18 20:27:49,105 INFO L137 encePairwiseOnDemand]: 196/212 looper letters, 30 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2022-11-18 20:27:49,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 207 transitions, 554 flow [2022-11-18 20:27:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:27:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:27:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1926 transitions. [2022-11-18 20:27:49,110 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259005145797599 [2022-11-18 20:27:49,110 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1926 transitions. [2022-11-18 20:27:49,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1926 transitions. [2022-11-18 20:27:49,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:49,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1926 transitions. [2022-11-18 20:27:49,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 175.0909090909091) internal successors, (1926), 11 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 20:27:49,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 212.0) internal successors, (2544), 12 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states 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 20:27:49,124 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 212.0) internal successors, (2544), 12 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states 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 20:27:49,124 INFO L175 Difference]: Start difference. First operand has 186 places, 187 transitions, 406 flow. Second operand 11 states and 1926 transitions. [2022-11-18 20:27:49,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 207 transitions, 554 flow [2022-11-18 20:27:49,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 207 transitions, 542 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:27:49,133 INFO L231 Difference]: Finished difference. Result has 196 places, 199 transitions, 505 flow [2022-11-18 20:27:49,134 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=505, PETRI_PLACES=196, PETRI_TRANSITIONS=199} [2022-11-18 20:27:49,136 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 7 predicate places. [2022-11-18 20:27:49,136 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 199 transitions, 505 flow [2022-11-18 20:27:49,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 173.33333333333334) internal successors, (2600), 15 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states 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 20:27:49,139 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:49,140 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:49,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:49,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:49,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:49,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1530331237, now seen corresponding path program 2 times [2022-11-18 20:27:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:49,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183748255] [2022-11-18 20:27:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:27:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:49,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183748255] [2022-11-18 20:27:49,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183748255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:49,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816661396] [2022-11-18 20:27:49,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:27:49,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:49,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:49,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:49,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:27:49,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:27:49,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:27:49,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:27:49,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-18 20:27:50,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:27:50,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816661396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:50,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:27:50,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-11-18 20:27:50,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773732281] [2022-11-18 20:27:50,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:50,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:50,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:50,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:27:50,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:50,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 199 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:50,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:50,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:50,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:50,389 INFO L130 PetriNetUnfolder]: 98/591 cut-off events. [2022-11-18 20:27:50,389 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-18 20:27:50,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 591 events. 98/591 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2704 event pairs, 8 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 820. Up to 70 conditions per place. [2022-11-18 20:27:50,394 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 50 selfloop transitions, 10 changer transitions 1/240 dead transitions. [2022-11-18 20:27:50,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 240 transitions, 714 flow [2022-11-18 20:27:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:27:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:27:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1503 transitions. [2022-11-18 20:27:50,398 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8862028301886793 [2022-11-18 20:27:50,399 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1503 transitions. [2022-11-18 20:27:50,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1503 transitions. [2022-11-18 20:27:50,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:50,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1503 transitions. [2022-11-18 20:27:50,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 187.875) internal successors, (1503), 8 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states 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 20:27:50,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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 20:27:50,408 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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 20:27:50,408 INFO L175 Difference]: Start difference. First operand has 196 places, 199 transitions, 505 flow. Second operand 8 states and 1503 transitions. [2022-11-18 20:27:50,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 240 transitions, 714 flow [2022-11-18 20:27:50,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 240 transitions, 697 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-18 20:27:50,416 INFO L231 Difference]: Finished difference. Result has 205 places, 206 transitions, 551 flow [2022-11-18 20:27:50,417 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=205, PETRI_TRANSITIONS=206} [2022-11-18 20:27:50,418 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 16 predicate places. [2022-11-18 20:27:50,419 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 206 transitions, 551 flow [2022-11-18 20:27:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:50,420 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:50,420 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:50,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:50,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-18 20:27:50,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -134663119, now seen corresponding path program 3 times [2022-11-18 20:27:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:50,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413161807] [2022-11-18 20:27:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:27:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:50,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413161807] [2022-11-18 20:27:50,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413161807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:50,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537117865] [2022-11-18 20:27:50,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:27:50,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:50,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:50,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:51,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:27:51,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-18 20:27:51,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:27:51,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:27:51,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-18 20:27:51,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:27:51,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537117865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:51,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:27:51,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-11-18 20:27:51,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417374979] [2022-11-18 20:27:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:51,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:51,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:51,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:27:51,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:51,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 206 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:51,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:51,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:51,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:51,830 INFO L130 PetriNetUnfolder]: 218/1283 cut-off events. [2022-11-18 20:27:51,830 INFO L131 PetriNetUnfolder]: For 151/153 co-relation queries the response was YES. [2022-11-18 20:27:51,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1283 events. 218/1283 cut-off events. For 151/153 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9050 event pairs, 4 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1822. Up to 112 conditions per place. [2022-11-18 20:27:51,840 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 53 selfloop transitions, 10 changer transitions 1/250 dead transitions. [2022-11-18 20:27:51,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 250 transitions, 775 flow [2022-11-18 20:27:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:27:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:27:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1506 transitions. [2022-11-18 20:27:51,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8879716981132075 [2022-11-18 20:27:51,845 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1506 transitions. [2022-11-18 20:27:51,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1506 transitions. [2022-11-18 20:27:51,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:51,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1506 transitions. [2022-11-18 20:27:51,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 188.25) internal successors, (1506), 8 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states 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 20:27:51,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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 20:27:51,856 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states 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 20:27:51,857 INFO L175 Difference]: Start difference. First operand has 205 places, 206 transitions, 551 flow. Second operand 8 states and 1506 transitions. [2022-11-18 20:27:51,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 250 transitions, 775 flow [2022-11-18 20:27:51,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 250 transitions, 775 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:27:51,867 INFO L231 Difference]: Finished difference. Result has 216 places, 213 transitions, 614 flow [2022-11-18 20:27:51,868 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=614, PETRI_PLACES=216, PETRI_TRANSITIONS=213} [2022-11-18 20:27:51,870 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 27 predicate places. [2022-11-18 20:27:51,871 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 213 transitions, 614 flow [2022-11-18 20:27:51,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:51,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:51,872 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:51,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:52,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:52,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:52,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash 577029655, now seen corresponding path program 4 times [2022-11-18 20:27:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:52,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323476348] [2022-11-18 20:27:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:52,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:27:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:52,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323476348] [2022-11-18 20:27:52,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323476348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:52,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853040673] [2022-11-18 20:27:52,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:27:52,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:52,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:52,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:52,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:27:52,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:27:52,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:27:52,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:27:52,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:27:52,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:27:52,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853040673] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:27:52,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:27:52,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-11-18 20:27:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637744583] [2022-11-18 20:27:52,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:27:52,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 20:27:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:52,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:27:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:27:52,885 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 212 [2022-11-18 20:27:52,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 213 transitions, 614 flow. Second operand has 22 states, 22 states have (on average 173.1818181818182) internal successors, (3810), 22 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states 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 20:27:52,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:52,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 212 [2022-11-18 20:27:52,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:53,440 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([577] thread2EXIT-->L90-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][223], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 123#L90-2true, Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-18 20:27:53,440 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-18 20:27:53,440 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-18 20:27:53,440 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 20:27:53,440 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 20:27:53,440 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([577] thread2EXIT-->L90-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][223], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), 123#L90-2true, Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-18 20:27:53,441 INFO L383 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-11-18 20:27:53,441 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-18 20:27:53,441 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-18 20:27:53,441 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 20:27:53,441 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 20:27:53,445 INFO L130 PetriNetUnfolder]: 61/633 cut-off events. [2022-11-18 20:27:53,445 INFO L131 PetriNetUnfolder]: For 137/147 co-relation queries the response was YES. [2022-11-18 20:27:53,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 633 events. 61/633 cut-off events. For 137/147 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2923 event pairs, 0 based on Foata normal form. 4/604 useless extension candidates. Maximal degree in co-relation 957. Up to 32 conditions per place. [2022-11-18 20:27:53,449 INFO L137 encePairwiseOnDemand]: 196/212 looper letters, 38 selfloop transitions, 34 changer transitions 0/241 dead transitions. [2022-11-18 20:27:53,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 241 transitions, 870 flow [2022-11-18 20:27:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:27:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-18 20:27:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2966 transitions. [2022-11-18 20:27:53,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8229744728079911 [2022-11-18 20:27:53,456 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2966 transitions. [2022-11-18 20:27:53,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2966 transitions. [2022-11-18 20:27:53,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:53,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2966 transitions. [2022-11-18 20:27:53,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 174.47058823529412) internal successors, (2966), 17 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states 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 20:27:53,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 212.0) internal successors, (3816), 18 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states 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 20:27:53,473 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 212.0) internal successors, (3816), 18 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states 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 20:27:53,473 INFO L175 Difference]: Start difference. First operand has 216 places, 213 transitions, 614 flow. Second operand 17 states and 2966 transitions. [2022-11-18 20:27:53,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 241 transitions, 870 flow [2022-11-18 20:27:53,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 241 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:27:53,479 INFO L231 Difference]: Finished difference. Result has 234 places, 227 transitions, 789 flow [2022-11-18 20:27:53,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=789, PETRI_PLACES=234, PETRI_TRANSITIONS=227} [2022-11-18 20:27:53,481 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 45 predicate places. [2022-11-18 20:27:53,481 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 227 transitions, 789 flow [2022-11-18 20:27:53,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 173.1818181818182) internal successors, (3810), 22 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states 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 20:27:53,482 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:53,483 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:53,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:53,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8aac0564-6414-4273-a303-e30dfd0dbdc9/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:53,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:53,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash 930943265, now seen corresponding path program 5 times [2022-11-18 20:27:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:53,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706618272] [2022-11-18 20:27:53,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:27:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:54,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706618272] [2022-11-18 20:27:54,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706618272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:54,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:54,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:27:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972404855] [2022-11-18 20:27:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:54,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:54,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:54,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:27:54,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:54,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 227 transitions, 789 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:54,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:54,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:54,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:54,384 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][178], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 28#L66-3true, Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-18 20:27:54,385 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:54,385 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:54,385 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:54,385 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:54,386 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][179], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))))]) [2022-11-18 20:27:54,386 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:54,386 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:54,386 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:54,386 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:54,396 INFO L130 PetriNetUnfolder]: 249/1173 cut-off events. [2022-11-18 20:27:54,396 INFO L131 PetriNetUnfolder]: For 539/569 co-relation queries the response was YES. [2022-11-18 20:27:54,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 1173 events. 249/1173 cut-off events. For 539/569 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7342 event pairs, 20 based on Foata normal form. 16/1098 useless extension candidates. Maximal degree in co-relation 2085. Up to 246 conditions per place. [2022-11-18 20:27:54,405 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 43 selfloop transitions, 14 changer transitions 0/257 dead transitions. [2022-11-18 20:27:54,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 257 transitions, 1013 flow [2022-11-18 20:27:54,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:27:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:27:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-18 20:27:54,409 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-18 20:27:54,409 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-18 20:27:54,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-18 20:27:54,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:54,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-18 20:27:54,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states 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 20:27:54,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:54,416 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:54,417 INFO L175 Difference]: Start difference. First operand has 234 places, 227 transitions, 789 flow. Second operand 6 states and 1131 transitions. [2022-11-18 20:27:54,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 257 transitions, 1013 flow [2022-11-18 20:27:54,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 257 transitions, 968 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-11-18 20:27:54,425 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 859 flow [2022-11-18 20:27:54,426 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=859, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2022-11-18 20:27:54,427 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 46 predicate places. [2022-11-18 20:27:54,428 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 859 flow [2022-11-18 20:27:54,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:54,428 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:54,429 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:54,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:27:54,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:54,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1081256451, now seen corresponding path program 6 times [2022-11-18 20:27:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:54,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057069007] [2022-11-18 20:27:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:54,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:27:54,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:54,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057069007] [2022-11-18 20:27:54,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057069007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:54,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:54,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:27:54,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180756279] [2022-11-18 20:27:54,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:54,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:54,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:54,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:54,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:27:54,720 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:54,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 235 transitions, 859 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:54,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:54,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:54,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:55,258 INFO L130 PetriNetUnfolder]: 389/2119 cut-off events. [2022-11-18 20:27:55,258 INFO L131 PetriNetUnfolder]: For 1302/1317 co-relation queries the response was YES. [2022-11-18 20:27:55,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 2119 events. 389/2119 cut-off events. For 1302/1317 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 17971 event pairs, 60 based on Foata normal form. 11/1997 useless extension candidates. Maximal degree in co-relation 3696. Up to 320 conditions per place. [2022-11-18 20:27:55,273 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 49 selfloop transitions, 17 changer transitions 0/274 dead transitions. [2022-11-18 20:27:55,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 274 transitions, 1130 flow [2022-11-18 20:27:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:27:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:27:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2022-11-18 20:27:55,277 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8946540880503144 [2022-11-18 20:27:55,277 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1138 transitions. [2022-11-18 20:27:55,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1138 transitions. [2022-11-18 20:27:55,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:55,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1138 transitions. [2022-11-18 20:27:55,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.66666666666666) internal successors, (1138), 6 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states 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 20:27:55,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:55,292 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:55,300 INFO L175 Difference]: Start difference. First operand has 235 places, 235 transitions, 859 flow. Second operand 6 states and 1138 transitions. [2022-11-18 20:27:55,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 274 transitions, 1130 flow [2022-11-18 20:27:55,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 274 transitions, 1120 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-18 20:27:55,315 INFO L231 Difference]: Finished difference. Result has 244 places, 247 transitions, 1005 flow [2022-11-18 20:27:55,315 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1005, PETRI_PLACES=244, PETRI_TRANSITIONS=247} [2022-11-18 20:27:55,317 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 55 predicate places. [2022-11-18 20:27:55,317 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 247 transitions, 1005 flow [2022-11-18 20:27:55,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:55,320 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:55,320 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:55,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:27:55,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1531833371, now seen corresponding path program 7 times [2022-11-18 20:27:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:55,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452327539] [2022-11-18 20:27:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:27:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:55,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452327539] [2022-11-18 20:27:55,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452327539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:55,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:55,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:27:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551908669] [2022-11-18 20:27:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:55,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:55,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:27:55,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:55,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 247 transitions, 1005 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:55,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:55,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:55,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:56,159 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true]) [2022-11-18 20:27:56,160 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:56,160 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:56,160 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:56,160 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:56,161 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][199], [Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0)))]) [2022-11-18 20:27:56,161 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:56,161 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:56,161 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:56,161 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:56,172 INFO L130 PetriNetUnfolder]: 423/2018 cut-off events. [2022-11-18 20:27:56,172 INFO L131 PetriNetUnfolder]: For 2031/2081 co-relation queries the response was YES. [2022-11-18 20:27:56,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 2018 events. 423/2018 cut-off events. For 2031/2081 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16336 event pairs, 54 based on Foata normal form. 31/1898 useless extension candidates. Maximal degree in co-relation 4039. Up to 438 conditions per place. [2022-11-18 20:27:56,189 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 47 selfloop transitions, 15 changer transitions 0/273 dead transitions. [2022-11-18 20:27:56,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 273 transitions, 1275 flow [2022-11-18 20:27:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:27:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:27:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2022-11-18 20:27:56,193 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8860062893081762 [2022-11-18 20:27:56,193 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2022-11-18 20:27:56,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2022-11-18 20:27:56,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:56,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2022-11-18 20:27:56,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states 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 20:27:56,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:56,201 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:56,201 INFO L175 Difference]: Start difference. First operand has 244 places, 247 transitions, 1005 flow. Second operand 6 states and 1127 transitions. [2022-11-18 20:27:56,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 273 transitions, 1275 flow [2022-11-18 20:27:56,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 273 transitions, 1249 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-11-18 20:27:56,216 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 1114 flow [2022-11-18 20:27:56,216 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1114, PETRI_PLACES=253, PETRI_TRANSITIONS=254} [2022-11-18 20:27:56,217 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 64 predicate places. [2022-11-18 20:27:56,218 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 1114 flow [2022-11-18 20:27:56,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:56,218 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:56,219 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:27:56,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash -404418835, now seen corresponding path program 8 times [2022-11-18 20:27:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10110440] [2022-11-18 20:27:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:27:56,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:56,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10110440] [2022-11-18 20:27:56,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10110440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:56,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:56,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:27:56,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077021821] [2022-11-18 20:27:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:56,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:56,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:27:56,532 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:56,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 254 transitions, 1114 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:56,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:56,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:56,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:57,095 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][194], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-18 20:27:57,096 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:57,096 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:57,096 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:57,096 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:57,096 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][199], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-18 20:27:57,097 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:57,097 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:57,097 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:57,097 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:57,107 INFO L130 PetriNetUnfolder]: 416/1942 cut-off events. [2022-11-18 20:27:57,107 INFO L131 PetriNetUnfolder]: For 2451/2522 co-relation queries the response was YES. [2022-11-18 20:27:57,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1942 events. 416/1942 cut-off events. For 2451/2522 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15363 event pairs, 44 based on Foata normal form. 36/1835 useless extension candidates. Maximal degree in co-relation 4070. Up to 447 conditions per place. [2022-11-18 20:27:57,122 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 49 selfloop transitions, 13 changer transitions 1/274 dead transitions. [2022-11-18 20:27:57,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 274 transitions, 1322 flow [2022-11-18 20:27:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:27:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:27:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1128 transitions. [2022-11-18 20:27:57,126 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8867924528301887 [2022-11-18 20:27:57,126 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1128 transitions. [2022-11-18 20:27:57,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1128 transitions. [2022-11-18 20:27:57,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:57,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1128 transitions. [2022-11-18 20:27:57,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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 20:27:57,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:57,133 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:57,133 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 1114 flow. Second operand 6 states and 1128 transitions. [2022-11-18 20:27:57,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 274 transitions, 1322 flow [2022-11-18 20:27:57,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 274 transitions, 1314 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-18 20:27:57,150 INFO L231 Difference]: Finished difference. Result has 259 places, 254 transitions, 1140 flow [2022-11-18 20:27:57,151 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1140, PETRI_PLACES=259, PETRI_TRANSITIONS=254} [2022-11-18 20:27:57,152 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 70 predicate places. [2022-11-18 20:27:57,152 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 254 transitions, 1140 flow [2022-11-18 20:27:57,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:57,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:57,153 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:57,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:27:57,153 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash 981059941, now seen corresponding path program 9 times [2022-11-18 20:27:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:57,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845923457] [2022-11-18 20:27:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:27:57,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845923457] [2022-11-18 20:27:57,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845923457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:57,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:57,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:27:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395951885] [2022-11-18 20:27:57,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:57,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:57,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:57,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:27:57,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:57,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 254 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:57,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:57,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:57,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:57,907 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3277#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-18 20:27:57,908 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:57,908 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:57,908 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:57,908 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:57,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][198], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3277#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), 3229#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), 203#true, Black: 1627#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3237#true, 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-18 20:27:57,909 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:57,909 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:57,909 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:57,909 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:57,922 INFO L130 PetriNetUnfolder]: 416/1998 cut-off events. [2022-11-18 20:27:57,922 INFO L131 PetriNetUnfolder]: For 2943/3003 co-relation queries the response was YES. [2022-11-18 20:27:57,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 1998 events. 416/1998 cut-off events. For 2943/3003 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16045 event pairs, 66 based on Foata normal form. 23/1869 useless extension candidates. Maximal degree in co-relation 4261. Up to 438 conditions per place. [2022-11-18 20:27:57,940 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 53 selfloop transitions, 9 changer transitions 2/275 dead transitions. [2022-11-18 20:27:57,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 275 transitions, 1391 flow [2022-11-18 20:27:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:27:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:27:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1123 transitions. [2022-11-18 20:27:57,944 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8828616352201258 [2022-11-18 20:27:57,944 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1123 transitions. [2022-11-18 20:27:57,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1123 transitions. [2022-11-18 20:27:57,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:57,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1123 transitions. [2022-11-18 20:27:57,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.16666666666666) internal successors, (1123), 6 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states 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 20:27:57,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:57,950 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:57,951 INFO L175 Difference]: Start difference. First operand has 259 places, 254 transitions, 1140 flow. Second operand 6 states and 1123 transitions. [2022-11-18 20:27:57,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 275 transitions, 1391 flow [2022-11-18 20:27:57,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 275 transitions, 1357 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-18 20:27:57,968 INFO L231 Difference]: Finished difference. Result has 261 places, 255 transitions, 1154 flow [2022-11-18 20:27:57,969 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1154, PETRI_PLACES=261, PETRI_TRANSITIONS=255} [2022-11-18 20:27:57,969 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 72 predicate places. [2022-11-18 20:27:57,969 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 255 transitions, 1154 flow [2022-11-18 20:27:57,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:57,970 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:57,973 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:57,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:27:57,975 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2042329695, now seen corresponding path program 10 times [2022-11-18 20:27:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:57,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745016611] [2022-11-18 20:27:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:57,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:27:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:58,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745016611] [2022-11-18 20:27:58,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745016611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:58,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:58,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:27:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434571941] [2022-11-18 20:27:58,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:58,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:58,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:58,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:58,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:27:58,246 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:58,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 255 transitions, 1154 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:58,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:58,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:58,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:58,788 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] L66-2-->L66-3: Formula: (or (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| 5)) (= v_~isNullA~0_2 0)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~isNullA~0=v_~isNullA~0_2} AuxVars[] AssignedVars[][180], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3284#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3288#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0))), Black: 3290#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, Black: 3237#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3297#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), 28#L66-3true, 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-18 20:27:58,789 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:58,789 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:58,789 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:58,789 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:58,789 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([549] L66-2-->L67: Formula: (and (< |v_thread2Thread1of1ForFork0_~i~1#1_5| 5) (not (= v_~isNullA~0_3 0))) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~isNullA~0=v_~isNullA~0_3} AuxVars[] AssignedVars[][197], [Black: 3256#(or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0))), Black: 1087#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1081#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), 2149#(and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), 1615#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0))), 3255#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3275#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3217#(and (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3211#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 3)), 61#L89-2true, Black: 1612#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0)))), Black: 1092#true, Black: 214#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1618#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)) (<= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 1511#(or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~isNullA~0 0)) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~isNullA~0 0)))), 3244#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3284#(and (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3288#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0))), Black: 3290#(and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (or (= |thread2Thread1of1ForFork0_~i~1#1| 0) (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3224#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3231#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0)))), Black: 3227#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))), Black: 2151#(and (<= |thread1Thread1of1ForFork1_~i~0#1| 0) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))), Black: 2046#(or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 2147#(and (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (not (= ~isNullB~0 0))) (and (= ~isNullB~0 0) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (or (and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= ~isNullB~0 0)) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))))), Black: 1627#true, 203#true, Black: 3237#true, 3191#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 116#L67true, 1073#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3239#(or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0))), 3283#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), Black: 3246#(and (or (not (= ~isNullB~0 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= ~isNullB~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= ~isNullB~0 0)))), Black: 3242#(and (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= ~isNullB~0 0))), 3297#(or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))), 3273#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (= ~isNullA~0 0))) (or (not (= ~isNullA~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3260#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~isNullA~0 0))) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0))))), Black: 3258#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not (= ~isNullA~0 0)))]) [2022-11-18 20:27:58,790 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-18 20:27:58,790 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:27:58,790 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-18 20:27:58,790 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:27:58,804 INFO L130 PetriNetUnfolder]: 413/1947 cut-off events. [2022-11-18 20:27:58,804 INFO L131 PetriNetUnfolder]: For 3023/3085 co-relation queries the response was YES. [2022-11-18 20:27:58,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1947 events. 413/1947 cut-off events. For 3023/3085 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15443 event pairs, 48 based on Foata normal form. 30/1832 useless extension candidates. Maximal degree in co-relation 4205. Up to 438 conditions per place. [2022-11-18 20:27:58,823 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 49 selfloop transitions, 16 changer transitions 2/278 dead transitions. [2022-11-18 20:27:58,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 278 transitions, 1403 flow [2022-11-18 20:27:58,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:27:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:27:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1130 transitions. [2022-11-18 20:27:58,827 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8883647798742138 [2022-11-18 20:27:58,827 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1130 transitions. [2022-11-18 20:27:58,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1130 transitions. [2022-11-18 20:27:58,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:58,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1130 transitions. [2022-11-18 20:27:58,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 20:27:58,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:58,833 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:58,834 INFO L175 Difference]: Start difference. First operand has 261 places, 255 transitions, 1154 flow. Second operand 6 states and 1130 transitions. [2022-11-18 20:27:58,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 278 transitions, 1403 flow [2022-11-18 20:27:58,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 278 transitions, 1386 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-18 20:27:58,852 INFO L231 Difference]: Finished difference. Result has 265 places, 257 transitions, 1212 flow [2022-11-18 20:27:58,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=265, PETRI_TRANSITIONS=257} [2022-11-18 20:27:58,854 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 76 predicate places. [2022-11-18 20:27:58,854 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 257 transitions, 1212 flow [2022-11-18 20:27:58,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:58,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:58,855 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:58,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:27:58,856 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1814160987, now seen corresponding path program 11 times [2022-11-18 20:27:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:58,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544678236] [2022-11-18 20:27:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:27:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:27:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:27:59,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:27:59,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544678236] [2022-11-18 20:27:59,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544678236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:27:59,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:27:59,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:27:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732266133] [2022-11-18 20:27:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:27:59,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:27:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:27:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:27:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:27:59,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:27:59,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 257 transitions, 1212 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:59,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:27:59,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:27:59,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:27:59,922 INFO L130 PetriNetUnfolder]: 539/2991 cut-off events. [2022-11-18 20:27:59,923 INFO L131 PetriNetUnfolder]: For 4048/4148 co-relation queries the response was YES. [2022-11-18 20:27:59,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 2991 events. 539/2991 cut-off events. For 4048/4148 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 28293 event pairs, 129 based on Foata normal form. 40/2825 useless extension candidates. Maximal degree in co-relation 6062. Up to 554 conditions per place. [2022-11-18 20:27:59,950 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 53 selfloop transitions, 18 changer transitions 0/289 dead transitions. [2022-11-18 20:27:59,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 289 transitions, 1499 flow [2022-11-18 20:27:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:27:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:27:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1135 transitions. [2022-11-18 20:27:59,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8922955974842768 [2022-11-18 20:27:59,954 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1135 transitions. [2022-11-18 20:27:59,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1135 transitions. [2022-11-18 20:27:59,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:27:59,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1135 transitions. [2022-11-18 20:27:59,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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 20:27:59,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:59,962 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:27:59,962 INFO L175 Difference]: Start difference. First operand has 265 places, 257 transitions, 1212 flow. Second operand 6 states and 1135 transitions. [2022-11-18 20:27:59,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 289 transitions, 1499 flow [2022-11-18 20:27:59,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 289 transitions, 1473 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-18 20:27:59,984 INFO L231 Difference]: Finished difference. Result has 266 places, 263 transitions, 1314 flow [2022-11-18 20:27:59,984 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=266, PETRI_TRANSITIONS=263} [2022-11-18 20:27:59,986 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 77 predicate places. [2022-11-18 20:27:59,986 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 263 transitions, 1314 flow [2022-11-18 20:27:59,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:27:59,987 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:27:59,987 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:59,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:27:59,987 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:27:59,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1202976121, now seen corresponding path program 12 times [2022-11-18 20:27:59,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:27:59,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687532535] [2022-11-18 20:27:59,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:27:59,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:00,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:00,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687532535] [2022-11-18 20:28:00,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687532535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:00,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:00,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:00,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800129296] [2022-11-18 20:28:00,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:00,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:00,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:00,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:00,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:00,237 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:00,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 263 transitions, 1314 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:00,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:00,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:00,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:01,141 INFO L130 PetriNetUnfolder]: 723/3323 cut-off events. [2022-11-18 20:28:01,141 INFO L131 PetriNetUnfolder]: For 4782/4907 co-relation queries the response was YES. [2022-11-18 20:28:01,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6973 conditions, 3323 events. 723/3323 cut-off events. For 4782/4907 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29883 event pairs, 117 based on Foata normal form. 52/3122 useless extension candidates. Maximal degree in co-relation 6932. Up to 548 conditions per place. [2022-11-18 20:28:01,172 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 47 selfloop transitions, 23 changer transitions 0/287 dead transitions. [2022-11-18 20:28:01,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 287 transitions, 1609 flow [2022-11-18 20:28:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2022-11-18 20:28:01,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8860062893081762 [2022-11-18 20:28:01,175 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2022-11-18 20:28:01,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2022-11-18 20:28:01,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:01,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2022-11-18 20:28:01,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states 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 20:28:01,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:01,182 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:01,182 INFO L175 Difference]: Start difference. First operand has 266 places, 263 transitions, 1314 flow. Second operand 6 states and 1127 transitions. [2022-11-18 20:28:01,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 287 transitions, 1609 flow [2022-11-18 20:28:01,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 287 transitions, 1600 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-18 20:28:01,206 INFO L231 Difference]: Finished difference. Result has 274 places, 268 transitions, 1450 flow [2022-11-18 20:28:01,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1450, PETRI_PLACES=274, PETRI_TRANSITIONS=268} [2022-11-18 20:28:01,208 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 85 predicate places. [2022-11-18 20:28:01,208 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 268 transitions, 1450 flow [2022-11-18 20:28:01,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:01,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:01,209 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:01,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:28:01,210 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1751939715, now seen corresponding path program 13 times [2022-11-18 20:28:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:01,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537807243] [2022-11-18 20:28:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:01,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:01,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537807243] [2022-11-18 20:28:01,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537807243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:01,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:01,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:01,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416513445] [2022-11-18 20:28:01,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:01,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:01,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:01,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:01,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:01,445 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:01,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 268 transitions, 1450 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:01,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:01,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:02,743 INFO L130 PetriNetUnfolder]: 787/4624 cut-off events. [2022-11-18 20:28:02,744 INFO L131 PetriNetUnfolder]: For 6888/7042 co-relation queries the response was YES. [2022-11-18 20:28:02,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9324 conditions, 4624 events. 787/4624 cut-off events. For 6888/7042 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 47631 event pairs, 144 based on Foata normal form. 47/4337 useless extension candidates. Maximal degree in co-relation 9279. Up to 510 conditions per place. [2022-11-18 20:28:02,788 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 56 selfloop transitions, 20 changer transitions 0/299 dead transitions. [2022-11-18 20:28:02,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 299 transitions, 1776 flow [2022-11-18 20:28:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1132 transitions. [2022-11-18 20:28:02,794 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.889937106918239 [2022-11-18 20:28:02,794 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1132 transitions. [2022-11-18 20:28:02,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1132 transitions. [2022-11-18 20:28:02,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:02,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1132 transitions. [2022-11-18 20:28:02,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states 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 20:28:02,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:02,804 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:02,804 INFO L175 Difference]: Start difference. First operand has 274 places, 268 transitions, 1450 flow. Second operand 6 states and 1132 transitions. [2022-11-18 20:28:02,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 299 transitions, 1776 flow [2022-11-18 20:28:02,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 299 transitions, 1753 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-18 20:28:02,840 INFO L231 Difference]: Finished difference. Result has 282 places, 273 transitions, 1559 flow [2022-11-18 20:28:02,841 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1559, PETRI_PLACES=282, PETRI_TRANSITIONS=273} [2022-11-18 20:28:02,841 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 93 predicate places. [2022-11-18 20:28:02,842 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 273 transitions, 1559 flow [2022-11-18 20:28:02,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:02,842 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:02,843 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:02,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:28:02,843 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1223686054, now seen corresponding path program 1 times [2022-11-18 20:28:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:02,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309241153] [2022-11-18 20:28:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:03,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:03,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309241153] [2022-11-18 20:28:03,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309241153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:03,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:03,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:03,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899610136] [2022-11-18 20:28:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:03,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:03,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:03,116 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:03,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 273 transitions, 1559 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:03,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:03,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:03,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:04,393 INFO L130 PetriNetUnfolder]: 797/4868 cut-off events. [2022-11-18 20:28:04,394 INFO L131 PetriNetUnfolder]: For 8448/8600 co-relation queries the response was YES. [2022-11-18 20:28:04,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9963 conditions, 4868 events. 797/4868 cut-off events. For 8448/8600 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 50811 event pairs, 150 based on Foata normal form. 33/4552 useless extension candidates. Maximal degree in co-relation 9914. Up to 509 conditions per place. [2022-11-18 20:28:04,432 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 65 selfloop transitions, 11 changer transitions 6/305 dead transitions. [2022-11-18 20:28:04,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 305 transitions, 1938 flow [2022-11-18 20:28:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1126 transitions. [2022-11-18 20:28:04,434 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8852201257861635 [2022-11-18 20:28:04,434 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1126 transitions. [2022-11-18 20:28:04,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1126 transitions. [2022-11-18 20:28:04,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:04,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1126 transitions. [2022-11-18 20:28:04,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.66666666666666) internal successors, (1126), 6 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states 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 20:28:04,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:04,440 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:04,440 INFO L175 Difference]: Start difference. First operand has 282 places, 273 transitions, 1559 flow. Second operand 6 states and 1126 transitions. [2022-11-18 20:28:04,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 305 transitions, 1938 flow [2022-11-18 20:28:04,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 305 transitions, 1910 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-11-18 20:28:04,478 INFO L231 Difference]: Finished difference. Result has 290 places, 274 transitions, 1591 flow [2022-11-18 20:28:04,479 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1591, PETRI_PLACES=290, PETRI_TRANSITIONS=274} [2022-11-18 20:28:04,479 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 101 predicate places. [2022-11-18 20:28:04,480 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 274 transitions, 1591 flow [2022-11-18 20:28:04,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:04,480 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:04,480 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:04,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:28:04,481 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:04,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1774146388, now seen corresponding path program 2 times [2022-11-18 20:28:04,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:04,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687225561] [2022-11-18 20:28:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:04,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:04,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687225561] [2022-11-18 20:28:04,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687225561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:04,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:04,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:04,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462143929] [2022-11-18 20:28:04,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:04,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:04,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:04,734 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:04,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 274 transitions, 1591 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:04,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:04,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:04,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:05,921 INFO L130 PetriNetUnfolder]: 779/4816 cut-off events. [2022-11-18 20:28:05,921 INFO L131 PetriNetUnfolder]: For 8635/8798 co-relation queries the response was YES. [2022-11-18 20:28:05,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9851 conditions, 4816 events. 779/4816 cut-off events. For 8635/8798 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 50306 event pairs, 108 based on Foata normal form. 53/4535 useless extension candidates. Maximal degree in co-relation 9798. Up to 509 conditions per place. [2022-11-18 20:28:05,964 INFO L137 encePairwiseOnDemand]: 201/212 looper letters, 59 selfloop transitions, 27 changer transitions 2/311 dead transitions. [2022-11-18 20:28:05,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 311 transitions, 1956 flow [2022-11-18 20:28:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1142 transitions. [2022-11-18 20:28:05,967 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8977987421383647 [2022-11-18 20:28:05,967 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1142 transitions. [2022-11-18 20:28:05,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1142 transitions. [2022-11-18 20:28:05,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:05,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1142 transitions. [2022-11-18 20:28:05,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states 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 20:28:05,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:05,975 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:05,975 INFO L175 Difference]: Start difference. First operand has 290 places, 274 transitions, 1591 flow. Second operand 6 states and 1142 transitions. [2022-11-18 20:28:05,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 311 transitions, 1956 flow [2022-11-18 20:28:06,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 311 transitions, 1934 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-18 20:28:06,021 INFO L231 Difference]: Finished difference. Result has 293 places, 281 transitions, 1753 flow [2022-11-18 20:28:06,022 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1753, PETRI_PLACES=293, PETRI_TRANSITIONS=281} [2022-11-18 20:28:06,023 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 104 predicate places. [2022-11-18 20:28:06,023 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 281 transitions, 1753 flow [2022-11-18 20:28:06,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:06,024 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:06,024 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:06,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:28:06,025 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:06,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1497634582, now seen corresponding path program 3 times [2022-11-18 20:28:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:06,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90141660] [2022-11-18 20:28:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:06,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:06,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90141660] [2022-11-18 20:28:06,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90141660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:06,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:06,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952324780] [2022-11-18 20:28:06,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:06,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:06,316 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:06,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 281 transitions, 1753 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:06,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:06,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:06,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:07,502 INFO L130 PetriNetUnfolder]: 756/4526 cut-off events. [2022-11-18 20:28:07,502 INFO L131 PetriNetUnfolder]: For 9507/9669 co-relation queries the response was YES. [2022-11-18 20:28:07,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 4526 events. 756/4526 cut-off events. For 9507/9669 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 46021 event pairs, 142 based on Foata normal form. 46/4252 useless extension candidates. Maximal degree in co-relation 9679. Up to 510 conditions per place. [2022-11-18 20:28:07,534 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 58 selfloop transitions, 21 changer transitions 5/307 dead transitions. [2022-11-18 20:28:07,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 307 transitions, 2034 flow [2022-11-18 20:28:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1134 transitions. [2022-11-18 20:28:07,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8915094339622641 [2022-11-18 20:28:07,537 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1134 transitions. [2022-11-18 20:28:07,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1134 transitions. [2022-11-18 20:28:07,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:07,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1134 transitions. [2022-11-18 20:28:07,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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 20:28:07,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:07,542 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:07,543 INFO L175 Difference]: Start difference. First operand has 293 places, 281 transitions, 1753 flow. Second operand 6 states and 1134 transitions. [2022-11-18 20:28:07,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 307 transitions, 2034 flow [2022-11-18 20:28:07,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 307 transitions, 2019 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-18 20:28:07,586 INFO L231 Difference]: Finished difference. Result has 298 places, 281 transitions, 1802 flow [2022-11-18 20:28:07,586 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1802, PETRI_PLACES=298, PETRI_TRANSITIONS=281} [2022-11-18 20:28:07,587 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 109 predicate places. [2022-11-18 20:28:07,587 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 281 transitions, 1802 flow [2022-11-18 20:28:07,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:07,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:07,588 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:07,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:28:07,588 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash 962128846, now seen corresponding path program 1 times [2022-11-18 20:28:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637400428] [2022-11-18 20:28:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:07,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:07,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637400428] [2022-11-18 20:28:07,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637400428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:07,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:07,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991675965] [2022-11-18 20:28:07,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:07,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:07,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:07,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:07,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:07,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 281 transitions, 1802 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:07,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:07,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:07,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:08,770 INFO L130 PetriNetUnfolder]: 788/4246 cut-off events. [2022-11-18 20:28:08,770 INFO L131 PetriNetUnfolder]: For 9244/9350 co-relation queries the response was YES. [2022-11-18 20:28:08,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9203 conditions, 4246 events. 788/4246 cut-off events. For 9244/9350 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 42709 event pairs, 133 based on Foata normal form. 25/3920 useless extension candidates. Maximal degree in co-relation 9146. Up to 662 conditions per place. [2022-11-18 20:28:08,803 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 60 selfloop transitions, 12 changer transitions 3/304 dead transitions. [2022-11-18 20:28:08,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 304 transitions, 2098 flow [2022-11-18 20:28:08,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1122 transitions. [2022-11-18 20:28:08,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8820754716981132 [2022-11-18 20:28:08,806 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1122 transitions. [2022-11-18 20:28:08,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1122 transitions. [2022-11-18 20:28:08,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:08,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1122 transitions. [2022-11-18 20:28:08,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states 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 20:28:08,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:08,812 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:08,812 INFO L175 Difference]: Start difference. First operand has 298 places, 281 transitions, 1802 flow. Second operand 6 states and 1122 transitions. [2022-11-18 20:28:08,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 304 transitions, 2098 flow [2022-11-18 20:28:08,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 304 transitions, 2042 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-11-18 20:28:08,855 INFO L231 Difference]: Finished difference. Result has 300 places, 282 transitions, 1803 flow [2022-11-18 20:28:08,855 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1803, PETRI_PLACES=300, PETRI_TRANSITIONS=282} [2022-11-18 20:28:08,856 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 111 predicate places. [2022-11-18 20:28:08,856 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 282 transitions, 1803 flow [2022-11-18 20:28:08,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:08,857 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:08,857 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:08,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:28:08,857 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:08,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash 74293658, now seen corresponding path program 2 times [2022-11-18 20:28:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:08,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683954871] [2022-11-18 20:28:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:08,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:09,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:09,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683954871] [2022-11-18 20:28:09,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683954871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:09,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:09,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:09,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641479902] [2022-11-18 20:28:09,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:09,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:09,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:09,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:09,104 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:09,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 282 transitions, 1803 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:09,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:09,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:09,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:10,216 INFO L130 PetriNetUnfolder]: 785/4185 cut-off events. [2022-11-18 20:28:10,216 INFO L131 PetriNetUnfolder]: For 9604/9718 co-relation queries the response was YES. [2022-11-18 20:28:10,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9243 conditions, 4185 events. 785/4185 cut-off events. For 9604/9718 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 41831 event pairs, 126 based on Foata normal form. 45/3899 useless extension candidates. Maximal degree in co-relation 9184. Up to 596 conditions per place. [2022-11-18 20:28:10,270 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 51 selfloop transitions, 24 changer transitions 2/306 dead transitions. [2022-11-18 20:28:10,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 306 transitions, 2087 flow [2022-11-18 20:28:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-18 20:28:10,273 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-18 20:28:10,273 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-18 20:28:10,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-18 20:28:10,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:10,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-18 20:28:10,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states 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 20:28:10,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:10,282 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:10,282 INFO L175 Difference]: Start difference. First operand has 300 places, 282 transitions, 1803 flow. Second operand 6 states and 1131 transitions. [2022-11-18 20:28:10,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 306 transitions, 2087 flow [2022-11-18 20:28:10,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 306 transitions, 2064 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-18 20:28:10,328 INFO L231 Difference]: Finished difference. Result has 302 places, 285 transitions, 1896 flow [2022-11-18 20:28:10,329 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1896, PETRI_PLACES=302, PETRI_TRANSITIONS=285} [2022-11-18 20:28:10,329 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 113 predicate places. [2022-11-18 20:28:10,329 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 285 transitions, 1896 flow [2022-11-18 20:28:10,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:10,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:10,330 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:10,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 20:28:10,331 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:10,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:10,331 INFO L85 PathProgramCache]: Analyzing trace with hash 273529386, now seen corresponding path program 3 times [2022-11-18 20:28:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:10,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629625263] [2022-11-18 20:28:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:10,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:10,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629625263] [2022-11-18 20:28:10,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629625263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:10,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:10,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:10,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730686491] [2022-11-18 20:28:10,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:10,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:10,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:10,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:10,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:10,573 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:10,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 285 transitions, 1896 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:10,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:10,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:10,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:11,570 INFO L130 PetriNetUnfolder]: 780/4060 cut-off events. [2022-11-18 20:28:11,571 INFO L131 PetriNetUnfolder]: For 10707/10822 co-relation queries the response was YES. [2022-11-18 20:28:11,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9253 conditions, 4060 events. 780/4060 cut-off events. For 10707/10822 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 39997 event pairs, 147 based on Foata normal form. 39/3768 useless extension candidates. Maximal degree in co-relation 9193. Up to 621 conditions per place. [2022-11-18 20:28:11,622 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 49 selfloop transitions, 20 changer transitions 4/302 dead transitions. [2022-11-18 20:28:11,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 2137 flow [2022-11-18 20:28:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1123 transitions. [2022-11-18 20:28:11,624 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8828616352201258 [2022-11-18 20:28:11,625 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1123 transitions. [2022-11-18 20:28:11,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1123 transitions. [2022-11-18 20:28:11,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:11,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1123 transitions. [2022-11-18 20:28:11,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.16666666666666) internal successors, (1123), 6 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states 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 20:28:11,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:11,630 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:11,630 INFO L175 Difference]: Start difference. First operand has 302 places, 285 transitions, 1896 flow. Second operand 6 states and 1123 transitions. [2022-11-18 20:28:11,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 2137 flow [2022-11-18 20:28:11,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 2111 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-18 20:28:11,681 INFO L231 Difference]: Finished difference. Result has 305 places, 284 transitions, 1897 flow [2022-11-18 20:28:11,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1897, PETRI_PLACES=305, PETRI_TRANSITIONS=284} [2022-11-18 20:28:11,682 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 116 predicate places. [2022-11-18 20:28:11,682 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 284 transitions, 1897 flow [2022-11-18 20:28:11,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:11,683 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:11,683 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:11,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:28:11,683 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 485639680, now seen corresponding path program 4 times [2022-11-18 20:28:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:11,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151563392] [2022-11-18 20:28:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:11,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151563392] [2022-11-18 20:28:11,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151563392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:11,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:11,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434755045] [2022-11-18 20:28:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:11,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:11,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:11,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:11,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:11,927 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:11,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 284 transitions, 1897 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:11,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:11,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:11,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:12,909 INFO L130 PetriNetUnfolder]: 726/4367 cut-off events. [2022-11-18 20:28:12,909 INFO L131 PetriNetUnfolder]: For 11639/11810 co-relation queries the response was YES. [2022-11-18 20:28:12,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9723 conditions, 4367 events. 726/4367 cut-off events. For 11639/11810 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 43915 event pairs, 207 based on Foata normal form. 40/4104 useless extension candidates. Maximal degree in co-relation 9662. Up to 830 conditions per place. [2022-11-18 20:28:12,930 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 66 selfloop transitions, 16 changer transitions 4/312 dead transitions. [2022-11-18 20:28:12,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 312 transitions, 2222 flow [2022-11-18 20:28:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2022-11-18 20:28:12,932 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8891509433962265 [2022-11-18 20:28:12,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2022-11-18 20:28:12,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2022-11-18 20:28:12,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:12,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2022-11-18 20:28:12,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states 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 20:28:12,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:12,937 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:12,938 INFO L175 Difference]: Start difference. First operand has 305 places, 284 transitions, 1897 flow. Second operand 6 states and 1131 transitions. [2022-11-18 20:28:12,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 312 transitions, 2222 flow [2022-11-18 20:28:12,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 312 transitions, 2149 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-11-18 20:28:12,989 INFO L231 Difference]: Finished difference. Result has 302 places, 284 transitions, 1861 flow [2022-11-18 20:28:12,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1861, PETRI_PLACES=302, PETRI_TRANSITIONS=284} [2022-11-18 20:28:12,990 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 113 predicate places. [2022-11-18 20:28:12,990 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 284 transitions, 1861 flow [2022-11-18 20:28:12,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:12,991 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:12,991 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:12,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:28:12,992 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1970374542, now seen corresponding path program 5 times [2022-11-18 20:28:12,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:12,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356917342] [2022-11-18 20:28:12,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:12,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:13,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356917342] [2022-11-18 20:28:13,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356917342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:13,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:13,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839557715] [2022-11-18 20:28:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:13,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:13,214 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:13,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 284 transitions, 1861 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:13,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:13,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:13,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:14,169 INFO L130 PetriNetUnfolder]: 714/4220 cut-off events. [2022-11-18 20:28:14,170 INFO L131 PetriNetUnfolder]: For 10100/10258 co-relation queries the response was YES. [2022-11-18 20:28:14,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9333 conditions, 4220 events. 714/4220 cut-off events. For 10100/10258 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 42073 event pairs, 201 based on Foata normal form. 42/3971 useless extension candidates. Maximal degree in co-relation 9274. Up to 830 conditions per place. [2022-11-18 20:28:14,201 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 63 selfloop transitions, 22 changer transitions 2/313 dead transitions. [2022-11-18 20:28:14,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 313 transitions, 2163 flow [2022-11-18 20:28:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1139 transitions. [2022-11-18 20:28:14,203 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8954402515723271 [2022-11-18 20:28:14,204 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1139 transitions. [2022-11-18 20:28:14,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1139 transitions. [2022-11-18 20:28:14,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:14,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1139 transitions. [2022-11-18 20:28:14,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states 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 20:28:14,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:14,209 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:14,209 INFO L175 Difference]: Start difference. First operand has 302 places, 284 transitions, 1861 flow. Second operand 6 states and 1139 transitions. [2022-11-18 20:28:14,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 313 transitions, 2163 flow [2022-11-18 20:28:14,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 313 transitions, 2119 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-11-18 20:28:14,261 INFO L231 Difference]: Finished difference. Result has 304 places, 286 transitions, 1915 flow [2022-11-18 20:28:14,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1915, PETRI_PLACES=304, PETRI_TRANSITIONS=286} [2022-11-18 20:28:14,262 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 115 predicate places. [2022-11-18 20:28:14,262 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 286 transitions, 1915 flow [2022-11-18 20:28:14,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:14,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:14,263 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:14,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:28:14,264 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:14,264 INFO L85 PathProgramCache]: Analyzing trace with hash -858463852, now seen corresponding path program 6 times [2022-11-18 20:28:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:14,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163412025] [2022-11-18 20:28:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:14,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:14,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:14,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163412025] [2022-11-18 20:28:14,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163412025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:14,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:14,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:28:14,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518035735] [2022-11-18 20:28:14,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:14,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:28:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:14,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:28:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:28:14,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2022-11-18 20:28:14,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 286 transitions, 1915 flow. Second operand has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:14,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:14,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2022-11-18 20:28:14,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:15,419 INFO L130 PetriNetUnfolder]: 704/4071 cut-off events. [2022-11-18 20:28:15,420 INFO L131 PetriNetUnfolder]: For 10072/10238 co-relation queries the response was YES. [2022-11-18 20:28:15,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9171 conditions, 4071 events. 704/4071 cut-off events. For 10072/10238 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 40193 event pairs, 141 based on Foata normal form. 50/3849 useless extension candidates. Maximal degree in co-relation 9111. Up to 699 conditions per place. [2022-11-18 20:28:15,461 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 59 selfloop transitions, 24 changer transitions 3/312 dead transitions. [2022-11-18 20:28:15,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 312 transitions, 2200 flow [2022-11-18 20:28:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:28:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:28:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1136 transitions. [2022-11-18 20:28:15,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8930817610062893 [2022-11-18 20:28:15,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1136 transitions. [2022-11-18 20:28:15,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1136 transitions. [2022-11-18 20:28:15,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:15,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1136 transitions. [2022-11-18 20:28:15,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states 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 20:28:15,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:15,471 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:28:15,471 INFO L175 Difference]: Start difference. First operand has 304 places, 286 transitions, 1915 flow. Second operand 6 states and 1136 transitions. [2022-11-18 20:28:15,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 312 transitions, 2200 flow [2022-11-18 20:28:15,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 312 transitions, 2175 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-18 20:28:15,526 INFO L231 Difference]: Finished difference. Result has 306 places, 285 transitions, 1920 flow [2022-11-18 20:28:15,527 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1920, PETRI_PLACES=306, PETRI_TRANSITIONS=285} [2022-11-18 20:28:15,527 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 117 predicate places. [2022-11-18 20:28:15,528 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 285 transitions, 1920 flow [2022-11-18 20:28:15,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states 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 20:28:15,528 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:15,529 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:28:15,529 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1994764753, now seen corresponding path program 1 times [2022-11-18 20:28:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:15,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476620877] [2022-11-18 20:28:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:17,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:17,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476620877] [2022-11-18 20:28:17,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476620877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:17,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:17,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:28:17,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022888389] [2022-11-18 20:28:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:17,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:28:17,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:17,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:28:17,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:28:17,082 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-18 20:28:17,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 285 transitions, 1920 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states 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 20:28:17,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:17,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-18 20:28:17,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:26,395 INFO L130 PetriNetUnfolder]: 13198/32757 cut-off events. [2022-11-18 20:28:26,395 INFO L131 PetriNetUnfolder]: For 80837/80937 co-relation queries the response was YES. [2022-11-18 20:28:26,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78403 conditions, 32757 events. 13198/32757 cut-off events. For 80837/80937 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 378463 event pairs, 4300 based on Foata normal form. 41/30313 useless extension candidates. Maximal degree in co-relation 78343. Up to 6886 conditions per place. [2022-11-18 20:28:26,682 INFO L137 encePairwiseOnDemand]: 184/212 looper letters, 276 selfloop transitions, 81 changer transitions 0/541 dead transitions. [2022-11-18 20:28:26,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 541 transitions, 4297 flow [2022-11-18 20:28:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:28:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-18 20:28:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3651 transitions. [2022-11-18 20:28:26,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7175707547169812 [2022-11-18 20:28:26,688 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3651 transitions. [2022-11-18 20:28:26,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3651 transitions. [2022-11-18 20:28:26,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:26,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3651 transitions. [2022-11-18 20:28:26,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 152.125) internal successors, (3651), 24 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states 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 20:28:26,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 212.0) internal successors, (5300), 25 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states 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 20:28:26,715 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 212.0) internal successors, (5300), 25 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states 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 20:28:26,716 INFO L175 Difference]: Start difference. First operand has 306 places, 285 transitions, 1920 flow. Second operand 24 states and 3651 transitions. [2022-11-18 20:28:26,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 541 transitions, 4297 flow [2022-11-18 20:28:27,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 541 transitions, 4207 flow, removed 2 selfloop flow, removed 8 redundant places. [2022-11-18 20:28:27,168 INFO L231 Difference]: Finished difference. Result has 332 places, 337 transitions, 2773 flow [2022-11-18 20:28:27,168 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2773, PETRI_PLACES=332, PETRI_TRANSITIONS=337} [2022-11-18 20:28:27,169 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 143 predicate places. [2022-11-18 20:28:27,169 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 337 transitions, 2773 flow [2022-11-18 20:28:27,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states 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 20:28:27,170 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:27,170 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:27,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 20:28:27,171 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 766347241, now seen corresponding path program 2 times [2022-11-18 20:28:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:27,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566361911] [2022-11-18 20:28:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:28,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:28,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566361911] [2022-11-18 20:28:28,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566361911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:28,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:28,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:28:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251879070] [2022-11-18 20:28:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:28,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:28:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:28:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:28:28,343 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-18 20:28:28,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 337 transitions, 2773 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states 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 20:28:28,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:28,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-18 20:28:28,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:40,652 INFO L130 PetriNetUnfolder]: 16968/41632 cut-off events. [2022-11-18 20:28:40,652 INFO L131 PetriNetUnfolder]: For 146468/146641 co-relation queries the response was YES. [2022-11-18 20:28:40,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120166 conditions, 41632 events. 16968/41632 cut-off events. For 146468/146641 co-relation queries the response was YES. Maximal size of possible extension queue 1477. Compared 498843 event pairs, 4557 based on Foata normal form. 80/40099 useless extension candidates. Maximal degree in co-relation 120096. Up to 7488 conditions per place. [2022-11-18 20:28:41,050 INFO L137 encePairwiseOnDemand]: 183/212 looper letters, 349 selfloop transitions, 85 changer transitions 0/618 dead transitions. [2022-11-18 20:28:41,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 618 transitions, 5868 flow [2022-11-18 20:28:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:28:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-18 20:28:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3967 transitions. [2022-11-18 20:28:41,055 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7197024673439768 [2022-11-18 20:28:41,055 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3967 transitions. [2022-11-18 20:28:41,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3967 transitions. [2022-11-18 20:28:41,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:28:41,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3967 transitions. [2022-11-18 20:28:41,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 152.57692307692307) internal successors, (3967), 26 states have internal predecessors, (3967), 0 states have call successors, (0), 0 states 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 20:28:41,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 212.0) internal successors, (5724), 27 states have internal predecessors, (5724), 0 states have call successors, (0), 0 states 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 20:28:41,071 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 212.0) internal successors, (5724), 27 states have internal predecessors, (5724), 0 states have call successors, (0), 0 states 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 20:28:41,072 INFO L175 Difference]: Start difference. First operand has 332 places, 337 transitions, 2773 flow. Second operand 26 states and 3967 transitions. [2022-11-18 20:28:41,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 618 transitions, 5868 flow [2022-11-18 20:28:41,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 618 transitions, 5757 flow, removed 40 selfloop flow, removed 9 redundant places. [2022-11-18 20:28:41,491 INFO L231 Difference]: Finished difference. Result has 363 places, 381 transitions, 3543 flow [2022-11-18 20:28:41,492 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3543, PETRI_PLACES=363, PETRI_TRANSITIONS=381} [2022-11-18 20:28:41,495 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 174 predicate places. [2022-11-18 20:28:41,495 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 381 transitions, 3543 flow [2022-11-18 20:28:41,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states 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 20:28:41,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:28:41,496 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:41,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 20:28:41,499 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:28:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash -35475851, now seen corresponding path program 3 times [2022-11-18 20:28:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:28:41,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161175300] [2022-11-18 20:28:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:28:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:28:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:28:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:28:42,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:28:42,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161175300] [2022-11-18 20:28:42,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161175300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:28:42,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:28:42,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:28:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906372614] [2022-11-18 20:28:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:28:42,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:28:42,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:28:42,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:28:42,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:28:42,848 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-18 20:28:42,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 381 transitions, 3543 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states 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 20:28:42,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:28:42,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-18 20:28:42,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:28:59,357 INFO L130 PetriNetUnfolder]: 19758/49500 cut-off events. [2022-11-18 20:28:59,359 INFO L131 PetriNetUnfolder]: For 258425/258637 co-relation queries the response was YES. [2022-11-18 20:28:59,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160553 conditions, 49500 events. 19758/49500 cut-off events. For 258425/258637 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 614741 event pairs, 8514 based on Foata normal form. 142/47504 useless extension candidates. Maximal degree in co-relation 160468. Up to 13491 conditions per place. [2022-11-18 20:29:00,048 INFO L137 encePairwiseOnDemand]: 184/212 looper letters, 322 selfloop transitions, 152 changer transitions 0/658 dead transitions. [2022-11-18 20:29:00,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 658 transitions, 7029 flow [2022-11-18 20:29:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:29:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-18 20:29:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3643 transitions. [2022-11-18 20:29:00,055 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.715998427672956 [2022-11-18 20:29:00,055 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3643 transitions. [2022-11-18 20:29:00,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3643 transitions. [2022-11-18 20:29:00,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:29:00,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3643 transitions. [2022-11-18 20:29:00,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 151.79166666666666) internal successors, (3643), 24 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states 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 20:29:00,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 212.0) internal successors, (5300), 25 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states 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 20:29:00,075 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 212.0) internal successors, (5300), 25 states have internal predecessors, (5300), 0 states have call successors, (0), 0 states 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 20:29:00,075 INFO L175 Difference]: Start difference. First operand has 363 places, 381 transitions, 3543 flow. Second operand 24 states and 3643 transitions. [2022-11-18 20:29:00,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 658 transitions, 7029 flow [2022-11-18 20:29:01,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 658 transitions, 6892 flow, removed 53 selfloop flow, removed 9 redundant places. [2022-11-18 20:29:01,283 INFO L231 Difference]: Finished difference. Result has 389 places, 441 transitions, 4981 flow [2022-11-18 20:29:01,284 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=3432, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4981, PETRI_PLACES=389, PETRI_TRANSITIONS=441} [2022-11-18 20:29:01,284 INFO L288 CegarLoopForPetriNet]: 189 programPoint places, 200 predicate places. [2022-11-18 20:29:01,284 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 441 transitions, 4981 flow [2022-11-18 20:29:01,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states 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 20:29:01,285 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:29:01,285 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:01,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 20:29:01,285 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-18 20:29:01,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash -477406195, now seen corresponding path program 4 times [2022-11-18 20:29:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:29:01,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499334890] [2022-11-18 20:29:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:01,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:29:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:29:02,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:29:02,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499334890] [2022-11-18 20:29:02,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499334890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:02,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:02,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:29:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323795911] [2022-11-18 20:29:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:02,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:29:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:29:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:29:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:29:02,846 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 212 [2022-11-18 20:29:02,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 441 transitions, 4981 flow. Second operand has 19 states, 19 states have (on average 143.47368421052633) internal successors, (2726), 19 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states 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 20:29:02,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:29:02,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 212 [2022-11-18 20:29:02,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand