./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ --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 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a --- 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-dbf71c6-m [2022-10-17 10:23:21,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:23:21,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:23:21,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:23:21,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:23:21,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:23:21,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:23:21,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:23:21,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:23:21,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:23:21,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:23:21,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:23:21,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:23:21,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:23:21,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:23:21,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:23:21,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:23:21,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:23:21,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:23:21,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:23:21,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:23:21,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:23:21,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:23:21,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:23:21,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:23:21,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:23:21,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:23:21,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:23:21,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:23:21,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:23:21,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:23:21,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:23:21,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:23:21,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:23:21,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:23:21,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:23:21,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:23:21,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:23:21,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:23:21,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:23:21,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:23:21,739 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:23:21,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:23:21,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:23:21,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:23:21,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:23:21,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:23:21,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:23:21,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:23:21,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:23:21,794 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:23:21,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:23:21,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:23:21,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:23:21,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:23:21,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:23:21,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:23:21,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:23:21,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:23:21,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:23:21,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:23:21,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:23:21,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:23:21,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:23:21,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:23:21,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:23:21,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:23:21,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:23:21,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:23:21,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:23:21,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:23:21,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:23:21,800 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:23:21,800 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:23:21,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:23:21,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/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_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ 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 -> 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a [2022-10-17 10:23:22,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:23:22,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:23:22,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:23:22,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:23:22,116 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:23:22,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-10-17 10:23:22,185 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/data/934e90044/9967411c45304b8a93e2840dfd33bd3d/FLAGbd27a92c1 [2022-10-17 10:23:22,715 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:23:22,716 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-10-17 10:23:22,731 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/data/934e90044/9967411c45304b8a93e2840dfd33bd3d/FLAGbd27a92c1 [2022-10-17 10:23:23,075 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/data/934e90044/9967411c45304b8a93e2840dfd33bd3d [2022-10-17 10:23:23,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:23:23,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:23:23,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:23:23,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:23:23,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:23:23,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@512199a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23, skipping insertion in model container [2022-10-17 10:23:23,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:23:23,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:23:23,355 WARN L230 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_fec4277e-b374-4c2d-8dd8-114041cd645a/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-10-17 10:23:23,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:23:23,367 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:23:23,390 WARN L230 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_fec4277e-b374-4c2d-8dd8-114041cd645a/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-10-17 10:23:23,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:23:23,406 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:23:23,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23 WrapperNode [2022-10-17 10:23:23,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:23:23,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:23:23,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:23:23,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:23:23,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,448 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-10-17 10:23:23,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:23:23,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:23:23,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:23:23,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:23:23,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,475 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:23:23,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:23:23,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:23:23,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:23:23,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (1/1) ... [2022-10-17 10:23:23,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:23:23,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:23,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:23:23,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:23:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:23:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-10-17 10:23:23,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-10-17 10:23:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-10-17 10:23:23,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-10-17 10:23:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-10-17 10:23:23,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-10-17 10:23:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:23:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:23:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:23:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:23:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:23:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:23:23,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:23:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 10:23:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:23:23,586 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:23:23,751 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:23:23,756 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:23:24,030 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:23:24,119 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:23:24,125 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-17 10:23:24,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:23:24 BoogieIcfgContainer [2022-10-17 10:23:24,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:23:24,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:23:24,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:23:24,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:23:24,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:23:23" (1/3) ... [2022-10-17 10:23:24,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7b7759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:23:24, skipping insertion in model container [2022-10-17 10:23:24,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:23" (2/3) ... [2022-10-17 10:23:24,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7b7759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:23:24, skipping insertion in model container [2022-10-17 10:23:24,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:23:24" (3/3) ... [2022-10-17 10:23:24,142 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-10-17 10:23:24,157 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:23:24,166 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:23:24,167 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-17 10:23:24,167 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:23:24,231 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-10-17 10:23:24,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-10-17 10:23:24,385 INFO L130 PetriNetUnfolder]: 7/106 cut-off events. [2022-10-17 10:23:24,390 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-10-17 10:23:24,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 7/106 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-10-17 10:23:24,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 242 flow [2022-10-17 10:23:24,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 208 flow [2022-10-17 10:23:24,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:23:24,457 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;@62761eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:23:24,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-17 10:23:24,533 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2022-10-17 10:23:24,536 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-10-17 10:23:24,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:24,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:24,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash -865060603, now seen corresponding path program 1 times [2022-10-17 10:23:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:24,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875962869] [2022-10-17 10:23:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:25,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875962869] [2022-10-17 10:23:25,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875962869] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:25,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:25,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:23:25,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638529854] [2022-10-17 10:23:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:25,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:23:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:23:25,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:23:25,705 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-10-17 10:23:25,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:25,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:25,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-10-17 10:23:25,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:26,011 INFO L130 PetriNetUnfolder]: 105/322 cut-off events. [2022-10-17 10:23:26,012 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-10-17 10:23:26,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 322 events. 105/322 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1269 event pairs, 13 based on Foata normal form. 15/309 useless extension candidates. Maximal degree in co-relation 436. Up to 71 conditions per place. [2022-10-17 10:23:26,020 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 34 selfloop transitions, 6 changer transitions 1/109 dead transitions. [2022-10-17 10:23:26,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 327 flow [2022-10-17 10:23:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:23:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-10-17 10:23:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions. [2022-10-17 10:23:26,045 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8165137614678899 [2022-10-17 10:23:26,046 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 534 transitions. [2022-10-17 10:23:26,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions. [2022-10-17 10:23:26,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:26,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions. [2022-10-17 10:23:26,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,070 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,072 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 208 flow. Second operand 6 states and 534 transitions. [2022-10-17 10:23:26,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 327 flow [2022-10-17 10:23:26,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 309 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-10-17 10:23:26,083 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 213 flow [2022-10-17 10:23:26,085 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2022-10-17 10:23:26,089 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2022-10-17 10:23:26,090 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 213 flow [2022-10-17 10:23:26,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:26,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:26,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:23:26,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1188549913, now seen corresponding path program 2 times [2022-10-17 10:23:26,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:26,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041561887] [2022-10-17 10:23:26,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:26,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041561887] [2022-10-17 10:23:26,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041561887] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:26,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:26,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:23:26,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311818635] [2022-10-17 10:23:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:26,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:23:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:26,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:23:26,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:23:26,406 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-10-17 10:23:26,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:26,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-10-17 10:23:26,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:26,622 INFO L130 PetriNetUnfolder]: 95/285 cut-off events. [2022-10-17 10:23:26,622 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-10-17 10:23:26,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 285 events. 95/285 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1031 event pairs, 2 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 262. Up to 71 conditions per place. [2022-10-17 10:23:26,628 INFO L137 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2022-10-17 10:23:26,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 339 flow [2022-10-17 10:23:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:23:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-10-17 10:23:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-10-17 10:23:26,632 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8042813455657493 [2022-10-17 10:23:26,632 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2022-10-17 10:23:26,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2022-10-17 10:23:26,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:26,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2022-10-17 10:23:26,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,638 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 213 flow. Second operand 6 states and 526 transitions. [2022-10-17 10:23:26,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 339 flow [2022-10-17 10:23:26,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 330 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:23:26,644 INFO L231 Difference]: Finished difference. Result has 102 places, 96 transitions, 243 flow [2022-10-17 10:23:26,645 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=102, PETRI_TRANSITIONS=96} [2022-10-17 10:23:26,646 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2022-10-17 10:23:26,646 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 243 flow [2022-10-17 10:23:26,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:26,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:26,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:23:26,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2012930813, now seen corresponding path program 3 times [2022-10-17 10:23:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:26,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403052822] [2022-10-17 10:23:26,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:26,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403052822] [2022-10-17 10:23:26,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403052822] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:26,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:26,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:23:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530522203] [2022-10-17 10:23:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:26,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:23:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:23:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:23:26,991 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-10-17 10:23:26,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 96 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:26,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:26,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-10-17 10:23:26,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:27,154 INFO L130 PetriNetUnfolder]: 99/292 cut-off events. [2022-10-17 10:23:27,155 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-10-17 10:23:27,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 292 events. 99/292 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1050 event pairs, 2 based on Foata normal form. 3/271 useless extension candidates. Maximal degree in co-relation 301. Up to 71 conditions per place. [2022-10-17 10:23:27,161 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2022-10-17 10:23:27,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 114 transitions, 379 flow [2022-10-17 10:23:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:23:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:23:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-10-17 10:23:27,164 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-10-17 10:23:27,166 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-10-17 10:23:27,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-10-17 10:23:27,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:27,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-10-17 10:23:27,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,172 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,172 INFO L175 Difference]: Start difference. First operand has 102 places, 96 transitions, 243 flow. Second operand 7 states and 612 transitions. [2022-10-17 10:23:27,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 114 transitions, 379 flow [2022-10-17 10:23:27,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 114 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:23:27,180 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 273 flow [2022-10-17 10:23:27,180 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2022-10-17 10:23:27,183 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2022-10-17 10:23:27,183 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 273 flow [2022-10-17 10:23:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:27,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:27,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:23:27,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 881553717, now seen corresponding path program 4 times [2022-10-17 10:23:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:27,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667638700] [2022-10-17 10:23:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:27,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667638700] [2022-10-17 10:23:27,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667638700] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:27,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:27,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:23:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507147692] [2022-10-17 10:23:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:27,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:23:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:27,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:23:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:23:27,476 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-10-17 10:23:27,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:27,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-10-17 10:23:27,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:27,644 INFO L130 PetriNetUnfolder]: 114/363 cut-off events. [2022-10-17 10:23:27,644 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-10-17 10:23:27,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 363 events. 114/363 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1559 event pairs, 14 based on Foata normal form. 5/342 useless extension candidates. Maximal degree in co-relation 400. Up to 63 conditions per place. [2022-10-17 10:23:27,648 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2022-10-17 10:23:27,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 415 flow [2022-10-17 10:23:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:23:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:23:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-10-17 10:23:27,651 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-10-17 10:23:27,651 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-10-17 10:23:27,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-10-17 10:23:27,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:27,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-10-17 10:23:27,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,657 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,658 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 273 flow. Second operand 7 states and 612 transitions. [2022-10-17 10:23:27,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 415 flow [2022-10-17 10:23:27,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 402 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-10-17 10:23:27,663 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 301 flow [2022-10-17 10:23:27,664 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2022-10-17 10:23:27,665 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 13 predicate places. [2022-10-17 10:23:27,665 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 301 flow [2022-10-17 10:23:27,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:27,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:27,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:23:27,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1556043023, now seen corresponding path program 5 times [2022-10-17 10:23:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:27,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207829198] [2022-10-17 10:23:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:27,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:27,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:27,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207829198] [2022-10-17 10:23:27,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207829198] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:27,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:27,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:23:27,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716383917] [2022-10-17 10:23:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:27,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:23:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:23:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:23:27,923 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-10-17 10:23:27,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 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-10-17 10:23:27,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:27,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-10-17 10:23:27,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:28,204 INFO L130 PetriNetUnfolder]: 264/720 cut-off events. [2022-10-17 10:23:28,204 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-10-17 10:23:28,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 720 events. 264/720 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4109 event pairs, 32 based on Foata normal form. 8/667 useless extension candidates. Maximal degree in co-relation 1126. Up to 179 conditions per place. [2022-10-17 10:23:28,212 INFO L137 encePairwiseOnDemand]: 98/109 looper letters, 36 selfloop transitions, 7 changer transitions 38/148 dead transitions. [2022-10-17 10:23:28,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 148 transitions, 660 flow [2022-10-17 10:23:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:23:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:23:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2022-10-17 10:23:28,215 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.799184505606524 [2022-10-17 10:23:28,215 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2022-10-17 10:23:28,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2022-10-17 10:23:28,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:28,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2022-10-17 10:23:28,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.11111111111111) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,221 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,222 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 301 flow. Second operand 9 states and 784 transitions. [2022-10-17 10:23:28,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 148 transitions, 660 flow [2022-10-17 10:23:28,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 148 transitions, 644 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-10-17 10:23:28,229 INFO L231 Difference]: Finished difference. Result has 120 places, 101 transitions, 333 flow [2022-10-17 10:23:28,229 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=120, PETRI_TRANSITIONS=101} [2022-10-17 10:23:28,230 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 22 predicate places. [2022-10-17 10:23:28,230 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 101 transitions, 333 flow [2022-10-17 10:23:28,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 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-10-17 10:23:28,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:28,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:28,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:23:28,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1039507564, now seen corresponding path program 1 times [2022-10-17 10:23:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:28,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28365148] [2022-10-17 10:23:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:28,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28365148] [2022-10-17 10:23:28,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28365148] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:28,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:28,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:23:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132669112] [2022-10-17 10:23:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:28,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:23:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:28,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:23:28,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:23:28,502 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-10-17 10:23:28,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 101 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:28,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-10-17 10:23:28,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:28,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][80], [72#L96true, 83#L57true, Black: 154#true, 56#L115-4true, Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 167#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 141#true, Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 172#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 19#L83true, Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 188#true, Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:28,607 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,608 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,608 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,608 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,625 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][80], [72#L96true, 83#L57true, Black: 154#true, 56#L115-4true, Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 167#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 141#true, Black: 172#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 19#L83true, Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 188#true, Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:28,625 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,625 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,626 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,626 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,626 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-10-17 10:23:28,652 INFO L130 PetriNetUnfolder]: 98/393 cut-off events. [2022-10-17 10:23:28,652 INFO L131 PetriNetUnfolder]: For 479/488 co-relation queries the response was YES. [2022-10-17 10:23:28,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 393 events. 98/393 cut-off events. For 479/488 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1722 event pairs, 2 based on Foata normal form. 11/367 useless extension candidates. Maximal degree in co-relation 721. Up to 89 conditions per place. [2022-10-17 10:23:28,659 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 21 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2022-10-17 10:23:28,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 110 transitions, 419 flow [2022-10-17 10:23:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:23:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-10-17 10:23:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-10-17 10:23:28,662 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8532110091743119 [2022-10-17 10:23:28,663 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2022-10-17 10:23:28,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2022-10-17 10:23:28,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:28,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2022-10-17 10:23:28,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,667 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,667 INFO L175 Difference]: Start difference. First operand has 120 places, 101 transitions, 333 flow. Second operand 5 states and 465 transitions. [2022-10-17 10:23:28,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 110 transitions, 419 flow [2022-10-17 10:23:28,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 403 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-10-17 10:23:28,675 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 342 flow [2022-10-17 10:23:28,676 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2022-10-17 10:23:28,678 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2022-10-17 10:23:28,679 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 342 flow [2022-10-17 10:23:28,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:28,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:28,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:23:28,680 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash 351082327, now seen corresponding path program 1 times [2022-10-17 10:23:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:28,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938262324] [2022-10-17 10:23:28,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:28,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:29,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:29,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938262324] [2022-10-17 10:23:29,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938262324] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:29,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:29,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:23:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437283] [2022-10-17 10:23:29,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:29,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:23:29,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:29,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:23:29,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:23:29,078 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-10-17 10:23:29,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:29,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-10-17 10:23:29,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:29,584 INFO L130 PetriNetUnfolder]: 412/1150 cut-off events. [2022-10-17 10:23:29,584 INFO L131 PetriNetUnfolder]: For 1383/1447 co-relation queries the response was YES. [2022-10-17 10:23:29,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 1150 events. 412/1150 cut-off events. For 1383/1447 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7370 event pairs, 46 based on Foata normal form. 13/1047 useless extension candidates. Maximal degree in co-relation 2008. Up to 332 conditions per place. [2022-10-17 10:23:29,599 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 48 selfloop transitions, 10 changer transitions 30/153 dead transitions. [2022-10-17 10:23:29,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 153 transitions, 809 flow [2022-10-17 10:23:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:23:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:23:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 922 transitions. [2022-10-17 10:23:29,603 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7689741451209341 [2022-10-17 10:23:29,603 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 922 transitions. [2022-10-17 10:23:29,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 922 transitions. [2022-10-17 10:23:29,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:29,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 922 transitions. [2022-10-17 10:23:29,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.81818181818181) internal successors, (922), 11 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,611 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,611 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 342 flow. Second operand 11 states and 922 transitions. [2022-10-17 10:23:29,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 153 transitions, 809 flow [2022-10-17 10:23:29,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 153 transitions, 797 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:23:29,620 INFO L231 Difference]: Finished difference. Result has 129 places, 106 transitions, 410 flow [2022-10-17 10:23:29,620 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=410, PETRI_PLACES=129, PETRI_TRANSITIONS=106} [2022-10-17 10:23:29,621 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 31 predicate places. [2022-10-17 10:23:29,621 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 106 transitions, 410 flow [2022-10-17 10:23:29,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:29,623 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:29,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:23:29,624 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1555529728, now seen corresponding path program 1 times [2022-10-17 10:23:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:29,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634442734] [2022-10-17 10:23:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:29,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:29,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634442734] [2022-10-17 10:23:29,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634442734] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:29,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602507163] [2022-10-17 10:23:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:29,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:29,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:29,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:23:29,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 10:23:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:30,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-17 10:23:30,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:23:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:30,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:23:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:30,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602507163] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:23:30,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:23:30,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-10-17 10:23:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916848216] [2022-10-17 10:23:30,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:23:30,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-17 10:23:30,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:30,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-17 10:23:30,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-10-17 10:23:30,393 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-10-17 10:23:30,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 106 transitions, 410 flow. Second operand has 14 states, 14 states have (on average 81.85714285714286) internal successors, (1146), 14 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:30,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:30,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-10-17 10:23:30,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:31,283 INFO L130 PetriNetUnfolder]: 725/1948 cut-off events. [2022-10-17 10:23:31,283 INFO L131 PetriNetUnfolder]: For 4218/4301 co-relation queries the response was YES. [2022-10-17 10:23:31,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 1948 events. 725/1948 cut-off events. For 4218/4301 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14575 event pairs, 14 based on Foata normal form. 20/1800 useless extension candidates. Maximal degree in co-relation 5291. Up to 334 conditions per place. [2022-10-17 10:23:31,310 INFO L137 encePairwiseOnDemand]: 95/109 looper letters, 66 selfloop transitions, 37 changer transitions 78/248 dead transitions. [2022-10-17 10:23:31,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 248 transitions, 1729 flow [2022-10-17 10:23:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-17 10:23:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-10-17 10:23:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1807 transitions. [2022-10-17 10:23:31,317 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7894276976845784 [2022-10-17 10:23:31,317 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1807 transitions. [2022-10-17 10:23:31,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1807 transitions. [2022-10-17 10:23:31,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:31,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1807 transitions. [2022-10-17 10:23:31,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.04761904761905) internal successors, (1807), 21 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:31,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:31,331 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:31,331 INFO L175 Difference]: Start difference. First operand has 129 places, 106 transitions, 410 flow. Second operand 21 states and 1807 transitions. [2022-10-17 10:23:31,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 248 transitions, 1729 flow [2022-10-17 10:23:31,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 248 transitions, 1636 flow, removed 38 selfloop flow, removed 8 redundant places. [2022-10-17 10:23:31,353 INFO L231 Difference]: Finished difference. Result has 150 places, 131 transitions, 743 flow [2022-10-17 10:23:31,353 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=743, PETRI_PLACES=150, PETRI_TRANSITIONS=131} [2022-10-17 10:23:31,354 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 52 predicate places. [2022-10-17 10:23:31,354 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 131 transitions, 743 flow [2022-10-17 10:23:31,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.85714285714286) internal successors, (1146), 14 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:31,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:31,356 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:31,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:23:31,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:31,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1195515545, now seen corresponding path program 2 times [2022-10-17 10:23:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:31,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260160444] [2022-10-17 10:23:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 10:23:31,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:31,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260160444] [2022-10-17 10:23:31,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260160444] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:31,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539094518] [2022-10-17 10:23:31,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-17 10:23:31,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:31,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:31,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:23:31,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 10:23:31,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-17 10:23:31,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:23:31,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-17 10:23:31,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:23:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:32,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:23:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 10:23:32,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539094518] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:23:32,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:23:32,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-10-17 10:23:32,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865152985] [2022-10-17 10:23:32,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:23:32,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 10:23:32,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:32,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 10:23:32,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:23:32,098 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-10-17 10:23:32,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 131 transitions, 743 flow. Second operand has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:32,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:32,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-10-17 10:23:32,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:32,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][148], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 766#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 229#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 192#(<= ~c1~0 0), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 764#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 752#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 56#L115-4true, Black: 762#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 894#(= ~c1~0 0), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:32,421 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-10-17 10:23:32,422 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-10-17 10:23:32,422 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-10-17 10:23:32,422 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-10-17 10:23:32,473 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][128], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 766#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 229#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 764#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 752#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 762#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:32,474 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-10-17 10:23:32,474 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:32,474 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:32,474 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:32,476 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][106], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 766#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 229#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 192#(<= ~c1~0 0), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 764#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 752#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 56#L115-4true, Black: 762#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 786#(<= ~c1~0 1), Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:32,476 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-10-17 10:23:32,476 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:32,476 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:32,476 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:32,506 INFO L130 PetriNetUnfolder]: 493/1518 cut-off events. [2022-10-17 10:23:32,506 INFO L131 PetriNetUnfolder]: For 7621/7750 co-relation queries the response was YES. [2022-10-17 10:23:32,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 1518 events. 493/1518 cut-off events. For 7621/7750 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10723 event pairs, 14 based on Foata normal form. 45/1395 useless extension candidates. Maximal degree in co-relation 5209. Up to 363 conditions per place. [2022-10-17 10:23:32,538 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 84 selfloop transitions, 20 changer transitions 0/192 dead transitions. [2022-10-17 10:23:32,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 192 transitions, 1506 flow [2022-10-17 10:23:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:23:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:23:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2022-10-17 10:23:32,541 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2022-10-17 10:23:32,541 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2022-10-17 10:23:32,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2022-10-17 10:23:32,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:32,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2022-10-17 10:23:32,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:32,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:32,547 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:32,547 INFO L175 Difference]: Start difference. First operand has 150 places, 131 transitions, 743 flow. Second operand 7 states and 658 transitions. [2022-10-17 10:23:32,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 192 transitions, 1506 flow [2022-10-17 10:23:32,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 192 transitions, 1296 flow, removed 102 selfloop flow, removed 8 redundant places. [2022-10-17 10:23:32,587 INFO L231 Difference]: Finished difference. Result has 141 places, 143 transitions, 866 flow [2022-10-17 10:23:32,588 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=866, PETRI_PLACES=141, PETRI_TRANSITIONS=143} [2022-10-17 10:23:32,589 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 43 predicate places. [2022-10-17 10:23:32,589 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 143 transitions, 866 flow [2022-10-17 10:23:32,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:32,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:32,590 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:32,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-17 10:23:32,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:32,806 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1555698558, now seen corresponding path program 1 times [2022-10-17 10:23:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:32,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563541282] [2022-10-17 10:23:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:33,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563541282] [2022-10-17 10:23:33,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563541282] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:33,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569003818] [2022-10-17 10:23:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:33,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:33,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:33,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:23:33,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-17 10:23:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:33,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-17 10:23:33,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:23:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:33,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:23:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 10:23:33,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569003818] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:33,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-17 10:23:33,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 16 [2022-10-17 10:23:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388251187] [2022-10-17 10:23:33,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:33,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:23:33,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:23:33,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-10-17 10:23:33,686 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-10-17 10:23:33,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 143 transitions, 866 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:33,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:33,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-10-17 10:23:33,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:33,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][113], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, Black: 786#(<= ~c1~0 1), Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:33,950 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-10-17 10:23:33,950 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:33,950 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:33,950 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:33,969 INFO L130 PetriNetUnfolder]: 370/1273 cut-off events. [2022-10-17 10:23:33,970 INFO L131 PetriNetUnfolder]: For 5509/5567 co-relation queries the response was YES. [2022-10-17 10:23:33,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4031 conditions, 1273 events. 370/1273 cut-off events. For 5509/5567 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8543 event pairs, 14 based on Foata normal form. 64/1192 useless extension candidates. Maximal degree in co-relation 3744. Up to 369 conditions per place. [2022-10-17 10:23:33,992 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 49 selfloop transitions, 11 changer transitions 0/148 dead transitions. [2022-10-17 10:23:33,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 148 transitions, 998 flow [2022-10-17 10:23:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:23:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-10-17 10:23:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-10-17 10:23:33,995 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8513761467889909 [2022-10-17 10:23:33,995 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 464 transitions. [2022-10-17 10:23:33,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 464 transitions. [2022-10-17 10:23:33,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:33,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 464 transitions. [2022-10-17 10:23:33,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:33,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:33,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:33,999 INFO L175 Difference]: Start difference. First operand has 141 places, 143 transitions, 866 flow. Second operand 5 states and 464 transitions. [2022-10-17 10:23:33,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 148 transitions, 998 flow [2022-10-17 10:23:34,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 148 transitions, 952 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-10-17 10:23:34,024 INFO L231 Difference]: Finished difference. Result has 142 places, 136 transitions, 777 flow [2022-10-17 10:23:34,047 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=777, PETRI_PLACES=142, PETRI_TRANSITIONS=136} [2022-10-17 10:23:34,048 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 44 predicate places. [2022-10-17 10:23:34,048 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 136 transitions, 777 flow [2022-10-17 10:23:34,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:34,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:34,048 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:34,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-17 10:23:34,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-17 10:23:34,257 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1076316002, now seen corresponding path program 1 times [2022-10-17 10:23:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:34,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536670670] [2022-10-17 10:23:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 10:23:34,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:34,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536670670] [2022-10-17 10:23:34,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536670670] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:34,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942003391] [2022-10-17 10:23:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:34,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:34,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:23:34,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-17 10:23:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:34,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-17 10:23:34,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:23:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:34,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:23:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 10:23:34,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942003391] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:23:34,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:23:34,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 11 [2022-10-17 10:23:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58714996] [2022-10-17 10:23:34,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:23:34,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:23:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:34,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:23:34,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:23:34,827 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2022-10-17 10:23:34,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 136 transitions, 777 flow. Second operand has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:34,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:34,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2022-10-17 10:23:34,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:35,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][189], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1683#(<= ~c2~0 0), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 786#(<= ~c1~0 1), 17#L46true, Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:35,483 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-10-17 10:23:35,483 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:35,483 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:35,483 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:35,548 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][168], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1683#(<= ~c2~0 0), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 786#(<= ~c1~0 1), 17#L46true, Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 1885#true, Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:35,549 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,549 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,549 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,549 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,553 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][189], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 786#(<= ~c1~0 1), Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1683#(<= ~c2~0 0), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:35,554 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,554 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,554 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,554 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,558 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][189], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 192#(<= ~c1~0 0), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 786#(<= ~c1~0 1), 17#L46true, Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:35,558 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-10-17 10:23:35,558 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:35,558 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:35,558 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:35,559 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-10-17 10:23:35,589 INFO L130 PetriNetUnfolder]: 759/2658 cut-off events. [2022-10-17 10:23:35,589 INFO L131 PetriNetUnfolder]: For 13576/13922 co-relation queries the response was YES. [2022-10-17 10:23:35,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 2658 events. 759/2658 cut-off events. For 13576/13922 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 22109 event pairs, 5 based on Foata normal form. 115/2456 useless extension candidates. Maximal degree in co-relation 8615. Up to 542 conditions per place. [2022-10-17 10:23:35,639 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 80 selfloop transitions, 48 changer transitions 0/211 dead transitions. [2022-10-17 10:23:35,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 211 transitions, 1736 flow [2022-10-17 10:23:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:23:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:23:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 995 transitions. [2022-10-17 10:23:35,643 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8298582151793161 [2022-10-17 10:23:35,643 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 995 transitions. [2022-10-17 10:23:35,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 995 transitions. [2022-10-17 10:23:35,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:35,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 995 transitions. [2022-10-17 10:23:35,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,652 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,653 INFO L175 Difference]: Start difference. First operand has 142 places, 136 transitions, 777 flow. Second operand 11 states and 995 transitions. [2022-10-17 10:23:35,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 211 transitions, 1736 flow [2022-10-17 10:23:35,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 211 transitions, 1695 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-10-17 10:23:35,708 INFO L231 Difference]: Finished difference. Result has 154 places, 171 transitions, 1334 flow [2022-10-17 10:23:35,708 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1334, PETRI_PLACES=154, PETRI_TRANSITIONS=171} [2022-10-17 10:23:35,709 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 56 predicate places. [2022-10-17 10:23:35,709 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 171 transitions, 1334 flow [2022-10-17 10:23:35,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:35,710 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:35,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-17 10:23:35,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:35,923 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 318194657, now seen corresponding path program 3 times [2022-10-17 10:23:35,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:35,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144492805] [2022-10-17 10:23:35,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 10:23:36,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:36,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144492805] [2022-10-17 10:23:36,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144492805] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:36,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501267370] [2022-10-17 10:23:36,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-17 10:23:36,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:36,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:36,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:23:36,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-17 10:23:36,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-17 10:23:36,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:23:36,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-17 10:23:36,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:23:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 10:23:36,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:23:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 10:23:36,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501267370] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:23:36,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:23:36,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-10-17 10:23:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010400744] [2022-10-17 10:23:36,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:23:36,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-17 10:23:36,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:36,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-17 10:23:36,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-10-17 10:23:36,727 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-10-17 10:23:36,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 171 transitions, 1334 flow. Second operand has 15 states, 15 states have (on average 81.86666666666666) internal successors, (1228), 15 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:36,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:36,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-10-17 10:23:36,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:39,183 INFO L130 PetriNetUnfolder]: 2949/8198 cut-off events. [2022-10-17 10:23:39,183 INFO L131 PetriNetUnfolder]: For 53692/54604 co-relation queries the response was YES. [2022-10-17 10:23:39,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32000 conditions, 8198 events. 2949/8198 cut-off events. For 53692/54604 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 82000 event pairs, 81 based on Foata normal form. 272/7795 useless extension candidates. Maximal degree in co-relation 28688. Up to 1537 conditions per place. [2022-10-17 10:23:39,318 INFO L137 encePairwiseOnDemand]: 95/109 looper letters, 93 selfloop transitions, 126 changer transitions 185/471 dead transitions. [2022-10-17 10:23:39,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 471 transitions, 5701 flow [2022-10-17 10:23:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-17 10:23:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-10-17 10:23:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2241 transitions. [2022-10-17 10:23:39,325 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7907551164431899 [2022-10-17 10:23:39,326 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2241 transitions. [2022-10-17 10:23:39,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2241 transitions. [2022-10-17 10:23:39,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:39,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2241 transitions. [2022-10-17 10:23:39,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 86.1923076923077) internal successors, (2241), 26 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:39,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 109.0) internal successors, (2943), 27 states have internal predecessors, (2943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:39,342 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 109.0) internal successors, (2943), 27 states have internal predecessors, (2943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:39,342 INFO L175 Difference]: Start difference. First operand has 154 places, 171 transitions, 1334 flow. Second operand 26 states and 2241 transitions. [2022-10-17 10:23:39,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 471 transitions, 5701 flow [2022-10-17 10:23:39,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 471 transitions, 5390 flow, removed 150 selfloop flow, removed 4 redundant places. [2022-10-17 10:23:39,447 INFO L231 Difference]: Finished difference. Result has 191 places, 227 transitions, 2551 flow [2022-10-17 10:23:39,448 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2551, PETRI_PLACES=191, PETRI_TRANSITIONS=227} [2022-10-17 10:23:39,448 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 93 predicate places. [2022-10-17 10:23:39,448 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 227 transitions, 2551 flow [2022-10-17 10:23:39,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 81.86666666666666) internal successors, (1228), 15 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:39,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:39,450 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:39,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-17 10:23:39,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:39,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:39,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1876076310, now seen corresponding path program 4 times [2022-10-17 10:23:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:39,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824824947] [2022-10-17 10:23:39,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 10:23:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:39,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824824947] [2022-10-17 10:23:39,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824824947] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:39,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934347443] [2022-10-17 10:23:39,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-17 10:23:39,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:39,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:39,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:23:39,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-17 10:23:40,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-17 10:23:40,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:23:40,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-17 10:23:40,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:23:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 10:23:40,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:23:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 10:23:40,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934347443] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:23:40,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:23:40,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 10 [2022-10-17 10:23:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584417860] [2022-10-17 10:23:40,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:23:40,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:23:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:23:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:23:40,278 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-10-17 10:23:40,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 227 transitions, 2551 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:40,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:40,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-10-17 10:23:40,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:41,760 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][354], [Black: 3043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1998#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 227#(<= 0 ~pos~0), Black: 2065#(and (= ~pos~0 1) (<= ~c2~0 ~pos~0)), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2081#(and (= ~pos~0 0) (<= ~c2~0 0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 1890#(<= ~c2~0 1), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 2435#(and (= ~pos~0 1) (<= ~c2~0 0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1889#(<= ~c2~0 0), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, 72#L96true, Black: 154#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 786#(<= ~c1~0 1), 2801#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 894#(= ~c1~0 0), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 3073#true, Black: 192#(<= ~c1~0 0), Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3055#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 17#L46true, Black: 3035#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2449#(<= 2 ~pos~0), Black: 3045#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3037#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2448#(<= 1 ~pos~0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 3033#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3053#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2450#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2447#(<= 0 ~pos~0), Black: 3039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3049#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3031#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3029#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3041#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:41,760 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-10-17 10:23:41,761 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-10-17 10:23:41,761 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-10-17 10:23:41,761 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-10-17 10:23:41,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][394], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1998#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 227#(<= 0 ~pos~0), Black: 2065#(and (= ~pos~0 1) (<= ~c2~0 ~pos~0)), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2081#(and (= ~pos~0 0) (<= ~c2~0 0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 1890#(<= ~c2~0 1), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1889#(<= ~c2~0 0), 56#L115-4true, Black: 2435#(and (= ~pos~0 1) (<= ~c2~0 0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, 72#L96true, Black: 154#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 2801#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 786#(<= ~c1~0 1), Black: 894#(= ~c1~0 0), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 1885#true, 3073#true, Black: 192#(<= ~c1~0 0), Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3055#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 17#L46true, Black: 3035#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2449#(<= 2 ~pos~0), Black: 3045#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3037#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2448#(<= 1 ~pos~0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 3033#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3053#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2450#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2447#(<= 0 ~pos~0), Black: 3039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3049#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3031#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3029#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3041#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-10-17 10:23:41,844 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-10-17 10:23:41,844 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-10-17 10:23:41,844 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-10-17 10:23:41,844 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-10-17 10:23:41,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][405], [Black: 3043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1998#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 227#(<= 0 ~pos~0), Black: 2065#(and (= ~pos~0 1) (<= ~c2~0 ~pos~0)), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2081#(and (= ~pos~0 0) (<= ~c2~0 0)), Black: 1890#(<= ~c2~0 1), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 2435#(and (= ~pos~0 1) (<= ~c2~0 0)), 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, 72#L96true, Black: 154#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 2801#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 786#(<= ~c1~0 1), Black: 894#(= ~c1~0 0), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 192#(<= ~c1~0 0), Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), 3078#(<= ~c1~0 1), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3055#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 17#L46true, Black: 3035#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2449#(<= 2 ~pos~0), Black: 3045#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3037#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 2448#(<= 1 ~pos~0), Black: 3033#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3053#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2450#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2447#(<= 0 ~pos~0), Black: 3039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3049#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3031#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3029#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3041#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0))]) [2022-10-17 10:23:41,846 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-10-17 10:23:41,846 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-10-17 10:23:41,846 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-10-17 10:23:41,846 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-10-17 10:23:41,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][416], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1998#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 227#(<= 0 ~pos~0), Black: 2065#(and (= ~pos~0 1) (<= ~c2~0 ~pos~0)), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2081#(and (= ~pos~0 0) (<= ~c2~0 0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 1890#(<= ~c2~0 1), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 2435#(and (= ~pos~0 1) (<= ~c2~0 0)), 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, 72#L96true, Black: 154#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 2801#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 786#(<= ~c1~0 1), Black: 894#(= ~c1~0 0), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 3079#(<= ~c1~0 2), Black: 192#(<= ~c1~0 0), Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3055#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 17#L46true, Black: 3035#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2449#(<= 2 ~pos~0), Black: 3045#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3037#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 2448#(<= 1 ~pos~0), Black: 3033#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3053#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2450#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2447#(<= 0 ~pos~0), Black: 3039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3049#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3031#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3029#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3041#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0))]) [2022-10-17 10:23:41,890 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-10-17 10:23:41,890 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-10-17 10:23:41,891 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-10-17 10:23:41,891 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-10-17 10:23:41,913 INFO L130 PetriNetUnfolder]: 1768/5907 cut-off events. [2022-10-17 10:23:41,914 INFO L131 PetriNetUnfolder]: For 99119/100272 co-relation queries the response was YES. [2022-10-17 10:23:41,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29180 conditions, 5907 events. 1768/5907 cut-off events. For 99119/100272 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 57117 event pairs, 35 based on Foata normal form. 243/5505 useless extension candidates. Maximal degree in co-relation 28891. Up to 1276 conditions per place. [2022-10-17 10:23:42,029 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 268 selfloop transitions, 59 changer transitions 0/425 dead transitions. [2022-10-17 10:23:42,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 425 transitions, 6420 flow [2022-10-17 10:23:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 10:23:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-10-17 10:23:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 755 transitions. [2022-10-17 10:23:42,032 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8658256880733946 [2022-10-17 10:23:42,032 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 755 transitions. [2022-10-17 10:23:42,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 755 transitions. [2022-10-17 10:23:42,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:42,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 755 transitions. [2022-10-17 10:23:42,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,037 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,038 INFO L175 Difference]: Start difference. First operand has 191 places, 227 transitions, 2551 flow. Second operand 8 states and 755 transitions. [2022-10-17 10:23:42,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 425 transitions, 6420 flow [2022-10-17 10:23:42,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 425 transitions, 5609 flow, removed 390 selfloop flow, removed 16 redundant places. [2022-10-17 10:23:42,462 INFO L231 Difference]: Finished difference. Result has 171 places, 253 transitions, 2785 flow [2022-10-17 10:23:42,463 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2785, PETRI_PLACES=171, PETRI_TRANSITIONS=253} [2022-10-17 10:23:42,464 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 73 predicate places. [2022-10-17 10:23:42,464 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 253 transitions, 2785 flow [2022-10-17 10:23:42,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:42,465 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:42,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-17 10:23:42,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-17 10:23:42,691 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1465219959, now seen corresponding path program 2 times [2022-10-17 10:23:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:42,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687631571] [2022-10-17 10:23:42,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:42,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-17 10:23:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:43,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687631571] [2022-10-17 10:23:43,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687631571] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:43,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299569449] [2022-10-17 10:23:43,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-17 10:23:43,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:43,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:43,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:23:43,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-17 10:23:43,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-17 10:23:43,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:23:43,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-17 10:23:43,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:23:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 10:23:43,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:23:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 10:23:43,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299569449] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:23:43,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:23:43,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2022-10-17 10:23:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268439341] [2022-10-17 10:23:43,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:23:43,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-17 10:23:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:43,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-17 10:23:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-10-17 10:23:43,552 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-10-17 10:23:43,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 253 transitions, 2785 flow. Second operand has 16 states, 16 states have (on average 80.625) internal successors, (1290), 16 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:43,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:43,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-10-17 10:23:43,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:48,886 INFO L130 PetriNetUnfolder]: 9597/23994 cut-off events. [2022-10-17 10:23:48,886 INFO L131 PetriNetUnfolder]: For 240397/241541 co-relation queries the response was YES. [2022-10-17 10:23:49,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109088 conditions, 23994 events. 9597/23994 cut-off events. For 240397/241541 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 268785 event pairs, 742 based on Foata normal form. 368/22274 useless extension candidates. Maximal degree in co-relation 107135. Up to 4437 conditions per place. [2022-10-17 10:23:49,233 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 425 selfloop transitions, 213 changer transitions 57/768 dead transitions. [2022-10-17 10:23:49,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 768 transitions, 11466 flow [2022-10-17 10:23:49,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-17 10:23:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-10-17 10:23:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1544 transitions. [2022-10-17 10:23:49,237 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7869520897043832 [2022-10-17 10:23:49,237 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1544 transitions. [2022-10-17 10:23:49,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1544 transitions. [2022-10-17 10:23:49,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:49,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1544 transitions. [2022-10-17 10:23:49,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.77777777777777) internal successors, (1544), 18 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:49,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:49,255 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:49,264 INFO L175 Difference]: Start difference. First operand has 171 places, 253 transitions, 2785 flow. Second operand 18 states and 1544 transitions. [2022-10-17 10:23:49,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 768 transitions, 11466 flow [2022-10-17 10:23:50,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 768 transitions, 10647 flow, removed 368 selfloop flow, removed 5 redundant places. [2022-10-17 10:23:50,122 INFO L231 Difference]: Finished difference. Result has 194 places, 412 transitions, 6087 flow [2022-10-17 10:23:50,123 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6087, PETRI_PLACES=194, PETRI_TRANSITIONS=412} [2022-10-17 10:23:50,124 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 96 predicate places. [2022-10-17 10:23:50,124 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 412 transitions, 6087 flow [2022-10-17 10:23:50,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 80.625) internal successors, (1290), 16 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:50,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:50,125 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:50,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-17 10:23:50,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-17 10:23:50,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-10-17 10:23:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1183258656, now seen corresponding path program 5 times [2022-10-17 10:23:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:50,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111430849] [2022-10-17 10:23:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-17 10:23:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111430849] [2022-10-17 10:23:50,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111430849] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:23:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326730935] [2022-10-17 10:23:50,721 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-17 10:23:50,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:23:50,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:50,723 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:23:50,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fec4277e-b374-4c2d-8dd8-114041cd645a/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-17 10:23:50,843 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-10-17 10:23:50,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:23:50,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-17 10:23:50,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:23:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-17 10:23:51,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:23:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-17 10:23:51,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326730935] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:23:51,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:23:51,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-10-17 10:23:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146786729] [2022-10-17 10:23:51,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:23:51,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-17 10:23:51,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-17 10:23:51,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-10-17 10:23:51,172 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-10-17 10:23:51,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 412 transitions, 6087 flow. Second operand has 16 states, 16 states have (on average 82.0) internal successors, (1312), 16 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:51,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:51,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-10-17 10:23:51,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand