./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R --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 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 --- 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-38b53e6 [2022-11-25 18:05:46,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:05:46,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:05:46,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:05:46,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:05:46,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:05:46,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:05:46,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:05:46,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:05:46,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:05:46,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:05:46,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:05:46,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:05:46,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:05:46,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:05:46,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:05:46,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:05:46,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:05:46,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:05:46,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:05:46,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:05:46,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:05:46,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:05:46,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:05:46,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:05:46,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:05:46,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:05:46,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:05:46,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:05:46,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:05:46,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:05:46,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:05:46,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:05:46,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:05:46,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:05:46,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:05:46,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:05:46,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:05:46,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:05:46,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:05:46,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:05:46,830 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:05:46,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:05:46,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:05:46,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:05:46,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:05:46,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:05:46,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:05:46,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:05:46,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:05:46,857 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:05:46,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:05:46,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:05:46,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:05:46,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:05:46,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:05:46,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:05:46,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:05:46,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:05:46,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:05:46,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:05:46,860 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:05:46,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:05:46,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:05:46,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:05:46,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:05:46,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:05:46,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:05:46,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:05:46,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:05:46,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:05:46,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:05:46,863 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:05:46,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:05:46,864 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:05:46,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:05:46,864 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/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_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R 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 -> 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 [2022-11-25 18:05:47,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:05:47,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:05:47,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:05:47,200 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:05:47,201 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:05:47,202 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2022-11-25 18:05:50,271 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:05:50,767 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:05:50,767 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2022-11-25 18:05:50,783 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/data/e3f950695/cbcd0c2faf034c0abeee3cb65e97b2f3/FLAGcfadbd1e3 [2022-11-25 18:05:50,805 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/data/e3f950695/cbcd0c2faf034c0abeee3cb65e97b2f3 [2022-11-25 18:05:50,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:05:50,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:05:50,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:05:50,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:05:50,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:05:50,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:05:50" (1/1) ... [2022-11-25 18:05:50,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764a3099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:50, skipping insertion in model container [2022-11-25 18:05:50,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:05:50" (1/1) ... [2022-11-25 18:05:50,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:05:50,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:05:51,397 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30540,30553] [2022-11-25 18:05:51,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:05:51,429 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:05:51,491 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30540,30553] [2022-11-25 18:05:51,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:05:51,531 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:05:51,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51 WrapperNode [2022-11-25 18:05:51,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:05:51,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:05:51,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:05:51,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:05:51,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,595 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2022-11-25 18:05:51,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:05:51,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:05:51,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:05:51,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:05:51,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,623 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:05:51,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:05:51,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:05:51,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:05:51,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (1/1) ... [2022-11-25 18:05:51,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:05:51,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:05:51,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:05:51,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_606959cc-9b10-4c31-81c8-8fa746776c9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:05:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:05:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-25 18:05:51,732 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-25 18:05:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:05:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:05:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:05:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:05:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:05:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:05:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:05:51,739 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:05:51,866 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:05:51,869 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:05:52,080 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:05:52,124 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:05:52,125 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:05:52,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:05:52 BoogieIcfgContainer [2022-11-25 18:05:52,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:05:52,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:05:52,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:05:52,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:05:52,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:05:50" (1/3) ... [2022-11-25 18:05:52,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f670f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:05:52, skipping insertion in model container [2022-11-25 18:05:52,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:05:51" (2/3) ... [2022-11-25 18:05:52,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f670f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:05:52, skipping insertion in model container [2022-11-25 18:05:52,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:05:52" (3/3) ... [2022-11-25 18:05:52,138 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2022-11-25 18:05:52,148 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:05:52,159 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:05:52,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:05:52,159 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:05:52,229 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:05:52,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 85 transitions, 175 flow [2022-11-25 18:05:52,396 INFO L130 PetriNetUnfolder]: 9/96 cut-off events. [2022-11-25 18:05:52,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:05:52,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 96 events. 9/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2022-11-25 18:05:52,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 85 transitions, 175 flow [2022-11-25 18:05:52,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 85 transitions, 175 flow [2022-11-25 18:05:52,428 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:05:52,454 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 85 transitions, 175 flow [2022-11-25 18:05:52,463 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 85 transitions, 175 flow [2022-11-25 18:05:52,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 85 transitions, 175 flow [2022-11-25 18:05:52,516 INFO L130 PetriNetUnfolder]: 9/96 cut-off events. [2022-11-25 18:05:52,517 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:05:52,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 96 events. 9/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2022-11-25 18:05:52,519 INFO L119 LiptonReduction]: Number of co-enabled transitions 1316 [2022-11-25 18:05:56,631 INFO L134 LiptonReduction]: Checked pairs total: 1146 [2022-11-25 18:05:56,632 INFO L136 LiptonReduction]: Total number of compositions: 92 [2022-11-25 18:05:56,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:05:56,674 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;@2dd1d0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:05:56,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-25 18:05:56,686 INFO L130 PetriNetUnfolder]: 1/9 cut-off events. [2022-11-25 18:05:56,687 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:05:56,688 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:05:56,689 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:05:56,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:05:56,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash 407281618, now seen corresponding path program 1 times [2022-11-25 18:05:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:56,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397298841] [2022-11-25 18:05:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:05:56,919 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-25 18:05:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:05:56,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397298841] [2022-11-25 18:05:56,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397298841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:05:56,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:05:56,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:05:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495493359] [2022-11-25 18:05:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:05:56,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:05:56,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:05:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:05:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:05:56,966 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 177 [2022-11-25 18:05:56,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 10 transitions, 25 flow. Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:05:56,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:05:56,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 177 [2022-11-25 18:05:56,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:05:57,020 INFO L130 PetriNetUnfolder]: 7/20 cut-off events. [2022-11-25 18:05:57,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:05:57,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 20 events. 7/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 4 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2022-11-25 18:05:57,024 INFO L137 encePairwiseOnDemand]: 175/177 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2022-11-25 18:05:57,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 35 flow [2022-11-25 18:05:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:05:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:05:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 161 transitions. [2022-11-25 18:05:57,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4548022598870056 [2022-11-25 18:05:57,045 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 161 transitions. [2022-11-25 18:05:57,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 161 transitions. [2022-11-25 18:05:57,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:05:57,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 161 transitions. [2022-11-25 18:05:57,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:05:57,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:05:57,067 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:05:57,069 INFO L175 Difference]: Start difference. First operand has 12 places, 10 transitions, 25 flow. Second operand 2 states and 161 transitions. [2022-11-25 18:05:57,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 35 flow [2022-11-25 18:05:57,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 35 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:05:57,075 INFO L231 Difference]: Finished difference. Result has 11 places, 8 transitions, 21 flow [2022-11-25 18:05:57,077 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=21, PETRI_PLACES=11, PETRI_TRANSITIONS=8} [2022-11-25 18:05:57,081 INFO L288 CegarLoopForPetriNet]: 12 programPoint places, -1 predicate places. [2022-11-25 18:05:57,082 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 8 transitions, 21 flow [2022-11-25 18:05:57,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:05:57,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:05:57,083 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-11-25 18:05:57,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:05:57,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:05:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:05:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash -259236804, now seen corresponding path program 1 times [2022-11-25 18:05:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:05:57,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228420762] [2022-11-25 18:05:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:05:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:05:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:05:57,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:05:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:05:57,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:05:57,192 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:05:57,194 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2022-11-25 18:05:57,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-11-25 18:05:57,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-11-25 18:05:57,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:05:57,200 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-25 18:05:57,211 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 18:05:57,212 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-25 18:05:57,274 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:05:57,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2022-11-25 18:05:57,365 INFO L130 PetriNetUnfolder]: 17/157 cut-off events. [2022-11-25 18:05:57,366 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 18:05:57,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 17/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 279 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 107. Up to 6 conditions per place. [2022-11-25 18:05:57,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 133 transitions, 278 flow [2022-11-25 18:05:57,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 133 transitions, 278 flow [2022-11-25 18:05:57,377 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:05:57,377 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 133 transitions, 278 flow [2022-11-25 18:05:57,379 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 133 transitions, 278 flow [2022-11-25 18:05:57,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2022-11-25 18:05:57,451 INFO L130 PetriNetUnfolder]: 17/157 cut-off events. [2022-11-25 18:05:57,451 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 18:05:57,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 17/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 279 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 107. Up to 6 conditions per place. [2022-11-25 18:05:57,461 INFO L119 LiptonReduction]: Number of co-enabled transitions 7144 [2022-11-25 18:06:01,005 INFO L134 LiptonReduction]: Checked pairs total: 9946 [2022-11-25 18:06:01,006 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-25 18:06:01,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:06:01,009 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;@2dd1d0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:06:01,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 18:06:01,013 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-11-25 18:06:01,013 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 18:06:01,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:01,014 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:06:01,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-25 18:06:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash 135001205, now seen corresponding path program 1 times [2022-11-25 18:06:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:01,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217364350] [2022-11-25 18:06:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:01,062 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-25 18:06:01,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:01,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217364350] [2022-11-25 18:06:01,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217364350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:01,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:01,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:06:01,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475118462] [2022-11-25 18:06:01,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:01,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:06:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:01,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:06:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:06:01,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 257 [2022-11-25 18:06:01,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 32 transitions, 76 flow. Second operand has 2 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:01,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 257 [2022-11-25 18:06:01,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:01,128 INFO L130 PetriNetUnfolder]: 98/222 cut-off events. [2022-11-25 18:06:01,128 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-25 18:06:01,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 222 events. 98/222 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 910 event pairs, 64 based on Foata normal form. 21/202 useless extension candidates. Maximal degree in co-relation 104. Up to 149 conditions per place. [2022-11-25 18:06:01,131 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 14 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-11-25 18:06:01,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 94 flow [2022-11-25 18:06:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:06:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:06:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2022-11-25 18:06:01,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49221789883268485 [2022-11-25 18:06:01,134 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2022-11-25 18:06:01,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2022-11-25 18:06:01,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:01,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2022-11-25 18:06:01,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,139 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,139 INFO L175 Difference]: Start difference. First operand has 29 places, 32 transitions, 76 flow. Second operand 2 states and 253 transitions. [2022-11-25 18:06:01,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 94 flow [2022-11-25 18:06:01,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-25 18:06:01,141 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2022-11-25 18:06:01,141 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2022-11-25 18:06:01,142 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-11-25 18:06:01,142 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2022-11-25 18:06:01,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,143 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:01,143 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:01,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:06:01,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-25 18:06:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1680078959, now seen corresponding path program 1 times [2022-11-25 18:06:01,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:01,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630490395] [2022-11-25 18:06:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:01,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:01,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630490395] [2022-11-25 18:06:01,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630490395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:01,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:01,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:01,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524550463] [2022-11-25 18:06:01,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:01,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:01,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:01,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:01,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:01,273 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-11-25 18:06:01,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:01,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-11-25 18:06:01,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:01,360 INFO L130 PetriNetUnfolder]: 115/243 cut-off events. [2022-11-25 18:06:01,362 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 18:06:01,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 243 events. 115/243 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1020 event pairs, 54 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 444. Up to 149 conditions per place. [2022-11-25 18:06:01,369 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 20 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-11-25 18:06:01,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 129 flow [2022-11-25 18:06:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2022-11-25 18:06:01,374 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46173800259403375 [2022-11-25 18:06:01,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2022-11-25 18:06:01,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2022-11-25 18:06:01,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:01,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2022-11-25 18:06:01,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,388 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 3 states and 356 transitions. [2022-11-25 18:06:01,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 129 flow [2022-11-25 18:06:01,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 129 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:06:01,391 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 76 flow [2022-11-25 18:06:01,391 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-11-25 18:06:01,395 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-11-25 18:06:01,395 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 76 flow [2022-11-25 18:06:01,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:01,398 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:01,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:06:01,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-25 18:06:01,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:01,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2049245249, now seen corresponding path program 1 times [2022-11-25 18:06:01,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:01,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43782318] [2022-11-25 18:06:01,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:01,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:06:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:01,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43782318] [2022-11-25 18:06:01,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43782318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:01,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:01,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311051532] [2022-11-25 18:06:01,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:01,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:01,548 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 257 [2022-11-25 18:06:01,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:01,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 257 [2022-11-25 18:06:01,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:01,669 INFO L130 PetriNetUnfolder]: 188/384 cut-off events. [2022-11-25 18:06:01,670 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-11-25 18:06:01,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 384 events. 188/384 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1774 event pairs, 80 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 786. Up to 205 conditions per place. [2022-11-25 18:06:01,673 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 26 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-11-25 18:06:01,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 161 flow [2022-11-25 18:06:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-11-25 18:06:01,675 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45525291828793774 [2022-11-25 18:06:01,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2022-11-25 18:06:01,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2022-11-25 18:06:01,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:01,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2022-11-25 18:06:01,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,680 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 76 flow. Second operand 3 states and 351 transitions. [2022-11-25 18:06:01,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 161 flow [2022-11-25 18:06:01,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 157 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:01,682 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 98 flow [2022-11-25 18:06:01,682 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2022-11-25 18:06:01,683 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-11-25 18:06:01,683 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 98 flow [2022-11-25 18:06:01,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:01,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:01,684 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-25 18:06:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:06:01,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-25 18:06:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1605199982, now seen corresponding path program 1 times [2022-11-25 18:06:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:01,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482420088] [2022-11-25 18:06:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:06:01,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:06:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:06:01,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:06:01,714 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:06:01,714 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-25 18:06:01,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-25 18:06:01,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-25 18:06:01,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-25 18:06:01,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:06:01,715 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-25 18:06:01,716 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 18:06:01,716 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-25 18:06:01,745 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:06:01,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 181 transitions, 383 flow [2022-11-25 18:06:01,781 INFO L130 PetriNetUnfolder]: 25/218 cut-off events. [2022-11-25 18:06:01,781 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 18:06:01,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 218 events. 25/218 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 523 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2022-11-25 18:06:01,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 181 transitions, 383 flow [2022-11-25 18:06:01,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 181 transitions, 383 flow [2022-11-25 18:06:01,787 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:06:01,787 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 181 transitions, 383 flow [2022-11-25 18:06:01,787 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 181 transitions, 383 flow [2022-11-25 18:06:01,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 181 transitions, 383 flow [2022-11-25 18:06:01,818 INFO L130 PetriNetUnfolder]: 25/218 cut-off events. [2022-11-25 18:06:01,819 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 18:06:01,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 218 events. 25/218 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 523 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2022-11-25 18:06:01,830 INFO L119 LiptonReduction]: Number of co-enabled transitions 17484 [2022-11-25 18:06:06,155 INFO L134 LiptonReduction]: Checked pairs total: 24972 [2022-11-25 18:06:06,155 INFO L136 LiptonReduction]: Total number of compositions: 168 [2022-11-25 18:06:06,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:06:06,158 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;@2dd1d0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:06:06,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 18:06:06,161 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-11-25 18:06:06,161 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 18:06:06,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:06,161 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:06:06,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 18:06:06,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1042627277, now seen corresponding path program 1 times [2022-11-25 18:06:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:06,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726221154] [2022-11-25 18:06:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:06,190 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-25 18:06:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:06,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726221154] [2022-11-25 18:06:06,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726221154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:06,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:06,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:06:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991793303] [2022-11-25 18:06:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:06,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:06:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:06:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:06:06,192 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 349 [2022-11-25 18:06:06,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 111 flow. Second operand has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:06,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 349 [2022-11-25 18:06:06,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:06,417 INFO L130 PetriNetUnfolder]: 798/1428 cut-off events. [2022-11-25 18:06:06,417 INFO L131 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2022-11-25 18:06:06,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 1428 events. 798/1428 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7749 event pairs, 564 based on Foata normal form. 166/1329 useless extension candidates. Maximal degree in co-relation 405. Up to 1049 conditions per place. [2022-11-25 18:06:06,428 INFO L137 encePairwiseOnDemand]: 342/349 looper letters, 20 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2022-11-25 18:06:06,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 137 flow [2022-11-25 18:06:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:06:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:06:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 343 transitions. [2022-11-25 18:06:06,430 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49140401146131807 [2022-11-25 18:06:06,430 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 343 transitions. [2022-11-25 18:06:06,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 343 transitions. [2022-11-25 18:06:06,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:06,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 343 transitions. [2022-11-25 18:06:06,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 171.5) internal successors, (343), 2 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 349.0) internal successors, (1047), 3 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,434 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 349.0) internal successors, (1047), 3 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,434 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 111 flow. Second operand 2 states and 343 transitions. [2022-11-25 18:06:06,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 137 flow [2022-11-25 18:06:06,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 131 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-25 18:06:06,438 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 91 flow [2022-11-25 18:06:06,438 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2022-11-25 18:06:06,440 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-11-25 18:06:06,440 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 91 flow [2022-11-25 18:06:06,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,441 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:06,441 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:06,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:06:06,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 18:06:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash 237607164, now seen corresponding path program 1 times [2022-11-25 18:06:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:06,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308389749] [2022-11-25 18:06:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:06,536 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-25 18:06:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:06,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308389749] [2022-11-25 18:06:06,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308389749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:06,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:06,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130198108] [2022-11-25 18:06:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:06,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:06,561 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 349 [2022-11-25 18:06:06,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:06,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 349 [2022-11-25 18:06:06,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:06,843 INFO L130 PetriNetUnfolder]: 943/1627 cut-off events. [2022-11-25 18:06:06,843 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-11-25 18:06:06,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3020 conditions, 1627 events. 943/1627 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8862 event pairs, 564 based on Foata normal form. 0/1340 useless extension candidates. Maximal degree in co-relation 3014. Up to 1049 conditions per place. [2022-11-25 18:06:06,857 INFO L137 encePairwiseOnDemand]: 346/349 looper letters, 32 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-11-25 18:06:06,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 197 flow [2022-11-25 18:06:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-11-25 18:06:06,859 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4689589302769819 [2022-11-25 18:06:06,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2022-11-25 18:06:06,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2022-11-25 18:06:06,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:06,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2022-11-25 18:06:06,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,865 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 91 flow. Second operand 3 states and 491 transitions. [2022-11-25 18:06:06,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 197 flow [2022-11-25 18:06:06,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:06:06,867 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 103 flow [2022-11-25 18:06:06,868 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-11-25 18:06:06,870 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2022-11-25 18:06:06,870 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 103 flow [2022-11-25 18:06:06,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,870 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:06,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:06,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:06:06,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 18:06:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash 997788469, now seen corresponding path program 1 times [2022-11-25 18:06:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:06,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700318538] [2022-11-25 18:06:06,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:06:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:06,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700318538] [2022-11-25 18:06:06,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700318538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:06,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:06,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:06,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889403635] [2022-11-25 18:06:06,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:06,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:06,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:06,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:06,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:06,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 349 [2022-11-25 18:06:06,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:06,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:06,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 349 [2022-11-25 18:06:06,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:07,484 INFO L130 PetriNetUnfolder]: 2141/3506 cut-off events. [2022-11-25 18:06:07,485 INFO L131 PetriNetUnfolder]: For 527/527 co-relation queries the response was YES. [2022-11-25 18:06:07,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7035 conditions, 3506 events. 2141/3506 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21325 event pairs, 978 based on Foata normal form. 0/2939 useless extension candidates. Maximal degree in co-relation 7027. Up to 2067 conditions per place. [2022-11-25 18:06:07,517 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 39 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2022-11-25 18:06:07,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 235 flow [2022-11-25 18:06:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-11-25 18:06:07,519 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46322827125119387 [2022-11-25 18:06:07,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2022-11-25 18:06:07,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2022-11-25 18:06:07,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:07,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2022-11-25 18:06:07,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:07,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:07,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:07,527 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 103 flow. Second operand 3 states and 485 transitions. [2022-11-25 18:06:07,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 235 flow [2022-11-25 18:06:07,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 231 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:07,535 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 133 flow [2022-11-25 18:06:07,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-11-25 18:06:07,537 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2022-11-25 18:06:07,537 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 133 flow [2022-11-25 18:06:07,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:07,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:07,538 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:07,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:06:07,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 18:06:07,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:07,539 INFO L85 PathProgramCache]: Analyzing trace with hash 224048210, now seen corresponding path program 1 times [2022-11-25 18:06:07,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:07,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041877359] [2022-11-25 18:06:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:06:07,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:07,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041877359] [2022-11-25 18:06:07,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041877359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:07,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:07,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989284692] [2022-11-25 18:06:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:07,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:07,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:07,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:07,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:07,619 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 349 [2022-11-25 18:06:07,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:07,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:07,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 349 [2022-11-25 18:06:07,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:08,001 INFO L130 PetriNetUnfolder]: 1460/2516 cut-off events. [2022-11-25 18:06:08,001 INFO L131 PetriNetUnfolder]: For 558/597 co-relation queries the response was YES. [2022-11-25 18:06:08,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5253 conditions, 2516 events. 1460/2516 cut-off events. For 558/597 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15109 event pairs, 880 based on Foata normal form. 0/2085 useless extension candidates. Maximal degree in co-relation 5244. Up to 1693 conditions per place. [2022-11-25 18:06:08,062 INFO L137 encePairwiseOnDemand]: 346/349 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2022-11-25 18:06:08,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 254 flow [2022-11-25 18:06:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-11-25 18:06:08,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4680038204393505 [2022-11-25 18:06:08,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2022-11-25 18:06:08,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2022-11-25 18:06:08,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:08,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2022-11-25 18:06:08,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,070 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 133 flow. Second operand 3 states and 490 transitions. [2022-11-25 18:06:08,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 254 flow [2022-11-25 18:06:08,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:06:08,074 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 135 flow [2022-11-25 18:06:08,075 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-11-25 18:06:08,078 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2022-11-25 18:06:08,078 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 135 flow [2022-11-25 18:06:08,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:08,079 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:08,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:06:08,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 18:06:08,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1078932845, now seen corresponding path program 1 times [2022-11-25 18:06:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:08,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437415521] [2022-11-25 18:06:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:06:08,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:08,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437415521] [2022-11-25 18:06:08,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437415521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:08,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:08,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708821522] [2022-11-25 18:06:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:08,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:08,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:08,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:08,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 349 [2022-11-25 18:06:08,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:08,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 349 [2022-11-25 18:06:08,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:08,893 INFO L130 PetriNetUnfolder]: 3067/5053 cut-off events. [2022-11-25 18:06:08,893 INFO L131 PetriNetUnfolder]: For 1530/1566 co-relation queries the response was YES. [2022-11-25 18:06:08,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11233 conditions, 5053 events. 3067/5053 cut-off events. For 1530/1566 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32698 event pairs, 1382 based on Foata normal form. 0/4352 useless extension candidates. Maximal degree in co-relation 11223. Up to 2827 conditions per place. [2022-11-25 18:06:08,937 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 43 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-11-25 18:06:08,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 294 flow [2022-11-25 18:06:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-11-25 18:06:08,981 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46227316141356256 [2022-11-25 18:06:08,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2022-11-25 18:06:08,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2022-11-25 18:06:08,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:08,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2022-11-25 18:06:08,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,985 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 135 flow. Second operand 3 states and 484 transitions. [2022-11-25 18:06:08,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 294 flow [2022-11-25 18:06:08,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 290 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:08,988 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 183 flow [2022-11-25 18:06:08,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-11-25 18:06:08,988 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2022-11-25 18:06:08,988 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 183 flow [2022-11-25 18:06:08,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:08,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:08,989 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-25 18:06:08,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:06:08,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-25 18:06:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1075836994, now seen corresponding path program 1 times [2022-11-25 18:06:08,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:08,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560177272] [2022-11-25 18:06:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:06:09,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:06:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:06:09,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:06:09,016 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:06:09,017 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-25 18:06:09,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-25 18:06:09,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-25 18:06:09,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-25 18:06:09,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-25 18:06:09,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:06:09,018 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-25 18:06:09,019 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 18:06:09,019 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-25 18:06:09,048 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:06:09,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 229 transitions, 490 flow [2022-11-25 18:06:09,091 INFO L130 PetriNetUnfolder]: 33/279 cut-off events. [2022-11-25 18:06:09,091 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 18:06:09,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 279 events. 33/279 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 795 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 226. Up to 10 conditions per place. [2022-11-25 18:06:09,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 229 transitions, 490 flow [2022-11-25 18:06:09,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 229 transitions, 490 flow [2022-11-25 18:06:09,098 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:06:09,098 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 229 transitions, 490 flow [2022-11-25 18:06:09,098 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 229 transitions, 490 flow [2022-11-25 18:06:09,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 229 transitions, 490 flow [2022-11-25 18:06:09,137 INFO L130 PetriNetUnfolder]: 33/279 cut-off events. [2022-11-25 18:06:09,138 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 18:06:09,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 279 events. 33/279 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 795 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 226. Up to 10 conditions per place. [2022-11-25 18:06:09,156 INFO L119 LiptonReduction]: Number of co-enabled transitions 32336 [2022-11-25 18:06:14,607 INFO L134 LiptonReduction]: Checked pairs total: 45142 [2022-11-25 18:06:14,608 INFO L136 LiptonReduction]: Total number of compositions: 211 [2022-11-25 18:06:14,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:06:14,610 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;@2dd1d0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:06:14,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 18:06:14,613 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-11-25 18:06:14,613 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 18:06:14,613 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:14,613 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:06:14,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 18:06:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash 424770028, now seen corresponding path program 1 times [2022-11-25 18:06:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:14,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980509650] [2022-11-25 18:06:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:14,634 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-25 18:06:14,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:14,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980509650] [2022-11-25 18:06:14,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980509650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:14,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:14,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:06:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685470674] [2022-11-25 18:06:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:14,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:06:14,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:14,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:06:14,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:06:14,637 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 440 [2022-11-25 18:06:14,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 148 flow. Second operand has 2 states, 2 states have (on average 201.5) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:14,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:14,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 440 [2022-11-25 18:06:14,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:15,950 INFO L130 PetriNetUnfolder]: 5548/8708 cut-off events. [2022-11-25 18:06:15,950 INFO L131 PetriNetUnfolder]: For 1921/1921 co-relation queries the response was YES. [2022-11-25 18:06:15,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16654 conditions, 8708 events. 5548/8708 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 54914 event pairs, 4064 based on Foata normal form. 1141/8209 useless extension candidates. Maximal degree in co-relation 2704. Up to 6799 conditions per place. [2022-11-25 18:06:16,045 INFO L137 encePairwiseOnDemand]: 431/440 looper letters, 26 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2022-11-25 18:06:16,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 182 flow [2022-11-25 18:06:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:06:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:06:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 433 transitions. [2022-11-25 18:06:16,048 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49204545454545456 [2022-11-25 18:06:16,048 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 433 transitions. [2022-11-25 18:06:16,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 433 transitions. [2022-11-25 18:06:16,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:16,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 433 transitions. [2022-11-25 18:06:16,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 216.5) internal successors, (433), 2 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:16,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 440.0) internal successors, (1320), 3 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:16,056 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 440.0) internal successors, (1320), 3 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:16,056 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 148 flow. Second operand 2 states and 433 transitions. [2022-11-25 18:06:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 182 flow [2022-11-25 18:06:16,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 170 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-11-25 18:06:16,063 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 118 flow [2022-11-25 18:06:16,064 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-11-25 18:06:16,065 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-11-25 18:06:16,065 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 118 flow [2022-11-25 18:06:16,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 201.5) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:16,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:16,066 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:16,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:06:16,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 18:06:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1262622909, now seen corresponding path program 1 times [2022-11-25 18:06:16,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:16,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436055330] [2022-11-25 18:06:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:16,131 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-25 18:06:16,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:16,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436055330] [2022-11-25 18:06:16,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436055330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:16,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:16,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862301267] [2022-11-25 18:06:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:16,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:16,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:16,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 440 [2022-11-25 18:06:16,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:16,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:16,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 440 [2022-11-25 18:06:16,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:17,808 INFO L130 PetriNetUnfolder]: 6593/10057 cut-off events. [2022-11-25 18:06:17,808 INFO L131 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2022-11-25 18:06:17,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18881 conditions, 10057 events. 6593/10057 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 62889 event pairs, 4064 based on Foata normal form. 0/8245 useless extension candidates. Maximal degree in co-relation 18874. Up to 6799 conditions per place. [2022-11-25 18:06:17,910 INFO L137 encePairwiseOnDemand]: 437/440 looper letters, 44 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2022-11-25 18:06:17,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 265 flow [2022-11-25 18:06:17,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2022-11-25 18:06:17,914 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47424242424242424 [2022-11-25 18:06:17,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2022-11-25 18:06:17,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2022-11-25 18:06:17,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:17,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2022-11-25 18:06:17,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:17,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:17,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:17,921 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 118 flow. Second operand 3 states and 626 transitions. [2022-11-25 18:06:17,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 265 flow [2022-11-25 18:06:17,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:06:17,925 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 130 flow [2022-11-25 18:06:17,926 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2022-11-25 18:06:17,927 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2022-11-25 18:06:17,927 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 130 flow [2022-11-25 18:06:17,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:17,928 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:17,928 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:17,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:06:17,928 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 18:06:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash -878120753, now seen corresponding path program 1 times [2022-11-25 18:06:17,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:17,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532656904] [2022-11-25 18:06:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:17,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:06:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:17,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532656904] [2022-11-25 18:06:17,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532656904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:17,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:17,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436712314] [2022-11-25 18:06:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:17,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:18,035 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 440 [2022-11-25 18:06:18,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:18,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:18,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 440 [2022-11-25 18:06:18,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:21,094 INFO L130 PetriNetUnfolder]: 19505/28188 cut-off events. [2022-11-25 18:06:21,094 INFO L131 PetriNetUnfolder]: For 3313/3313 co-relation queries the response was YES. [2022-11-25 18:06:21,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56336 conditions, 28188 events. 19505/28188 cut-off events. For 3313/3313 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 188970 event pairs, 9232 based on Foata normal form. 0/23539 useless extension candidates. Maximal degree in co-relation 56327. Up to 17885 conditions per place. [2022-11-25 18:06:21,314 INFO L137 encePairwiseOnDemand]: 433/440 looper letters, 52 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2022-11-25 18:06:21,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 309 flow [2022-11-25 18:06:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2022-11-25 18:06:21,317 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46893939393939393 [2022-11-25 18:06:21,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2022-11-25 18:06:21,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2022-11-25 18:06:21,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:21,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2022-11-25 18:06:21,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:21,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:21,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:21,324 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 130 flow. Second operand 3 states and 619 transitions. [2022-11-25 18:06:21,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 309 flow [2022-11-25 18:06:21,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 305 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:21,327 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 168 flow [2022-11-25 18:06:21,328 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2022-11-25 18:06:21,328 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2022-11-25 18:06:21,328 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 168 flow [2022-11-25 18:06:21,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:21,329 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:21,329 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:21,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:06:21,330 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 18:06:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2067357018, now seen corresponding path program 1 times [2022-11-25 18:06:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:21,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975317362] [2022-11-25 18:06:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:06:21,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:21,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975317362] [2022-11-25 18:06:21,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975317362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:21,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:21,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106132844] [2022-11-25 18:06:21,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:21,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:21,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:21,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:21,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:21,397 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 440 [2022-11-25 18:06:21,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:21,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:21,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 440 [2022-11-25 18:06:21,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:23,248 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, 25#L705-6true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,248 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 18:06:23,248 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 18:06:23,249 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 18:06:23,249 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 18:06:23,368 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, 25#L705-6true, thr1Thread4of4ForFork0InUse, 101#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,368 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,368 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,368 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 18:06:23,368 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 18:06:23,369 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 101#L718true, 181#L712true, 96#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,369 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,369 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 18:06:23,369 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,369 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 18:06:23,384 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [75#L714-1true, Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 4#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 176#L729-5true, 226#true, 212#true]) [2022-11-25 18:06:23,385 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,385 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 18:06:23,385 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,385 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 18:06:23,462 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 101#L718true, 181#L712true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,462 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,462 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,462 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,463 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 115#L718true, 4#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,464 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,464 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,464 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,464 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,474 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [75#L714-1true, Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 4#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 176#L729-5true, 226#true, 212#true]) [2022-11-25 18:06:23,474 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,474 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,474 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,474 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [75#L714-1true, Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,475 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,475 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,476 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 18:06:23,476 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,499 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, 25#L705-6true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,499 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,499 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,500 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,500 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, 4#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,535 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,535 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,535 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,535 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,545 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 115#L718true, 4#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,545 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,545 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,545 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,545 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,547 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 115#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,547 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,547 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,547 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,548 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,553 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [75#L714-1true, Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 101#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 176#L729-5true, 226#true, 212#true]) [2022-11-25 18:06:23,554 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,554 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,554 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,554 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 18:06:23,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, 25#L705-6true, thr1Thread4of4ForFork0InUse, 101#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,573 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,573 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,573 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,573 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 101#L718true, 181#L712true, 96#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,574 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,574 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,574 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,574 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,591 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [75#L714-1true, Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 4#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,591 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,591 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,591 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,592 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,597 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 4#L718true, 101#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,597 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,597 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,598 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,598 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 176#L729-5true, 226#true, 212#true]) [2022-11-25 18:06:23,598 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,598 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,599 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,599 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,605 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 115#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,605 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,606 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,606 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,606 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-11-25 18:06:23,624 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 101#L718true, 181#L712true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,624 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,624 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,624 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,624 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 115#L718true, 4#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,626 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,626 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,626 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,627 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,637 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [75#L714-1true, Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 4#L718true, 101#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,637 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,637 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,637 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,637 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,638 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [75#L714-1true, Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,638 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,638 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,638 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,638 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,642 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 101#L718true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 176#L729-5true, 212#true]) [2022-11-25 18:06:23,642 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,642 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,642 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-11-25 18:06:23,642 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 4#L718true, 101#L718true, 96#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,649 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,649 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,649 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,649 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,658 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 115#L718true, 4#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,658 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,658 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,658 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,658 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,659 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 115#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,660 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,660 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,660 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,660 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,669 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [75#L714-1true, Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 101#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,670 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,670 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,670 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 18:06:23,670 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,677 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 4#L718true, 101#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,678 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-11-25 18:06:23,678 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,678 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-11-25 18:06:23,678 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,679 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 101#L718true, 96#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,679 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-11-25 18:06:23,680 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,680 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-11-25 18:06:23,680 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,688 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 115#L718true, thr1Thread4of4ForFork0InUse, 101#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,689 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-11-25 18:06:23,689 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,689 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-11-25 18:06:23,689 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-11-25 18:06:23,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [Black: 222#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 220#true, 107#thr1EXITtrue, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 182#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 101#L718true, 168#L729-4true, Black: 217#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 226#true, 212#true]) [2022-11-25 18:06:23,696 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-11-25 18:06:23,696 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-11-25 18:06:23,696 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-11-25 18:06:23,696 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-11-25 18:06:23,704 INFO L130 PetriNetUnfolder]: 12187/18671 cut-off events. [2022-11-25 18:06:23,704 INFO L131 PetriNetUnfolder]: For 3987/4454 co-relation queries the response was YES. [2022-11-25 18:06:23,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38323 conditions, 18671 events. 12187/18671 cut-off events. For 3987/4454 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 129444 event pairs, 7107 based on Foata normal form. 0/15238 useless extension candidates. Maximal degree in co-relation 38313. Up to 12735 conditions per place. [2022-11-25 18:06:23,943 INFO L137 encePairwiseOnDemand]: 437/440 looper letters, 47 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2022-11-25 18:06:23,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 330 flow [2022-11-25 18:06:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 625 transitions. [2022-11-25 18:06:23,947 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2022-11-25 18:06:23,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 625 transitions. [2022-11-25 18:06:23,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 625 transitions. [2022-11-25 18:06:23,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:23,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 625 transitions. [2022-11-25 18:06:23,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:23,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:23,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:23,956 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 168 flow. Second operand 3 states and 625 transitions. [2022-11-25 18:06:23,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 330 flow [2022-11-25 18:06:23,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:06:23,965 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 168 flow [2022-11-25 18:06:23,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2022-11-25 18:06:23,967 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2022-11-25 18:06:23,967 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 168 flow [2022-11-25 18:06:23,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:23,968 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:23,968 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:23,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:06:23,969 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 18:06:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1288353216, now seen corresponding path program 1 times [2022-11-25 18:06:23,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:23,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242768536] [2022-11-25 18:06:23,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:23,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:06:24,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:24,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242768536] [2022-11-25 18:06:24,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242768536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:24,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:24,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219759930] [2022-11-25 18:06:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:24,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:24,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:24,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:24,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 440 [2022-11-25 18:06:24,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:24,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:24,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 440 [2022-11-25 18:06:24,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:28,963 INFO L130 PetriNetUnfolder]: 30410/44776 cut-off events. [2022-11-25 18:06:28,963 INFO L131 PetriNetUnfolder]: For 12462/13016 co-relation queries the response was YES. [2022-11-25 18:06:29,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97842 conditions, 44776 events. 30410/44776 cut-off events. For 12462/13016 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 328090 event pairs, 13963 based on Foata normal form. 40/38167 useless extension candidates. Maximal degree in co-relation 97831. Up to 27156 conditions per place. [2022-11-25 18:06:29,299 INFO L137 encePairwiseOnDemand]: 433/440 looper letters, 57 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2022-11-25 18:06:29,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 384 flow [2022-11-25 18:06:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2022-11-25 18:06:29,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4681818181818182 [2022-11-25 18:06:29,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 618 transitions. [2022-11-25 18:06:29,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 618 transitions. [2022-11-25 18:06:29,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:29,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 618 transitions. [2022-11-25 18:06:29,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:29,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:29,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:29,315 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 168 flow. Second operand 3 states and 618 transitions. [2022-11-25 18:06:29,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 384 flow [2022-11-25 18:06:29,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 380 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:29,330 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 236 flow [2022-11-25 18:06:29,330 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2022-11-25 18:06:29,331 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2022-11-25 18:06:29,331 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 236 flow [2022-11-25 18:06:29,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:29,332 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:29,332 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:29,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:06:29,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 18:06:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash -841098274, now seen corresponding path program 1 times [2022-11-25 18:06:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:29,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323012525] [2022-11-25 18:06:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 18:06:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:29,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323012525] [2022-11-25 18:06:29,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323012525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:29,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:29,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:29,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081052747] [2022-11-25 18:06:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:29,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:29,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:29,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:29,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 440 [2022-11-25 18:06:29,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:29,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:29,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 440 [2022-11-25 18:06:29,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:32,928 INFO L130 PetriNetUnfolder]: 19709/30067 cut-off events. [2022-11-25 18:06:32,928 INFO L131 PetriNetUnfolder]: For 10720/12803 co-relation queries the response was YES. [2022-11-25 18:06:33,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67135 conditions, 30067 events. 19709/30067 cut-off events. For 10720/12803 co-relation queries the response was YES. Maximal size of possible extension queue 1443. Compared 223222 event pairs, 10739 based on Foata normal form. 59/24865 useless extension candidates. Maximal degree in co-relation 67123. Up to 20744 conditions per place. [2022-11-25 18:06:33,229 INFO L137 encePairwiseOnDemand]: 437/440 looper letters, 50 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-11-25 18:06:33,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 411 flow [2022-11-25 18:06:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2022-11-25 18:06:33,232 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2022-11-25 18:06:33,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2022-11-25 18:06:33,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2022-11-25 18:06:33,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:33,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2022-11-25 18:06:33,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,239 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 236 flow. Second operand 3 states and 624 transitions. [2022-11-25 18:06:33,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 411 flow [2022-11-25 18:06:33,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:06:33,262 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 230 flow [2022-11-25 18:06:33,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2022-11-25 18:06:33,263 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2022-11-25 18:06:33,263 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 230 flow [2022-11-25 18:06:33,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:33,264 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:33,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:06:33,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 18:06:33,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:33,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1268159966, now seen corresponding path program 1 times [2022-11-25 18:06:33,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:33,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075888062] [2022-11-25 18:06:33,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:33,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 18:06:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:33,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075888062] [2022-11-25 18:06:33,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075888062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:33,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:33,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:33,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221205906] [2022-11-25 18:06:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:33,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:33,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:33,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:33,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:33,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 440 [2022-11-25 18:06:33,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:33,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 440 [2022-11-25 18:06:33,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:41,055 INFO L130 PetriNetUnfolder]: 45946/67342 cut-off events. [2022-11-25 18:06:41,055 INFO L131 PetriNetUnfolder]: For 34367/35906 co-relation queries the response was YES. [2022-11-25 18:06:41,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161402 conditions, 67342 events. 45946/67342 cut-off events. For 34367/35906 co-relation queries the response was YES. Maximal size of possible extension queue 3014. Compared 511800 event pairs, 20692 based on Foata normal form. 0/58275 useless extension candidates. Maximal degree in co-relation 161389. Up to 40135 conditions per place. [2022-11-25 18:06:41,526 INFO L137 encePairwiseOnDemand]: 433/440 looper letters, 63 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2022-11-25 18:06:41,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 503 flow [2022-11-25 18:06:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2022-11-25 18:06:41,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4674242424242424 [2022-11-25 18:06:41,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 617 transitions. [2022-11-25 18:06:41,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 617 transitions. [2022-11-25 18:06:41,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:41,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 617 transitions. [2022-11-25 18:06:41,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:41,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:41,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:41,537 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 230 flow. Second operand 3 states and 617 transitions. [2022-11-25 18:06:41,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 503 flow [2022-11-25 18:06:41,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 499 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:41,581 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 352 flow [2022-11-25 18:06:41,581 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2022-11-25 18:06:41,582 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2022-11-25 18:06:41,582 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 352 flow [2022-11-25 18:06:41,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:41,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:41,583 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:41,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:06:41,583 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-25 18:06:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1238848956, now seen corresponding path program 1 times [2022-11-25 18:06:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524393806] [2022-11-25 18:06:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:41,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:06:41,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:06:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:06:41,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:06:41,613 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:06:41,613 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-25 18:06:41,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 18:06:41,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-11-25 18:06:41,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-25 18:06:41,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-25 18:06:41,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 18:06:41,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:06:41,615 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:41,616 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 18:06:41,616 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-11-25 18:06:41,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:06:41,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 277 transitions, 599 flow [2022-11-25 18:06:41,721 INFO L130 PetriNetUnfolder]: 41/340 cut-off events. [2022-11-25 18:06:41,721 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-25 18:06:41,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 340 events. 41/340 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1057 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 292. Up to 12 conditions per place. [2022-11-25 18:06:41,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 277 transitions, 599 flow [2022-11-25 18:06:41,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 277 transitions, 599 flow [2022-11-25 18:06:41,732 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:06:41,732 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 277 transitions, 599 flow [2022-11-25 18:06:41,733 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 277 transitions, 599 flow [2022-11-25 18:06:41,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 277 transitions, 599 flow [2022-11-25 18:06:41,794 INFO L130 PetriNetUnfolder]: 41/340 cut-off events. [2022-11-25 18:06:41,794 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-25 18:06:41,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 340 events. 41/340 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1057 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 292. Up to 12 conditions per place. [2022-11-25 18:06:41,822 INFO L119 LiptonReduction]: Number of co-enabled transitions 51700 [2022-11-25 18:06:48,452 INFO L134 LiptonReduction]: Checked pairs total: 73546 [2022-11-25 18:06:48,453 INFO L136 LiptonReduction]: Total number of compositions: 255 [2022-11-25 18:06:48,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:06:48,455 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;@2dd1d0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:06:48,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 18:06:48,458 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-11-25 18:06:48,458 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 18:06:48,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:48,458 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:06:48,459 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-25 18:06:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 401039240, now seen corresponding path program 1 times [2022-11-25 18:06:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:48,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060408232] [2022-11-25 18:06:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:48,476 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-25 18:06:48,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:48,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060408232] [2022-11-25 18:06:48,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060408232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:48,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:48,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:06:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685879771] [2022-11-25 18:06:48,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:48,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:06:48,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:48,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:06:48,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:06:48,479 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 532 [2022-11-25 18:06:48,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 187 flow. Second operand has 2 states, 2 states have (on average 242.5) internal successors, (485), 2 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:48,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:48,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 532 [2022-11-25 18:06:48,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:54,244 INFO L130 PetriNetUnfolder]: 35548/51358 cut-off events. [2022-11-25 18:06:54,245 INFO L131 PetriNetUnfolder]: For 15196/15196 co-relation queries the response was YES. [2022-11-25 18:06:54,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100155 conditions, 51358 events. 35548/51358 cut-off events. For 15196/15196 co-relation queries the response was YES. Maximal size of possible extension queue 1891. Compared 354951 event pairs, 26564 based on Foata normal form. 7266/48859 useless extension candidates. Maximal degree in co-relation 16904. Up to 41799 conditions per place. [2022-11-25 18:06:54,679 INFO L137 encePairwiseOnDemand]: 521/532 looper letters, 32 selfloop transitions, 0 changer transitions 0/60 dead transitions. [2022-11-25 18:06:54,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 229 flow [2022-11-25 18:06:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:06:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:06:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 523 transitions. [2022-11-25 18:06:54,682 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49154135338345867 [2022-11-25 18:06:54,682 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 523 transitions. [2022-11-25 18:06:54,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 523 transitions. [2022-11-25 18:06:54,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:54,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 523 transitions. [2022-11-25 18:06:54,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 261.5) internal successors, (523), 2 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:54,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 532.0) internal successors, (1596), 3 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:54,689 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 532.0) internal successors, (1596), 3 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:54,689 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 187 flow. Second operand 2 states and 523 transitions. [2022-11-25 18:06:54,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 229 flow [2022-11-25 18:06:54,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 209 flow, removed 10 selfloop flow, removed 0 redundant places. [2022-11-25 18:06:54,713 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 145 flow [2022-11-25 18:06:54,713 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2022-11-25 18:06:54,714 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2022-11-25 18:06:54,714 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 145 flow [2022-11-25 18:06:54,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 242.5) internal successors, (485), 2 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:54,715 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:54,715 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:54,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 18:06:54,716 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-25 18:06:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1325284421, now seen corresponding path program 1 times [2022-11-25 18:06:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:54,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196860705] [2022-11-25 18:06:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:54,760 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-25 18:06:54,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:54,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196860705] [2022-11-25 18:06:54,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196860705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:54,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:54,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:54,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077678948] [2022-11-25 18:06:54,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:54,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:54,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:54,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:54,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:54,779 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 532 [2022-11-25 18:06:54,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:54,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:54,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 532 [2022-11-25 18:06:54,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:01,398 INFO L130 PetriNetUnfolder]: 42513/59385 cut-off events. [2022-11-25 18:07:01,398 INFO L131 PetriNetUnfolder]: For 2558/2558 co-relation queries the response was YES. [2022-11-25 18:07:01,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112860 conditions, 59385 events. 42513/59385 cut-off events. For 2558/2558 co-relation queries the response was YES. Maximal size of possible extension queue 2126. Compared 396267 event pairs, 22020 based on Foata normal form. 0/48278 useless extension candidates. Maximal degree in co-relation 112852. Up to 41799 conditions per place. [2022-11-25 18:07:01,844 INFO L137 encePairwiseOnDemand]: 529/532 looper letters, 56 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2022-11-25 18:07:01,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 333 flow [2022-11-25 18:07:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:07:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:07:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2022-11-25 18:07:01,846 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4768170426065163 [2022-11-25 18:07:01,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 761 transitions. [2022-11-25 18:07:01,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 761 transitions. [2022-11-25 18:07:01,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:01,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 761 transitions. [2022-11-25 18:07:01,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:01,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 532.0) internal successors, (2128), 4 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:01,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 532.0) internal successors, (2128), 4 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:01,854 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 145 flow. Second operand 3 states and 761 transitions. [2022-11-25 18:07:01,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 333 flow [2022-11-25 18:07:01,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:07:01,857 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 157 flow [2022-11-25 18:07:01,857 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2022-11-25 18:07:01,858 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2022-11-25 18:07:01,858 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 157 flow [2022-11-25 18:07:01,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:01,859 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:01,859 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:01,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 18:07:01,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-25 18:07:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1635214870, now seen corresponding path program 1 times [2022-11-25 18:07:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:07:01,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755825182] [2022-11-25 18:07:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:07:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:07:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:01,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755825182] [2022-11-25 18:07:01,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755825182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:01,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:01,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:07:01,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782391701] [2022-11-25 18:07:01,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:01,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:07:01,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:01,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:07:01,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:07:01,971 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 532 [2022-11-25 18:07:01,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:01,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:01,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 532 [2022-11-25 18:07:01,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand