./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-6b4ec56 [2022-11-20 10:31:03,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:31:03,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:31:03,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:31:03,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:31:03,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:31:03,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:31:03,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:31:03,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:31:03,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:31:03,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:31:03,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:31:03,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:31:03,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:31:03,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:31:03,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:31:03,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:31:03,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:31:03,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:31:03,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:31:03,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:31:03,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:31:03,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:31:03,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:31:03,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:31:03,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:31:03,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:31:03,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:31:03,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:31:03,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:31:03,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:31:03,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:31:03,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:31:03,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:31:03,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:31:03,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:31:03,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:31:03,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:31:03,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:31:03,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:31:03,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:31:03,735 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:31:03,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:31:03,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:31:03,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:31:03,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:31:03,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:31:03,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:31:03,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:31:03,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:31:03,807 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:31:03,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:31:03,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:31:03,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:31:03,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:31:03,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:31:03,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:31:03,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:31:03,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:31:03,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:31:03,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:31:03,810 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:31:03,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:31:03,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:31:03,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:31:03,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:31:03,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:31:03,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:31:03,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:31:03,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:31:03,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:31:03,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:31:03,813 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:31:03,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:31:03,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:31:03,814 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_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a [2022-11-20 10:31:04,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:31:04,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:31:04,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:31:04,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:31:04,088 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:31:04,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-11-20 10:31:07,195 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:31:07,424 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:31:07,425 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-11-20 10:31:07,432 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/data/44921253c/29325e730c7a4073a58e2d89def71062/FLAGe39ee5994 [2022-11-20 10:31:07,448 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/data/44921253c/29325e730c7a4073a58e2d89def71062 [2022-11-20 10:31:07,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:31:07,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:31:07,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:07,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:31:07,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:31:07,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6c8d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07, skipping insertion in model container [2022-11-20 10:31:07,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:31:07,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:31:07,730 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-11-20 10:31:07,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:07,758 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:31:07,801 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-11-20 10:31:07,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:07,820 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:31:07,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07 WrapperNode [2022-11-20 10:31:07,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:07,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:07,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:31:07,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:31:07,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,885 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-20 10:31:07,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:07,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:31:07,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:31:07,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:31:07,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,921 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:31:07,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:31:07,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:31:07,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:31:07,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (1/1) ... [2022-11-20 10:31:07,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:31:07,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:07,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:31:08,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:31:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:31:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 10:31:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 10:31:08,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 10:31:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 10:31:08,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 10:31:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 10:31:08,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:31:08,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:31:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:31:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:31:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:31:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:31:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:31:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:31:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:31:08,035 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:31:08,177 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:31:08,179 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:31:08,467 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:31:08,612 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:31:08,623 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:31:08,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:08 BoogieIcfgContainer [2022-11-20 10:31:08,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:31:08,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:31:08,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:31:08,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:31:08,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:31:07" (1/3) ... [2022-11-20 10:31:08,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c3d16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:31:08, skipping insertion in model container [2022-11-20 10:31:08,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:07" (2/3) ... [2022-11-20 10:31:08,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c3d16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:31:08, skipping insertion in model container [2022-11-20 10:31:08,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:08" (3/3) ... [2022-11-20 10:31:08,641 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-11-20 10:31:08,651 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:31:08,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:31:08,663 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:31:08,663 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:31:08,775 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 10:31:08,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-11-20 10:31:08,952 INFO L130 PetriNetUnfolder]: 7/106 cut-off events. [2022-11-20 10:31:08,952 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 10:31:08,959 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-11-20 10:31:08,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 242 flow [2022-11-20 10:31:08,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 208 flow [2022-11-20 10:31:08,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:31:08,986 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;@302aed3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:31:08,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 10:31:09,068 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2022-11-20 10:31:09,068 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 10:31:09,068 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:09,069 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:09,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1855081031, now seen corresponding path program 1 times [2022-11-20 10:31:09,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:09,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399710451] [2022-11-20 10:31:09,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:09,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399710451] [2022-11-20 10:31:09,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399710451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:09,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:09,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:31:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905162487] [2022-11-20 10:31:09,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:09,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:31:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:09,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:31:09,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:31:09,458 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2022-11-20 10:31:09,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:09,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2022-11-20 10:31:09,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:09,622 INFO L130 PetriNetUnfolder]: 36/184 cut-off events. [2022-11-20 10:31:09,622 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-20 10:31:09,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 184 events. 36/184 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 463 event pairs, 7 based on Foata normal form. 18/184 useless extension candidates. Maximal degree in co-relation 178. Up to 49 conditions per place. [2022-11-20 10:31:09,628 INFO L137 encePairwiseOnDemand]: 106/109 looper letters, 10 selfloop transitions, 0 changer transitions 1/92 dead transitions. [2022-11-20 10:31:09,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 222 flow [2022-11-20 10:31:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:31:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 10:31:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2022-11-20 10:31:09,645 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9311926605504587 [2022-11-20 10:31:09,646 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 203 transitions. [2022-11-20 10:31:09,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 203 transitions. [2022-11-20 10:31:09,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:09,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 203 transitions. [2022-11-20 10:31:09,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,671 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,673 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 208 flow. Second operand 2 states and 203 transitions. [2022-11-20 10:31:09,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 222 flow [2022-11-20 10:31:09,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 210 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 10:31:09,683 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 188 flow [2022-11-20 10:31:09,686 INFO L271 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=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=188, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2022-11-20 10:31:09,693 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2022-11-20 10:31:09,693 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 188 flow [2022-11-20 10:31:09,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,694 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:09,694 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:09,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:31:09,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1307011461, now seen corresponding path program 1 times [2022-11-20 10:31:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:09,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188204721] [2022-11-20 10:31:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:10,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188204721] [2022-11-20 10:31:10,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188204721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:10,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:10,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:31:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273548398] [2022-11-20 10:31:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:31:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:10,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:31:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:10,293 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-11-20 10:31:10,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 188 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-11-20 10:31:10,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:10,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-11-20 10:31:10,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:10,513 INFO L130 PetriNetUnfolder]: 95/279 cut-off events. [2022-11-20 10:31:10,513 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-20 10:31:10,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 279 events. 95/279 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 982 event pairs, 2 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 445. Up to 71 conditions per place. [2022-11-20 10:31:10,517 INFO L137 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2022-11-20 10:31:10,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 107 transitions, 300 flow [2022-11-20 10:31:10,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:31:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:31:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-11-20 10:31:10,521 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8042813455657493 [2022-11-20 10:31:10,521 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2022-11-20 10:31:10,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2022-11-20 10:31:10,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:10,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2022-11-20 10:31:10,524 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-11-20 10:31:10,527 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-11-20 10:31:10,527 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-11-20 10:31:10,528 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 188 flow. Second operand 6 states and 526 transitions. [2022-11-20 10:31:10,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 107 transitions, 300 flow [2022-11-20 10:31:10,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 107 transitions, 300 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:31:10,532 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 213 flow [2022-11-20 10:31:10,532 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2022-11-20 10:31:10,533 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2022-11-20 10:31:10,533 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 213 flow [2022-11-20 10:31:10,534 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-11-20 10:31:10,534 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:10,535 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:10,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:31:10,535 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:10,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1981283141, now seen corresponding path program 2 times [2022-11-20 10:31:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:10,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400221138] [2022-11-20 10:31:10,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:10,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400221138] [2022-11-20 10:31:10,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400221138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:10,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:10,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:31:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206231423] [2022-11-20 10:31:10,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:10,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:31:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:10,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:31:10,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:10,888 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-11-20 10:31:10,889 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-11-20 10:31:10,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:10,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-11-20 10:31:10,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:11,175 INFO L130 PetriNetUnfolder]: 99/326 cut-off events. [2022-11-20 10:31:11,176 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-20 10:31:11,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 326 events. 99/326 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1306 event pairs, 20 based on Foata normal form. 3/297 useless extension candidates. Maximal degree in co-relation 546. Up to 71 conditions per place. [2022-11-20 10:31:11,183 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2022-11-20 10:31:11,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 112 transitions, 341 flow [2022-11-20 10:31:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:31:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-11-20 10:31:11,189 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-11-20 10:31:11,191 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-11-20 10:31:11,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-11-20 10:31:11,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:11,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-11-20 10:31:11,195 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-11-20 10:31:11,200 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-11-20 10:31:11,201 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-11-20 10:31:11,201 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 213 flow. Second operand 7 states and 612 transitions. [2022-11-20 10:31:11,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 112 transitions, 341 flow [2022-11-20 10:31:11,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 112 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:11,209 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 239 flow [2022-11-20 10:31:11,209 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2022-11-20 10:31:11,212 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2022-11-20 10:31:11,212 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 239 flow [2022-11-20 10:31:11,213 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-11-20 10:31:11,213 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:11,214 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:11,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:31:11,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1355540335, now seen corresponding path program 3 times [2022-11-20 10:31:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:11,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180558240] [2022-11-20 10:31:11,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:11,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:11,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:11,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180558240] [2022-11-20 10:31:11,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180558240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:11,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:11,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:31:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451968242] [2022-11-20 10:31:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:31:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:31:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:31:11,642 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-20 10:31:11,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 239 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-11-20 10:31:11,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:11,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-20 10:31:11,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:11,949 INFO L130 PetriNetUnfolder]: 224/608 cut-off events. [2022-11-20 10:31:11,950 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2022-11-20 10:31:11,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 608 events. 224/608 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3178 event pairs, 30 based on Foata normal form. 6/557 useless extension candidates. Maximal degree in co-relation 1166. Up to 157 conditions per place. [2022-11-20 10:31:11,957 INFO L137 encePairwiseOnDemand]: 98/109 looper letters, 33 selfloop transitions, 7 changer transitions 36/142 dead transitions. [2022-11-20 10:31:11,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 142 transitions, 539 flow [2022-11-20 10:31:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:31:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:31:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2022-11-20 10:31:11,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.799184505606524 [2022-11-20 10:31:11,960 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2022-11-20 10:31:11,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2022-11-20 10:31:11,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:11,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2022-11-20 10:31:11,969 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-11-20 10:31:11,971 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-11-20 10:31:11,973 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-11-20 10:31:11,974 INFO L175 Difference]: Start difference. First operand has 104 places, 95 transitions, 239 flow. Second operand 9 states and 784 transitions. [2022-11-20 10:31:11,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 142 transitions, 539 flow [2022-11-20 10:31:11,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 526 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:31:11,981 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 281 flow [2022-11-20 10:31:11,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2022-11-20 10:31:11,988 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2022-11-20 10:31:11,989 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 281 flow [2022-11-20 10:31:11,989 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-11-20 10:31:11,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:11,990 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:11,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:31:11,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash -630279228, now seen corresponding path program 1 times [2022-11-20 10:31:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:11,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156353519] [2022-11-20 10:31:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:12,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156353519] [2022-11-20 10:31:12,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156353519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:12,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:12,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:12,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233861955] [2022-11-20 10:31:12,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:12,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:12,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:12,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:12,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:12,246 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-20 10:31:12,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:12,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:12,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-20 10:31:12,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:12,540 INFO L130 PetriNetUnfolder]: 323/803 cut-off events. [2022-11-20 10:31:12,540 INFO L131 PetriNetUnfolder]: For 645/652 co-relation queries the response was YES. [2022-11-20 10:31:12,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 803 events. 323/803 cut-off events. For 645/652 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4567 event pairs, 25 based on Foata normal form. 6/724 useless extension candidates. Maximal degree in co-relation 1858. Up to 179 conditions per place. [2022-11-20 10:31:12,547 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 55 selfloop transitions, 18 changer transitions 6/148 dead transitions. [2022-11-20 10:31:12,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 678 flow [2022-11-20 10:31:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:31:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-11-20 10:31:12,550 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-11-20 10:31:12,550 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-11-20 10:31:12,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-11-20 10:31:12,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:12,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-11-20 10:31:12,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:12,554 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-11-20 10:31:12,555 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-11-20 10:31:12,555 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 281 flow. Second operand 7 states and 652 transitions. [2022-11-20 10:31:12,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 678 flow [2022-11-20 10:31:12,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 148 transitions, 650 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-20 10:31:12,567 INFO L231 Difference]: Finished difference. Result has 116 places, 110 transitions, 420 flow [2022-11-20 10:31:12,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2022-11-20 10:31:12,569 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2022-11-20 10:31:12,570 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 420 flow [2022-11-20 10:31:12,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:12,570 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:12,570 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:12,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:31:12,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -108227670, now seen corresponding path program 2 times [2022-11-20 10:31:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:12,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063676488] [2022-11-20 10:31:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:12,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:12,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063676488] [2022-11-20 10:31:12,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063676488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:12,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:12,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:31:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246141057] [2022-11-20 10:31:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:12,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:31:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:12,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:31:12,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:31:12,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-20 10:31:12,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 110 transitions, 420 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-11-20 10:31:12,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:12,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-20 10:31:12,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:13,422 INFO L130 PetriNetUnfolder]: 433/1135 cut-off events. [2022-11-20 10:31:13,423 INFO L131 PetriNetUnfolder]: For 2069/2085 co-relation queries the response was YES. [2022-11-20 10:31:13,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 1135 events. 433/1135 cut-off events. For 2069/2085 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7259 event pairs, 67 based on Foata normal form. 16/1053 useless extension candidates. Maximal degree in co-relation 3181. Up to 236 conditions per place. [2022-11-20 10:31:13,436 INFO L137 encePairwiseOnDemand]: 97/109 looper letters, 68 selfloop transitions, 10 changer transitions 38/182 dead transitions. [2022-11-20 10:31:13,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 1095 flow [2022-11-20 10:31:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:31:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:31:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 931 transitions. [2022-11-20 10:31:13,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7764804003336113 [2022-11-20 10:31:13,440 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 931 transitions. [2022-11-20 10:31:13,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 931 transitions. [2022-11-20 10:31:13,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:13,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 931 transitions. [2022-11-20 10:31:13,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.63636363636364) internal successors, (931), 11 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:13,450 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-11-20 10:31:13,451 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-11-20 10:31:13,451 INFO L175 Difference]: Start difference. First operand has 116 places, 110 transitions, 420 flow. Second operand 11 states and 931 transitions. [2022-11-20 10:31:13,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 1095 flow [2022-11-20 10:31:13,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:31:13,466 INFO L231 Difference]: Finished difference. Result has 130 places, 112 transitions, 486 flow [2022-11-20 10:31:13,466 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=486, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2022-11-20 10:31:13,469 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-11-20 10:31:13,470 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 486 flow [2022-11-20 10:31:13,470 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-11-20 10:31:13,470 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:13,471 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:13,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:31:13,471 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 708965504, now seen corresponding path program 3 times [2022-11-20 10:31:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:13,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296936330] [2022-11-20 10:31:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:13,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296936330] [2022-11-20 10:31:13,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296936330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:13,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:13,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166298734] [2022-11-20 10:31:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:13,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:13,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:13,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-20 10:31:13,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 486 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:13,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:13,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-20 10:31:13,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:14,090 INFO L130 PetriNetUnfolder]: 594/1490 cut-off events. [2022-11-20 10:31:14,090 INFO L131 PetriNetUnfolder]: For 4339/4366 co-relation queries the response was YES. [2022-11-20 10:31:14,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 1490 events. 594/1490 cut-off events. For 4339/4366 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10775 event pairs, 42 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 4654. Up to 334 conditions per place. [2022-11-20 10:31:14,108 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 74 selfloop transitions, 30 changer transitions 2/175 dead transitions. [2022-11-20 10:31:14,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 175 transitions, 1212 flow [2022-11-20 10:31:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:31:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2022-11-20 10:31:14,111 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8558322411533421 [2022-11-20 10:31:14,111 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2022-11-20 10:31:14,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2022-11-20 10:31:14,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:14,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2022-11-20 10:31:14,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:14,115 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-11-20 10:31:14,116 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-11-20 10:31:14,116 INFO L175 Difference]: Start difference. First operand has 130 places, 112 transitions, 486 flow. Second operand 7 states and 653 transitions. [2022-11-20 10:31:14,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 175 transitions, 1212 flow [2022-11-20 10:31:14,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 175 transitions, 1149 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-11-20 10:31:14,141 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 785 flow [2022-11-20 10:31:14,142 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=785, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2022-11-20 10:31:14,142 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-11-20 10:31:14,142 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 785 flow [2022-11-20 10:31:14,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:14,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:14,144 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:14,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:31:14,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash 768641710, now seen corresponding path program 4 times [2022-11-20 10:31:14,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:14,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97368050] [2022-11-20 10:31:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:14,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:14,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97368050] [2022-11-20 10:31:14,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97368050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:14,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:14,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664216612] [2022-11-20 10:31:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:14,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:14,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:14,431 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-20 10:31:14,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 785 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:14,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:14,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-20 10:31:14,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:15,044 INFO L130 PetriNetUnfolder]: 832/2072 cut-off events. [2022-11-20 10:31:15,044 INFO L131 PetriNetUnfolder]: For 8163/8197 co-relation queries the response was YES. [2022-11-20 10:31:15,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6890 conditions, 2072 events. 832/2072 cut-off events. For 8163/8197 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16195 event pairs, 116 based on Foata normal form. 96/2036 useless extension candidates. Maximal degree in co-relation 6867. Up to 578 conditions per place. [2022-11-20 10:31:15,073 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 98 selfloop transitions, 49 changer transitions 22/238 dead transitions. [2022-11-20 10:31:15,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 238 transitions, 2090 flow [2022-11-20 10:31:15,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:31:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:31:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2022-11-20 10:31:15,077 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8572884811416922 [2022-11-20 10:31:15,077 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 841 transitions. [2022-11-20 10:31:15,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 841 transitions. [2022-11-20 10:31:15,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:15,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 841 transitions. [2022-11-20 10:31:15,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:15,083 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-11-20 10:31:15,084 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-11-20 10:31:15,084 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 785 flow. Second operand 9 states and 841 transitions. [2022-11-20 10:31:15,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 238 transitions, 2090 flow [2022-11-20 10:31:15,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 238 transitions, 2080 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-11-20 10:31:15,129 INFO L231 Difference]: Finished difference. Result has 146 places, 157 transitions, 1337 flow [2022-11-20 10:31:15,130 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1337, PETRI_PLACES=146, PETRI_TRANSITIONS=157} [2022-11-20 10:31:15,132 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 48 predicate places. [2022-11-20 10:31:15,132 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 1337 flow [2022-11-20 10:31:15,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:15,133 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:15,133 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:15,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:31:15,134 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash 683985028, now seen corresponding path program 5 times [2022-11-20 10:31:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:15,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635099806] [2022-11-20 10:31:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:15,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635099806] [2022-11-20 10:31:15,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635099806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:15,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:15,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597984181] [2022-11-20 10:31:15,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:15,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:15,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:15,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:15,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:15,369 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-20 10:31:15,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 157 transitions, 1337 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:15,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:15,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-20 10:31:15,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:15,930 INFO L130 PetriNetUnfolder]: 871/2130 cut-off events. [2022-11-20 10:31:15,931 INFO L131 PetriNetUnfolder]: For 11903/11955 co-relation queries the response was YES. [2022-11-20 10:31:16,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 2130 events. 871/2130 cut-off events. For 11903/11955 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16638 event pairs, 54 based on Foata normal form. 14/1981 useless extension candidates. Maximal degree in co-relation 8311. Up to 621 conditions per place. [2022-11-20 10:31:16,047 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 88 selfloop transitions, 64 changer transitions 3/224 dead transitions. [2022-11-20 10:31:16,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 224 transitions, 2274 flow [2022-11-20 10:31:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:31:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:31:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2022-11-20 10:31:16,050 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8491335372069317 [2022-11-20 10:31:16,050 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2022-11-20 10:31:16,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2022-11-20 10:31:16,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:16,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2022-11-20 10:31:16,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:16,055 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-11-20 10:31:16,055 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-11-20 10:31:16,056 INFO L175 Difference]: Start difference. First operand has 146 places, 157 transitions, 1337 flow. Second operand 9 states and 833 transitions. [2022-11-20 10:31:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 224 transitions, 2274 flow [2022-11-20 10:31:16,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 224 transitions, 2226 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-11-20 10:31:16,114 INFO L231 Difference]: Finished difference. Result has 157 places, 171 transitions, 1734 flow [2022-11-20 10:31:16,115 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1734, PETRI_PLACES=157, PETRI_TRANSITIONS=171} [2022-11-20 10:31:16,115 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 59 predicate places. [2022-11-20 10:31:16,116 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 171 transitions, 1734 flow [2022-11-20 10:31:16,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:16,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:16,116 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:16,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:31:16,117 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2131309290, now seen corresponding path program 6 times [2022-11-20 10:31:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:16,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755884419] [2022-11-20 10:31:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:16,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:16,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755884419] [2022-11-20 10:31:16,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755884419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:16,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:16,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:16,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183574257] [2022-11-20 10:31:16,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:16,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:16,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:16,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:16,307 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-20 10:31:16,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 171 transitions, 1734 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:16,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:16,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-20 10:31:16,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:16,901 INFO L130 PetriNetUnfolder]: 853/2078 cut-off events. [2022-11-20 10:31:16,901 INFO L131 PetriNetUnfolder]: For 15342/15367 co-relation queries the response was YES. [2022-11-20 10:31:16,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9036 conditions, 2078 events. 853/2078 cut-off events. For 15342/15367 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16205 event pairs, 218 based on Foata normal form. 7/1915 useless extension candidates. Maximal degree in co-relation 9000. Up to 1010 conditions per place. [2022-11-20 10:31:16,932 INFO L137 encePairwiseOnDemand]: 99/109 looper letters, 97 selfloop transitions, 38 changer transitions 10/214 dead transitions. [2022-11-20 10:31:16,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 214 transitions, 2540 flow [2022-11-20 10:31:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:31:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:31:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 723 transitions. [2022-11-20 10:31:16,935 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8291284403669725 [2022-11-20 10:31:16,935 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 723 transitions. [2022-11-20 10:31:16,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 723 transitions. [2022-11-20 10:31:16,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:16,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 723 transitions. [2022-11-20 10:31:16,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:16,940 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-11-20 10:31:16,941 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-11-20 10:31:16,941 INFO L175 Difference]: Start difference. First operand has 157 places, 171 transitions, 1734 flow. Second operand 8 states and 723 transitions. [2022-11-20 10:31:16,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 214 transitions, 2540 flow [2022-11-20 10:31:17,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 214 transitions, 2381 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-11-20 10:31:17,059 INFO L231 Difference]: Finished difference. Result has 162 places, 176 transitions, 1811 flow [2022-11-20 10:31:17,060 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1811, PETRI_PLACES=162, PETRI_TRANSITIONS=176} [2022-11-20 10:31:17,060 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 64 predicate places. [2022-11-20 10:31:17,060 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 176 transitions, 1811 flow [2022-11-20 10:31:17,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:17,061 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:17,061 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:17,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:31:17,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -646087402, now seen corresponding path program 7 times [2022-11-20 10:31:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:17,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973284385] [2022-11-20 10:31:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973284385] [2022-11-20 10:31:17,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973284385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:17,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527267167] [2022-11-20 10:31:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:17,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:17,254 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-20 10:31:17,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 176 transitions, 1811 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:17,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:17,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-20 10:31:17,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:17,865 INFO L130 PetriNetUnfolder]: 832/1897 cut-off events. [2022-11-20 10:31:17,865 INFO L131 PetriNetUnfolder]: For 14631/14675 co-relation queries the response was YES. [2022-11-20 10:31:17,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 1897 events. 832/1897 cut-off events. For 14631/14675 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13910 event pairs, 46 based on Foata normal form. 2/1751 useless extension candidates. Maximal degree in co-relation 8487. Up to 615 conditions per place. [2022-11-20 10:31:17,898 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 110 selfloop transitions, 45 changer transitions 6/230 dead transitions. [2022-11-20 10:31:17,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 2690 flow [2022-11-20 10:31:17,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:31:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2022-11-20 10:31:17,901 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8479685452162516 [2022-11-20 10:31:17,901 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2022-11-20 10:31:17,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2022-11-20 10:31:17,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:17,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2022-11-20 10:31:17,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:17,906 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-11-20 10:31:17,907 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-11-20 10:31:17,907 INFO L175 Difference]: Start difference. First operand has 162 places, 176 transitions, 1811 flow. Second operand 7 states and 647 transitions. [2022-11-20 10:31:17,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 2690 flow [2022-11-20 10:31:17,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 230 transitions, 2583 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-11-20 10:31:17,993 INFO L231 Difference]: Finished difference. Result has 165 places, 176 transitions, 1851 flow [2022-11-20 10:31:17,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1851, PETRI_PLACES=165, PETRI_TRANSITIONS=176} [2022-11-20 10:31:17,994 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-11-20 10:31:17,994 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 176 transitions, 1851 flow [2022-11-20 10:31:17,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:17,995 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:17,995 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:17,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:31:17,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:17,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1113004871, now seen corresponding path program 1 times [2022-11-20 10:31:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:17,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039761673] [2022-11-20 10:31:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:18,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:18,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039761673] [2022-11-20 10:31:18,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039761673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:18,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029254731] [2022-11-20 10:31:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:18,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:18,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:18,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:31:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:31:18,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:18,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:18,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029254731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:18,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:18,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 10:31:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283781069] [2022-11-20 10:31:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:18,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:18,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:31:18,697 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2022-11-20 10:31:18,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 176 transitions, 1851 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:18,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:18,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2022-11-20 10:31:18,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:19,110 INFO L130 PetriNetUnfolder]: 555/1551 cut-off events. [2022-11-20 10:31:19,111 INFO L131 PetriNetUnfolder]: For 10500/10615 co-relation queries the response was YES. [2022-11-20 10:31:19,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 1551 events. 555/1551 cut-off events. For 10500/10615 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10738 event pairs, 30 based on Foata normal form. 10/1375 useless extension candidates. Maximal degree in co-relation 6211. Up to 472 conditions per place. [2022-11-20 10:31:19,147 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 35 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2022-11-20 10:31:19,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 1949 flow [2022-11-20 10:31:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:31:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-11-20 10:31:19,149 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256880733944955 [2022-11-20 10:31:19,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2022-11-20 10:31:19,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2022-11-20 10:31:19,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:19,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2022-11-20 10:31:19,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:19,153 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-11-20 10:31:19,153 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-11-20 10:31:19,154 INFO L175 Difference]: Start difference. First operand has 165 places, 176 transitions, 1851 flow. Second operand 5 states and 450 transitions. [2022-11-20 10:31:19,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 1949 flow [2022-11-20 10:31:19,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 181 transitions, 1874 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-20 10:31:19,215 INFO L231 Difference]: Finished difference. Result has 165 places, 179 transitions, 1810 flow [2022-11-20 10:31:19,216 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1810, PETRI_PLACES=165, PETRI_TRANSITIONS=179} [2022-11-20 10:31:19,217 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-11-20 10:31:19,217 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 179 transitions, 1810 flow [2022-11-20 10:31:19,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:19,218 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:19,218 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:19,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:19,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 10:31:19,425 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash 939372782, now seen corresponding path program 1 times [2022-11-20 10:31:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:19,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887278618] [2022-11-20 10:31:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:19,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:19,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887278618] [2022-11-20 10:31:19,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887278618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:19,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:19,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293168275] [2022-11-20 10:31:19,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:19,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:19,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:19,666 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-20 10:31:19,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 179 transitions, 1810 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:19,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:19,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-20 10:31:19,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:20,048 INFO L130 PetriNetUnfolder]: 629/1867 cut-off events. [2022-11-20 10:31:20,048 INFO L131 PetriNetUnfolder]: For 11724/11893 co-relation queries the response was YES. [2022-11-20 10:31:20,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7335 conditions, 1867 events. 629/1867 cut-off events. For 11724/11893 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14033 event pairs, 55 based on Foata normal form. 31/1690 useless extension candidates. Maximal degree in co-relation 7297. Up to 388 conditions per place. [2022-11-20 10:31:20,079 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 20 selfloop transitions, 7 changer transitions 0/184 dead transitions. [2022-11-20 10:31:20,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 184 transitions, 1891 flow [2022-11-20 10:31:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:31:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-11-20 10:31:20,081 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8458715596330275 [2022-11-20 10:31:20,082 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2022-11-20 10:31:20,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2022-11-20 10:31:20,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:20,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2022-11-20 10:31:20,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:20,085 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-11-20 10:31:20,085 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-11-20 10:31:20,085 INFO L175 Difference]: Start difference. First operand has 165 places, 179 transitions, 1810 flow. Second operand 5 states and 461 transitions. [2022-11-20 10:31:20,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 184 transitions, 1891 flow [2022-11-20 10:31:20,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 184 transitions, 1883 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:20,149 INFO L231 Difference]: Finished difference. Result has 167 places, 180 transitions, 1831 flow [2022-11-20 10:31:20,150 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1831, PETRI_PLACES=167, PETRI_TRANSITIONS=180} [2022-11-20 10:31:20,150 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 69 predicate places. [2022-11-20 10:31:20,151 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 180 transitions, 1831 flow [2022-11-20 10:31:20,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:20,151 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:20,151 INFO L209 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-11-20 10:31:20,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:31:20,152 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:20,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash -744843126, now seen corresponding path program 1 times [2022-11-20 10:31:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:20,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307933995] [2022-11-20 10:31:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:20,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307933995] [2022-11-20 10:31:20,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307933995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:20,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345930747] [2022-11-20 10:31:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:20,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:20,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:31:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:31:20,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:20,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345930747] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:20,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:20,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-11-20 10:31:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667226525] [2022-11-20 10:31:20,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:20,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:31:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:20,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:31:20,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:31:20,875 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-20 10:31:20,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 180 transitions, 1831 flow. Second operand has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:20,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:20,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-20 10:31:20,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:22,703 INFO L130 PetriNetUnfolder]: 2096/5348 cut-off events. [2022-11-20 10:31:22,704 INFO L131 PetriNetUnfolder]: For 37822/37990 co-relation queries the response was YES. [2022-11-20 10:31:22,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22597 conditions, 5348 events. 2096/5348 cut-off events. For 37822/37990 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49685 event pairs, 146 based on Foata normal form. 36/4920 useless extension candidates. Maximal degree in co-relation 22558. Up to 769 conditions per place. [2022-11-20 10:31:22,789 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 101 selfloop transitions, 118 changer transitions 166/465 dead transitions. [2022-11-20 10:31:22,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 465 transitions, 6561 flow [2022-11-20 10:31:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:31:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 10:31:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1809 transitions. [2022-11-20 10:31:22,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7903014416775884 [2022-11-20 10:31:22,796 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1809 transitions. [2022-11-20 10:31:22,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1809 transitions. [2022-11-20 10:31:22,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:22,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1809 transitions. [2022-11-20 10:31:22,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.14285714285714) internal successors, (1809), 21 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:22,807 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-11-20 10:31:22,808 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-11-20 10:31:22,808 INFO L175 Difference]: Start difference. First operand has 167 places, 180 transitions, 1831 flow. Second operand 21 states and 1809 transitions. [2022-11-20 10:31:22,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 465 transitions, 6561 flow [2022-11-20 10:31:22,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 465 transitions, 6550 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:22,992 INFO L231 Difference]: Finished difference. Result has 193 places, 258 transitions, 3423 flow [2022-11-20 10:31:22,992 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3423, PETRI_PLACES=193, PETRI_TRANSITIONS=258} [2022-11-20 10:31:22,993 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 95 predicate places. [2022-11-20 10:31:22,993 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 258 transitions, 3423 flow [2022-11-20 10:31:22,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:22,994 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:22,994 INFO L209 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-11-20 10:31:23,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:23,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:31:23,201 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1476924387, now seen corresponding path program 1 times [2022-11-20 10:31:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:23,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68532115] [2022-11-20 10:31:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:23,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:23,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68532115] [2022-11-20 10:31:23,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68532115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:23,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:23,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121977488] [2022-11-20 10:31:23,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:23,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:23,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:23,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:23,484 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-20 10:31:23,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 258 transitions, 3423 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-11-20 10:31:23,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:23,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-20 10:31:23,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:24,133 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][183], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(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|)), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 1098#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 551#(and (= ~pos~0 0) (= ~pos~0 ~c2~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))), 62#L72true, Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 558#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 165#true, 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), Black: 1092#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 1094#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 568#(<= 1 ~pos~0), Black: 1090#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 1106#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1088#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 1096#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 1104#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 567#(<= 0 ~pos~0), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 1117#true]) [2022-11-20 10:31:24,134 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-11-20 10:31:24,134 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-20 10:31:24,134 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-20 10:31:24,134 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-20 10:31:24,504 INFO L130 PetriNetUnfolder]: 1293/4073 cut-off events. [2022-11-20 10:31:24,505 INFO L131 PetriNetUnfolder]: For 42368/43073 co-relation queries the response was YES. [2022-11-20 10:31:24,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18925 conditions, 4073 events. 1293/4073 cut-off events. For 42368/43073 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 37797 event pairs, 166 based on Foata normal form. 186/3817 useless extension candidates. Maximal degree in co-relation 18877. Up to 1017 conditions per place. [2022-11-20 10:31:24,596 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 43 selfloop transitions, 10 changer transitions 4/269 dead transitions. [2022-11-20 10:31:24,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 269 transitions, 3616 flow [2022-11-20 10:31:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:31:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-11-20 10:31:24,599 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8532110091743119 [2022-11-20 10:31:24,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2022-11-20 10:31:24,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2022-11-20 10:31:24,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:24,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2022-11-20 10:31:24,601 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-11-20 10:31:24,604 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-11-20 10:31:24,604 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-11-20 10:31:24,605 INFO L175 Difference]: Start difference. First operand has 193 places, 258 transitions, 3423 flow. Second operand 5 states and 465 transitions. [2022-11-20 10:31:24,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 269 transitions, 3616 flow [2022-11-20 10:31:24,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 269 transitions, 3482 flow, removed 62 selfloop flow, removed 6 redundant places. [2022-11-20 10:31:24,783 INFO L231 Difference]: Finished difference. Result has 187 places, 253 transitions, 3231 flow [2022-11-20 10:31:24,783 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3265, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3231, PETRI_PLACES=187, PETRI_TRANSITIONS=253} [2022-11-20 10:31:24,784 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 89 predicate places. [2022-11-20 10:31:24,784 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 253 transitions, 3231 flow [2022-11-20 10:31:24,785 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-11-20 10:31:24,785 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:24,785 INFO L209 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-11-20 10:31:24,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:31:24,786 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1654577768, now seen corresponding path program 2 times [2022-11-20 10:31:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:24,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261120648] [2022-11-20 10:31:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:31:25,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:25,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261120648] [2022-11-20 10:31:25,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261120648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:25,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468688043] [2022-11-20 10:31:25,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:31:25,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:25,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:25,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:25,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:31:25,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:31:25,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:25,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:31:25,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:25,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:31:25,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468688043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:25,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:25,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-11-20 10:31:25,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254727867] [2022-11-20 10:31:25,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:25,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:31:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:25,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:31:25,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:25,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-20 10:31:25,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 253 transitions, 3231 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-11-20 10:31:25,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:25,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-20 10:31:25,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:27,589 INFO L130 PetriNetUnfolder]: 2522/7805 cut-off events. [2022-11-20 10:31:27,589 INFO L131 PetriNetUnfolder]: For 79570/80425 co-relation queries the response was YES. [2022-11-20 10:31:27,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36973 conditions, 7805 events. 2522/7805 cut-off events. For 79570/80425 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 80571 event pairs, 199 based on Foata normal form. 177/7208 useless extension candidates. Maximal degree in co-relation 36925. Up to 1105 conditions per place. [2022-11-20 10:31:27,784 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 76 selfloop transitions, 20 changer transitions 0/308 dead transitions. [2022-11-20 10:31:27,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 308 transitions, 3936 flow [2022-11-20 10:31:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:31:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-11-20 10:31:27,787 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-11-20 10:31:27,787 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-11-20 10:31:27,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-11-20 10:31:27,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:27,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-11-20 10:31:27,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:27,792 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-11-20 10:31:27,792 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-11-20 10:31:27,793 INFO L175 Difference]: Start difference. First operand has 187 places, 253 transitions, 3231 flow. Second operand 7 states and 652 transitions. [2022-11-20 10:31:27,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 308 transitions, 3936 flow [2022-11-20 10:31:28,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 308 transitions, 3917 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:28,261 INFO L231 Difference]: Finished difference. Result has 192 places, 265 transitions, 3437 flow [2022-11-20 10:31:28,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3217, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3437, PETRI_PLACES=192, PETRI_TRANSITIONS=265} [2022-11-20 10:31:28,262 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 94 predicate places. [2022-11-20 10:31:28,263 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 265 transitions, 3437 flow [2022-11-20 10:31:28,263 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-11-20 10:31:28,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:28,264 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:28,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:28,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:31:28,466 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash 531740213, now seen corresponding path program 1 times [2022-11-20 10:31:28,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:28,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709242463] [2022-11-20 10:31:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:28,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:28,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709242463] [2022-11-20 10:31:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709242463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9347458] [2022-11-20 10:31:28,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:28,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:28,781 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:28,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:31:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:28,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:31:28,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:29,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:29,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9347458] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:29,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:29,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-11-20 10:31:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154718177] [2022-11-20 10:31:29,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:29,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:31:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:31:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:31:29,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-20 10:31:29,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 265 transitions, 3437 flow. Second operand has 15 states, 15 states have (on average 81.73333333333333) internal successors, (1226), 15 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:29,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:29,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-20 10:31:29,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:35,362 INFO L130 PetriNetUnfolder]: 8450/21732 cut-off events. [2022-11-20 10:31:35,362 INFO L131 PetriNetUnfolder]: For 256657/258263 co-relation queries the response was YES. [2022-11-20 10:31:35,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114620 conditions, 21732 events. 8450/21732 cut-off events. For 256657/258263 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 246145 event pairs, 507 based on Foata normal form. 708/20709 useless extension candidates. Maximal degree in co-relation 114570. Up to 3218 conditions per place. [2022-11-20 10:31:35,669 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 124 selfloop transitions, 307 changer transitions 241/752 dead transitions. [2022-11-20 10:31:35,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 752 transitions, 12837 flow [2022-11-20 10:31:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 10:31:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-20 10:31:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2244 transitions. [2022-11-20 10:31:35,673 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7918136908962597 [2022-11-20 10:31:35,673 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2244 transitions. [2022-11-20 10:31:35,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2244 transitions. [2022-11-20 10:31:35,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:35,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2244 transitions. [2022-11-20 10:31:35,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 86.3076923076923) internal successors, (2244), 26 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:35,880 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-11-20 10:31:35,890 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-11-20 10:31:35,890 INFO L175 Difference]: Start difference. First operand has 192 places, 265 transitions, 3437 flow. Second operand 26 states and 2244 transitions. [2022-11-20 10:31:35,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 752 transitions, 12837 flow [2022-11-20 10:31:37,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 752 transitions, 12775 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:37,293 INFO L231 Difference]: Finished difference. Result has 228 places, 459 transitions, 7833 flow [2022-11-20 10:31:37,293 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3415, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=7833, PETRI_PLACES=228, PETRI_TRANSITIONS=459} [2022-11-20 10:31:37,294 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 130 predicate places. [2022-11-20 10:31:37,294 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 459 transitions, 7833 flow [2022-11-20 10:31:37,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 81.73333333333333) internal successors, (1226), 15 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:37,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:37,296 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:37,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:37,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:37,501 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1406668918, now seen corresponding path program 2 times [2022-11-20 10:31:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:37,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775800153] [2022-11-20 10:31:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:31:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:37,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775800153] [2022-11-20 10:31:37,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775800153] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:37,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594954322] [2022-11-20 10:31:37,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:31:37,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:37,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:37,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:31:37,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:31:37,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:37,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:31:37,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:37,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:31:38,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594954322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:38,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:38,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-11-20 10:31:38,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604525134] [2022-11-20 10:31:38,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:38,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:31:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:38,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:31:38,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:38,112 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-20 10:31:38,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 459 transitions, 7833 flow. Second operand has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:38,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:38,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-20 10:31:38,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:39,230 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][244], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(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|)), 56#L115-4true, Black: 1131#(<= ~c2~0 1), Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 1098#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 551#(and (= ~pos~0 0) (= ~pos~0 ~c2~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))), 62#L72true, Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 558#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 165#true, 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 1239#(= ~c2~0 0), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 2309#(<= ~c1~0 1), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), Black: 1092#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 1094#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 568#(<= 1 ~pos~0), Black: 1090#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 1088#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 1096#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 567#(<= 0 ~pos~0), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 2270#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 1121#(<= ~c1~0 0), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 2272#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 2284#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2262#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 1680#(<= 0 ~pos~0), Black: 2266#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 2268#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2286#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1682#(<= 2 ~pos~0), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 1681#(<= 1 ~pos~0), Black: 2264#(and (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2280#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2288#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2278#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0))]) [2022-11-20 10:31:39,230 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-11-20 10:31:39,231 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-20 10:31:39,231 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-20 10:31:39,231 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-20 10:31:40,130 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][323], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(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: 1239#(= ~c2~0 0), 56#L115-4true, Black: 1131#(<= ~c2~0 1), Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 1098#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 551#(and (= ~pos~0 0) (= ~pos~0 ~c2~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: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 62#L72true, Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 558#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 2309#(<= ~c1~0 1), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2274#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 1092#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 1094#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 568#(<= 1 ~pos~0), Black: 1090#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 1088#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 1096#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), 1126#true, Black: 567#(<= 0 ~pos~0), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 1121#(<= ~c1~0 0), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 2272#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2284#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2262#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 1680#(<= 0 ~pos~0), Black: 2266#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 2268#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2286#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1682#(<= 2 ~pos~0), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 1681#(<= 1 ~pos~0), Black: 2264#(and (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2280#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2288#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2278#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2270#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)))]) [2022-11-20 10:31:40,131 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-11-20 10:31:40,131 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-20 10:31:40,131 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-20 10:31:40,131 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-20 10:31:43,428 INFO L130 PetriNetUnfolder]: 7045/22414 cut-off events. [2022-11-20 10:31:43,428 INFO L131 PetriNetUnfolder]: For 436850/440412 co-relation queries the response was YES. [2022-11-20 10:31:43,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133021 conditions, 22414 events. 7045/22414 cut-off events. For 436850/440412 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 275845 event pairs, 541 based on Foata normal form. 807/20985 useless extension candidates. Maximal degree in co-relation 132956. Up to 3517 conditions per place. [2022-11-20 10:31:44,040 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 167 selfloop transitions, 50 changer transitions 40/576 dead transitions. [2022-11-20 10:31:44,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 576 transitions, 10186 flow [2022-11-20 10:31:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:31:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2022-11-20 10:31:44,046 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2022-11-20 10:31:44,046 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2022-11-20 10:31:44,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2022-11-20 10:31:44,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:44,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2022-11-20 10:31:44,051 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-11-20 10:31:44,054 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-11-20 10:31:44,071 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-11-20 10:31:44,071 INFO L175 Difference]: Start difference. First operand has 228 places, 459 transitions, 7833 flow. Second operand 7 states and 658 transitions. [2022-11-20 10:31:44,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 576 transitions, 10186 flow [2022-11-20 10:31:47,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 576 transitions, 9502 flow, removed 331 selfloop flow, removed 5 redundant places. [2022-11-20 10:31:47,996 INFO L231 Difference]: Finished difference. Result has 230 places, 457 transitions, 7599 flow [2022-11-20 10:31:47,997 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=7352, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7599, PETRI_PLACES=230, PETRI_TRANSITIONS=457} [2022-11-20 10:31:47,997 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 132 predicate places. [2022-11-20 10:31:47,998 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 457 transitions, 7599 flow [2022-11-20 10:31:47,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.66666666666667) internal successors, (816), 9 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:47,998 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:47,998 INFO L209 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-11-20 10:31:48,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:48,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:31:48,200 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:31:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 132777361, now seen corresponding path program 3 times [2022-11-20 10:31:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:48,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331699499] [2022-11-20 10:31:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:48,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331699499] [2022-11-20 10:31:48,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331699499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:48,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320675718] [2022-11-20 10:31:48,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:31:48,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:48,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:48,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:48,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:31:48,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 10:31:48,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:48,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:31:48,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:31:48,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:49,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320675718] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:49,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:49,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 21 [2022-11-20 10:31:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322636463] [2022-11-20 10:31:49,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:49,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 10:31:49,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:49,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:31:49,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:31:49,278 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-20 10:31:49,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 457 transitions, 7599 flow. Second operand has 21 states, 21 states have (on average 80.52380952380952) internal successors, (1691), 21 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:49,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:49,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-20 10:31:49,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:32:09,623 INFO L130 PetriNetUnfolder]: 24782/65141 cut-off events. [2022-11-20 10:32:09,623 INFO L131 PetriNetUnfolder]: For 1445594/1452205 co-relation queries the response was YES. [2022-11-20 10:32:10,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419582 conditions, 65141 events. 24782/65141 cut-off events. For 1445594/1452205 co-relation queries the response was YES. Maximal size of possible extension queue 2791. Compared 859174 event pairs, 812 based on Foata normal form. 3196/63385 useless extension candidates. Maximal degree in co-relation 419514. Up to 8886 conditions per place. [2022-11-20 10:32:11,028 INFO L137 encePairwiseOnDemand]: 94/109 looper letters, 516 selfloop transitions, 1145 changer transitions 562/2301 dead transitions. [2022-11-20 10:32:11,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 2301 transitions, 49351 flow [2022-11-20 10:32:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-20 10:32:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-11-20 10:32:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 5942 transitions. [2022-11-20 10:32:11,041 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.767799457294224 [2022-11-20 10:32:11,041 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 5942 transitions. [2022-11-20 10:32:11,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 5942 transitions. [2022-11-20 10:32:11,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:32:11,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 5942 transitions. [2022-11-20 10:32:11,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 83.69014084507042) internal successors, (5942), 71 states have internal predecessors, (5942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:11,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 109.0) internal successors, (7848), 72 states have internal predecessors, (7848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:11,077 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 109.0) internal successors, (7848), 72 states have internal predecessors, (7848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:11,077 INFO L175 Difference]: Start difference. First operand has 230 places, 457 transitions, 7599 flow. Second operand 71 states and 5942 transitions. [2022-11-20 10:32:11,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 2301 transitions, 49351 flow [2022-11-20 10:32:36,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 2301 transitions, 48547 flow, removed 379 selfloop flow, removed 5 redundant places. [2022-11-20 10:32:36,281 INFO L231 Difference]: Finished difference. Result has 333 places, 1427 transitions, 30531 flow [2022-11-20 10:32:36,281 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=7507, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=30531, PETRI_PLACES=333, PETRI_TRANSITIONS=1427} [2022-11-20 10:32:36,282 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 235 predicate places. [2022-11-20 10:32:36,282 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 1427 transitions, 30531 flow [2022-11-20 10:32:36,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 80.52380952380952) internal successors, (1691), 21 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:36,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:32:36,283 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:36,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 10:32:36,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:36,489 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:32:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2097658628, now seen corresponding path program 3 times [2022-11-20 10:32:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:36,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916744134] [2022-11-20 10:32:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:36,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:32:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916744134] [2022-11-20 10:32:36,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916744134] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585220833] [2022-11-20 10:32:36,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:32:36,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:36,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:36,898 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:36,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc1ce0ff-81a9-4e36-a6a6-fd5edcdd440b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:32:37,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 10:32:37,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:32:37,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:32:37,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:32:37,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:32:37,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585220833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:37,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:37,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 21 [2022-11-20 10:32:37,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310321963] [2022-11-20 10:32:37,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:37,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 10:32:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:32:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:32:37,663 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-20 10:32:37,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 1427 transitions, 30531 flow. Second operand has 21 states, 21 states have (on average 80.19047619047619) internal successors, (1684), 21 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:37,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:32:37,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-20 10:32:37,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand