./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 11:53:49,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:53:49,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:53:49,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:53:49,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:53:49,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:53:49,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:53:49,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:53:49,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:53:49,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:53:49,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:53:49,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:53:49,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:53:49,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:53:49,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:53:49,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:53:49,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:53:49,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:53:49,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:53:49,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:53:49,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:53:49,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:53:49,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:53:49,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:53:49,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:53:49,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:53:49,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:53:49,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:53:49,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:53:49,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:53:49,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:53:49,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:53:49,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:53:49,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:53:49,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:53:49,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:53:49,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:53:49,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:53:49,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:53:49,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:53:49,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:53:49,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:53:49,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:53:49,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:53:49,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:53:49,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:53:49,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:53:49,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:53:49,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:53:49,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:53:49,575 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:53:49,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:53:49,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:53:49,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:53:49,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:53:49,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:53:49,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:53:49,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:53:49,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:53:49,576 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:53:49,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:53:49,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:53:49,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:53:49,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:53:49,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:53:49,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:53:49,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:53:49,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:53:49,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:53:49,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:53:49,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:53:49,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:53:49,579 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:53:49,579 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:53:49,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:53:49,579 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_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/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_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8 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-16 11:53:49,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:53:49,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:53:49,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:53:49,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:53:49,851 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:53:49,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-11-16 11:53:49,924 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/data/37ff138c7/81f27c63704b4b30ba794faa32f8489a/FLAG64ea8cdfb [2022-11-16 11:53:50,331 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:53:50,332 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-11-16 11:53:50,346 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/data/37ff138c7/81f27c63704b4b30ba794faa32f8489a/FLAG64ea8cdfb [2022-11-16 11:53:50,739 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/data/37ff138c7/81f27c63704b4b30ba794faa32f8489a [2022-11-16 11:53:50,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:53:50,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:53:50,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:53:50,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:53:50,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:53:50,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:53:50" (1/1) ... [2022-11-16 11:53:50,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9191d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:50, skipping insertion in model container [2022-11-16 11:53:50,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:53:50" (1/1) ... [2022-11-16 11:53:50,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:53:50,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:53:51,009 WARN L229 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_eb409116-8693-4fcc-940a-4e3a2f8e0700/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-11-16 11:53:51,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:53:51,021 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:53:51,046 WARN L229 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_eb409116-8693-4fcc-940a-4e3a2f8e0700/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-11-16 11:53:51,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:53:51,073 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:53:51,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51 WrapperNode [2022-11-16 11:53:51,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:53:51,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:53:51,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:53:51,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:53:51,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,137 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-16 11:53:51,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:53:51,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:53:51,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:53:51,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:53:51,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,170 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:53:51,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:53:51,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:53:51,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:53:51,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (1/1) ... [2022-11-16 11:53:51,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:53:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:53:51,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:53:51,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:53:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:53:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:53:51,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:53:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:53:51,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:53:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 11:53:51,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 11:53:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:53:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:53:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:53:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:53:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:53:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:53:51,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:53:51,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:53:51,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:53:51,272 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:53:51,367 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:53:51,369 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:53:51,723 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:53:51,837 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:53:51,848 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:53:51,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:53:51 BoogieIcfgContainer [2022-11-16 11:53:51,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:53:51,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:53:51,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:53:51,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:53:51,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:53:50" (1/3) ... [2022-11-16 11:53:51,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34886714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:53:51, skipping insertion in model container [2022-11-16 11:53:51,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:51" (2/3) ... [2022-11-16 11:53:51,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34886714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:53:51, skipping insertion in model container [2022-11-16 11:53:51,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:53:51" (3/3) ... [2022-11-16 11:53:51,863 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-11-16 11:53:51,870 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:53:51,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:53:51,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:53:51,880 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:53:51,944 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:53:51,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-11-16 11:53:52,040 INFO L130 PetriNetUnfolder]: 7/106 cut-off events. [2022-11-16 11:53:52,040 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:53:52,046 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-16 11:53:52,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 242 flow [2022-11-16 11:53:52,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 208 flow [2022-11-16 11:53:52,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:53:52,068 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;@4f91f47f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:53:52,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 11:53:52,155 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2022-11-16 11:53:52,159 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:53:52,160 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:52,161 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-16 11:53:52,161 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-16 11:53:52,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash 344442875, now seen corresponding path program 1 times [2022-11-16 11:53:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:52,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688618799] [2022-11-16 11:53:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:52,489 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-16 11:53:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688618799] [2022-11-16 11:53:52,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688618799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:52,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:52,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:53:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663560114] [2022-11-16 11:53:52,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:52,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:53:52,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:52,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:53:52,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:53:52,548 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2022-11-16 11:53:52,551 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-16 11:53:52,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:52,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2022-11-16 11:53:52,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:52,632 INFO L130 PetriNetUnfolder]: 36/184 cut-off events. [2022-11-16 11:53:52,632 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-16 11:53:52,634 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-16 11:53:52,636 INFO L137 encePairwiseOnDemand]: 106/109 looper letters, 10 selfloop transitions, 0 changer transitions 1/92 dead transitions. [2022-11-16 11:53:52,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 222 flow [2022-11-16 11:53:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:53:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:53:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2022-11-16 11:53:52,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9311926605504587 [2022-11-16 11:53:52,651 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 203 transitions. [2022-11-16 11:53:52,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 203 transitions. [2022-11-16 11:53:52,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:52,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 203 transitions. [2022-11-16 11:53:52,658 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-16 11:53:52,662 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-16 11:53:52,663 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-16 11:53:52,665 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 208 flow. Second operand 2 states and 203 transitions. [2022-11-16 11:53:52,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 222 flow [2022-11-16 11:53:52,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 210 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 11:53:52,672 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 188 flow [2022-11-16 11:53:52,674 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-16 11:53:52,678 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2022-11-16 11:53:52,678 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 188 flow [2022-11-16 11:53:52,678 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-16 11:53:52,679 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:52,679 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-16 11:53:52,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:53:52,679 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-16 11:53:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash -203626695, now seen corresponding path program 1 times [2022-11-16 11:53:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:52,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228259722] [2022-11-16 11:53:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:53,367 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-16 11:53:53,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:53,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228259722] [2022-11-16 11:53:53,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228259722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:53,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:53,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:53:53,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767177466] [2022-11-16 11:53:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:53,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:53:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:53,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:53:53,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:53:53,379 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-11-16 11:53:53,381 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-16 11:53:53,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:53,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-11-16 11:53:53,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:53,635 INFO L130 PetriNetUnfolder]: 95/279 cut-off events. [2022-11-16 11:53:53,636 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-16 11:53:53,637 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-16 11:53:53,639 INFO L137 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2022-11-16 11:53:53,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 107 transitions, 300 flow [2022-11-16 11:53:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:53:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:53:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-11-16 11:53:53,643 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8042813455657493 [2022-11-16 11:53:53,644 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2022-11-16 11:53:53,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2022-11-16 11:53:53,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:53,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2022-11-16 11:53:53,647 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-16 11:53:53,650 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-16 11:53:53,650 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-16 11:53:53,651 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 188 flow. Second operand 6 states and 526 transitions. [2022-11-16 11:53:53,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 107 transitions, 300 flow [2022-11-16 11:53:53,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 107 transitions, 300 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:53:53,654 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 213 flow [2022-11-16 11:53:53,654 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-16 11:53:53,655 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2022-11-16 11:53:53,655 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 213 flow [2022-11-16 11:53:53,656 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-16 11:53:53,656 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:53,656 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-16 11:53:53,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:53:53,657 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-16 11:53:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 803045999, now seen corresponding path program 2 times [2022-11-16 11:53:53,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:53,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232032548] [2022-11-16 11:53:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:53,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:54,020 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-16 11:53:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:54,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232032548] [2022-11-16 11:53:54,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232032548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:54,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:54,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:53:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835890934] [2022-11-16 11:53:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:54,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:53:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:53:54,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:53:54,027 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-11-16 11:53:54,027 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-16 11:53:54,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:54,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-11-16 11:53:54,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:54,268 INFO L130 PetriNetUnfolder]: 99/326 cut-off events. [2022-11-16 11:53:54,268 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-16 11:53:54,272 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-16 11:53:54,274 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2022-11-16 11:53:54,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 112 transitions, 341 flow [2022-11-16 11:53:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:53:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:53:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-11-16 11:53:54,279 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-11-16 11:53:54,279 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-11-16 11:53:54,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-11-16 11:53:54,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:54,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-11-16 11:53:54,282 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-16 11:53:54,285 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-16 11:53:54,286 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-16 11:53:54,286 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 213 flow. Second operand 7 states and 612 transitions. [2022-11-16 11:53:54,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 112 transitions, 341 flow [2022-11-16 11:53:54,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 112 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:53:54,294 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 239 flow [2022-11-16 11:53:54,294 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-16 11:53:54,297 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2022-11-16 11:53:54,297 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 239 flow [2022-11-16 11:53:54,297 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-16 11:53:54,298 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:54,298 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-16 11:53:54,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:53:54,299 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-16 11:53:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash -155097821, now seen corresponding path program 3 times [2022-11-16 11:53:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:54,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258504076] [2022-11-16 11:53:54,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:54,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:53:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:54,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258504076] [2022-11-16 11:53:54,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258504076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:54,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:54,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:53:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159751983] [2022-11-16 11:53:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:54,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:53:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:54,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:53:54,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:53:54,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-16 11:53:54,639 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-16 11:53:54,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:54,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-16 11:53:54,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:54,902 INFO L130 PetriNetUnfolder]: 224/608 cut-off events. [2022-11-16 11:53:54,902 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2022-11-16 11:53:54,904 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 158 conditions per place. [2022-11-16 11:53:54,907 INFO L137 encePairwiseOnDemand]: 98/109 looper letters, 33 selfloop transitions, 7 changer transitions 36/142 dead transitions. [2022-11-16 11:53:54,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 142 transitions, 539 flow [2022-11-16 11:53:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:53:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:53:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2022-11-16 11:53:54,910 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.799184505606524 [2022-11-16 11:53:54,910 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2022-11-16 11:53:54,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2022-11-16 11:53:54,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:54,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2022-11-16 11:53:54,913 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-16 11:53:54,915 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-16 11:53:54,916 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-16 11:53:54,916 INFO L175 Difference]: Start difference. First operand has 104 places, 95 transitions, 239 flow. Second operand 9 states and 784 transitions. [2022-11-16 11:53:54,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 142 transitions, 539 flow [2022-11-16 11:53:54,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 526 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:53:54,921 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 281 flow [2022-11-16 11:53:54,921 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-16 11:53:54,922 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2022-11-16 11:53:54,922 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 281 flow [2022-11-16 11:53:54,922 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-16 11:53:54,923 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:54,923 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-16 11:53:54,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:53:54,931 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-16 11:53:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:54,932 INFO L85 PathProgramCache]: Analyzing trace with hash 646424208, now seen corresponding path program 1 times [2022-11-16 11:53:54,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:54,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245207562] [2022-11-16 11:53:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:55,120 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-16 11:53:55,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:55,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245207562] [2022-11-16 11:53:55,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245207562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:55,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:55,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:53:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623269093] [2022-11-16 11:53:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:55,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:53:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:53:55,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:53:55,123 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-16 11:53:55,124 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-16 11:53:55,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:55,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-16 11:53:55,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:55,362 INFO L130 PetriNetUnfolder]: 323/803 cut-off events. [2022-11-16 11:53:55,363 INFO L131 PetriNetUnfolder]: For 645/652 co-relation queries the response was YES. [2022-11-16 11:53:55,365 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-16 11:53:55,384 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 55 selfloop transitions, 18 changer transitions 6/148 dead transitions. [2022-11-16 11:53:55,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 678 flow [2022-11-16 11:53:55,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:53:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:53:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-11-16 11:53:55,386 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-11-16 11:53:55,387 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-11-16 11:53:55,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-11-16 11:53:55,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:55,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-11-16 11:53:55,389 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-16 11:53:55,390 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-16 11:53:55,391 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-16 11:53:55,391 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 281 flow. Second operand 7 states and 652 transitions. [2022-11-16 11:53:55,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 678 flow [2022-11-16 11:53:55,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 148 transitions, 650 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-16 11:53:55,397 INFO L231 Difference]: Finished difference. Result has 116 places, 110 transitions, 420 flow [2022-11-16 11:53:55,397 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-16 11:53:55,398 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2022-11-16 11:53:55,398 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 420 flow [2022-11-16 11:53:55,399 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-16 11:53:55,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:55,399 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-16 11:53:55,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:53:55,399 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-16 11:53:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:55,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1168475766, now seen corresponding path program 2 times [2022-11-16 11:53:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:55,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124656618] [2022-11-16 11:53:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:55,703 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-16 11:53:55,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:55,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124656618] [2022-11-16 11:53:55,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124656618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:55,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:55,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:53:55,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584059119] [2022-11-16 11:53:55,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:55,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:53:55,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:55,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:53:55,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:53:55,706 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-16 11:53:55,706 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-16 11:53:55,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:55,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-16 11:53:55,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:56,154 INFO L130 PetriNetUnfolder]: 433/1135 cut-off events. [2022-11-16 11:53:56,154 INFO L131 PetriNetUnfolder]: For 2068/2084 co-relation queries the response was YES. [2022-11-16 11:53:56,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 1135 events. 433/1135 cut-off events. For 2068/2084 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 237 conditions per place. [2022-11-16 11:53:56,166 INFO L137 encePairwiseOnDemand]: 97/109 looper letters, 68 selfloop transitions, 10 changer transitions 38/182 dead transitions. [2022-11-16 11:53:56,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 1095 flow [2022-11-16 11:53:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:53:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:53:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 931 transitions. [2022-11-16 11:53:56,169 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7764804003336113 [2022-11-16 11:53:56,169 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 931 transitions. [2022-11-16 11:53:56,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 931 transitions. [2022-11-16 11:53:56,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:56,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 931 transitions. [2022-11-16 11:53:56,172 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-16 11:53:56,174 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-16 11:53:56,175 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-16 11:53:56,175 INFO L175 Difference]: Start difference. First operand has 116 places, 110 transitions, 420 flow. Second operand 11 states and 931 transitions. [2022-11-16 11:53:56,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 1095 flow [2022-11-16 11:53:56,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:53:56,187 INFO L231 Difference]: Finished difference. Result has 130 places, 112 transitions, 486 flow [2022-11-16 11:53:56,188 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-16 11:53:56,188 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-11-16 11:53:56,189 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 486 flow [2022-11-16 11:53:56,189 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-16 11:53:56,189 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:56,189 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-16 11:53:56,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:53:56,190 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-16 11:53:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1985668940, now seen corresponding path program 3 times [2022-11-16 11:53:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:56,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516548950] [2022-11-16 11:53:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:56,392 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-16 11:53:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:56,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516548950] [2022-11-16 11:53:56,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516548950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:56,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:56,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:53:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013706207] [2022-11-16 11:53:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:56,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:53:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:53:56,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:53:56,395 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-16 11:53:56,395 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-16 11:53:56,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:56,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-16 11:53:56,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:56,763 INFO L130 PetriNetUnfolder]: 594/1490 cut-off events. [2022-11-16 11:53:56,764 INFO L131 PetriNetUnfolder]: For 4339/4366 co-relation queries the response was YES. [2022-11-16 11:53:56,769 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-16 11:53:56,778 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 74 selfloop transitions, 30 changer transitions 2/175 dead transitions. [2022-11-16 11:53:56,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 175 transitions, 1212 flow [2022-11-16 11:53:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:53:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:53:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2022-11-16 11:53:56,781 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8558322411533421 [2022-11-16 11:53:56,781 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2022-11-16 11:53:56,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2022-11-16 11:53:56,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:56,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2022-11-16 11:53:56,783 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-16 11:53:56,784 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-16 11:53:56,785 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-16 11:53:56,785 INFO L175 Difference]: Start difference. First operand has 130 places, 112 transitions, 486 flow. Second operand 7 states and 653 transitions. [2022-11-16 11:53:56,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 175 transitions, 1212 flow [2022-11-16 11:53:56,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 175 transitions, 1149 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-11-16 11:53:56,807 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 785 flow [2022-11-16 11:53:56,807 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-16 11:53:56,808 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-11-16 11:53:56,808 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 785 flow [2022-11-16 11:53:56,808 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-16 11:53:56,808 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:56,809 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-16 11:53:56,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:53:56,809 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-16 11:53:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:56,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2045345146, now seen corresponding path program 4 times [2022-11-16 11:53:56,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:56,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089581079] [2022-11-16 11:53:56,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:56,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:57,077 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-16 11:53:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:57,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089581079] [2022-11-16 11:53:57,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089581079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:57,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:57,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:53:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974905343] [2022-11-16 11:53:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:57,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:53:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:53:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:53:57,081 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-16 11:53:57,081 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-16 11:53:57,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:57,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-16 11:53:57,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:57,659 INFO L130 PetriNetUnfolder]: 832/2072 cut-off events. [2022-11-16 11:53:57,659 INFO L131 PetriNetUnfolder]: For 8163/8197 co-relation queries the response was YES. [2022-11-16 11:53:57,666 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-16 11:53:57,683 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 98 selfloop transitions, 49 changer transitions 22/238 dead transitions. [2022-11-16 11:53:57,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 238 transitions, 2090 flow [2022-11-16 11:53:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:53:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:53:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2022-11-16 11:53:57,686 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8572884811416922 [2022-11-16 11:53:57,686 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 841 transitions. [2022-11-16 11:53:57,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 841 transitions. [2022-11-16 11:53:57,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:57,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 841 transitions. [2022-11-16 11:53:57,689 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-16 11:53:57,692 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-16 11:53:57,693 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-16 11:53:57,693 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 785 flow. Second operand 9 states and 841 transitions. [2022-11-16 11:53:57,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 238 transitions, 2090 flow [2022-11-16 11:53:57,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 238 transitions, 2080 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-11-16 11:53:57,730 INFO L231 Difference]: Finished difference. Result has 146 places, 157 transitions, 1337 flow [2022-11-16 11:53:57,731 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-16 11:53:57,734 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 48 predicate places. [2022-11-16 11:53:57,734 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 1337 flow [2022-11-16 11:53:57,734 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-16 11:53:57,735 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:57,735 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-16 11:53:57,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:53:57,735 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-16 11:53:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1960688464, now seen corresponding path program 5 times [2022-11-16 11:53:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:57,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736133579] [2022-11-16 11:53:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:57,997 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-16 11:53:57,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:57,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736133579] [2022-11-16 11:53:57,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736133579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:57,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:57,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:53:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278432835] [2022-11-16 11:53:57,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:57,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:53:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:53:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:53:58,001 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-16 11:53:58,002 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-16 11:53:58,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:58,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-16 11:53:58,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:58,628 INFO L130 PetriNetUnfolder]: 871/2130 cut-off events. [2022-11-16 11:53:58,628 INFO L131 PetriNetUnfolder]: For 11903/11955 co-relation queries the response was YES. [2022-11-16 11:53:58,637 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-16 11:53:58,655 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 88 selfloop transitions, 64 changer transitions 3/224 dead transitions. [2022-11-16 11:53:58,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 224 transitions, 2274 flow [2022-11-16 11:53:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:53:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:53:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2022-11-16 11:53:58,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8491335372069317 [2022-11-16 11:53:58,659 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2022-11-16 11:53:58,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2022-11-16 11:53:58,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:58,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2022-11-16 11:53:58,663 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-16 11:53:58,665 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-16 11:53:58,665 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-16 11:53:58,666 INFO L175 Difference]: Start difference. First operand has 146 places, 157 transitions, 1337 flow. Second operand 9 states and 833 transitions. [2022-11-16 11:53:58,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 224 transitions, 2274 flow [2022-11-16 11:53:58,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 224 transitions, 2226 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-11-16 11:53:58,731 INFO L231 Difference]: Finished difference. Result has 157 places, 171 transitions, 1734 flow [2022-11-16 11:53:58,732 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-16 11:53:58,732 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 59 predicate places. [2022-11-16 11:53:58,733 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 171 transitions, 1734 flow [2022-11-16 11:53:58,733 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-16 11:53:58,733 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:58,734 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-16 11:53:58,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:53:58,734 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-16 11:53:58,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash -854605854, now seen corresponding path program 6 times [2022-11-16 11:53:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:58,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346865498] [2022-11-16 11:53:58,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:58,972 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-16 11:53:58,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:58,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346865498] [2022-11-16 11:53:58,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346865498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:58,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:58,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:53:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283930490] [2022-11-16 11:53:58,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:58,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:53:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:58,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:53:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:53:58,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-16 11:53:58,981 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-16 11:53:58,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:58,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-16 11:53:58,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:59,568 INFO L130 PetriNetUnfolder]: 853/2078 cut-off events. [2022-11-16 11:53:59,568 INFO L131 PetriNetUnfolder]: For 15342/15367 co-relation queries the response was YES. [2022-11-16 11:53:59,577 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-16 11:53:59,595 INFO L137 encePairwiseOnDemand]: 99/109 looper letters, 97 selfloop transitions, 38 changer transitions 10/214 dead transitions. [2022-11-16 11:53:59,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 214 transitions, 2540 flow [2022-11-16 11:53:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:53:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:53:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 723 transitions. [2022-11-16 11:53:59,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8291284403669725 [2022-11-16 11:53:59,598 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 723 transitions. [2022-11-16 11:53:59,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 723 transitions. [2022-11-16 11:53:59,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:59,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 723 transitions. [2022-11-16 11:53:59,601 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-16 11:53:59,603 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-16 11:53:59,603 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-16 11:53:59,604 INFO L175 Difference]: Start difference. First operand has 157 places, 171 transitions, 1734 flow. Second operand 8 states and 723 transitions. [2022-11-16 11:53:59,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 214 transitions, 2540 flow [2022-11-16 11:53:59,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 214 transitions, 2381 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-11-16 11:53:59,710 INFO L231 Difference]: Finished difference. Result has 162 places, 176 transitions, 1811 flow [2022-11-16 11:53:59,711 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-16 11:53:59,711 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 64 predicate places. [2022-11-16 11:53:59,711 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 176 transitions, 1811 flow [2022-11-16 11:53:59,712 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-16 11:53:59,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:59,712 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-16 11:53:59,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:53:59,713 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-16 11:53:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:59,713 INFO L85 PathProgramCache]: Analyzing trace with hash 630616034, now seen corresponding path program 7 times [2022-11-16 11:53:59,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:59,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866717409] [2022-11-16 11:53:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:59,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:59,937 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-16 11:53:59,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:59,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866717409] [2022-11-16 11:53:59,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866717409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:59,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:59,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:53:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719619556] [2022-11-16 11:53:59,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:59,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:53:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:53:59,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:53:59,940 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-11-16 11:53:59,941 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-16 11:53:59,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:59,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-11-16 11:53:59,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:00,442 INFO L130 PetriNetUnfolder]: 832/1897 cut-off events. [2022-11-16 11:54:00,443 INFO L131 PetriNetUnfolder]: For 14631/14675 co-relation queries the response was YES. [2022-11-16 11:54:00,451 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-16 11:54:00,464 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 110 selfloop transitions, 45 changer transitions 6/230 dead transitions. [2022-11-16 11:54:00,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 2690 flow [2022-11-16 11:54:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:54:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2022-11-16 11:54:00,466 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8479685452162516 [2022-11-16 11:54:00,466 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2022-11-16 11:54:00,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2022-11-16 11:54:00,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:00,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2022-11-16 11:54:00,469 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-16 11:54:00,470 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-16 11:54:00,471 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-16 11:54:00,471 INFO L175 Difference]: Start difference. First operand has 162 places, 176 transitions, 1811 flow. Second operand 7 states and 647 transitions. [2022-11-16 11:54:00,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 2690 flow [2022-11-16 11:54:00,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 230 transitions, 2583 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-11-16 11:54:00,543 INFO L231 Difference]: Finished difference. Result has 165 places, 176 transitions, 1851 flow [2022-11-16 11:54:00,543 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-16 11:54:00,544 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-11-16 11:54:00,544 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 176 transitions, 1851 flow [2022-11-16 11:54:00,545 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-16 11:54:00,545 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:00,545 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-16 11:54:00,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:54:00,545 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-16 11:54:00,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash 163698565, now seen corresponding path program 1 times [2022-11-16 11:54:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:00,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233044115] [2022-11-16 11:54:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:00,878 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-16 11:54:00,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233044115] [2022-11-16 11:54:00,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233044115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578279036] [2022-11-16 11:54:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:00,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:00,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:00,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:00,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:54:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:01,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:54:01,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:01,306 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-16 11:54:01,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:01,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578279036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:01,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:54:01,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-16 11:54:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465507224] [2022-11-16 11:54:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:01,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:54:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:54:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:54:01,310 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2022-11-16 11:54:01,310 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-16 11:54:01,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:01,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2022-11-16 11:54:01,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:01,799 INFO L130 PetriNetUnfolder]: 555/1551 cut-off events. [2022-11-16 11:54:01,799 INFO L131 PetriNetUnfolder]: For 10500/10615 co-relation queries the response was YES. [2022-11-16 11:54:01,811 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-16 11:54:01,824 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 35 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2022-11-16 11:54:01,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 1949 flow [2022-11-16 11:54:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:54:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:54:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-11-16 11:54:01,826 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256880733944955 [2022-11-16 11:54:01,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2022-11-16 11:54:01,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2022-11-16 11:54:01,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:01,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2022-11-16 11:54:01,829 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-16 11:54:01,830 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-16 11:54:01,830 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-16 11:54:01,831 INFO L175 Difference]: Start difference. First operand has 165 places, 176 transitions, 1851 flow. Second operand 5 states and 450 transitions. [2022-11-16 11:54:01,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 1949 flow [2022-11-16 11:54:01,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 181 transitions, 1874 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-16 11:54:01,894 INFO L231 Difference]: Finished difference. Result has 165 places, 179 transitions, 1810 flow [2022-11-16 11:54:01,894 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-16 11:54:01,895 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-11-16 11:54:01,895 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 179 transitions, 1810 flow [2022-11-16 11:54:01,896 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-16 11:54:01,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:01,896 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-16 11:54:01,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:02,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 11:54:02,102 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-16 11:54:02,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash 197696930, now seen corresponding path program 1 times [2022-11-16 11:54:02,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:02,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155885914] [2022-11-16 11:54:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:02,340 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-16 11:54:02,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:02,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155885914] [2022-11-16 11:54:02,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155885914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:02,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:02,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:54:02,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702883513] [2022-11-16 11:54:02,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:02,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:54:02,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:02,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:54:02,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:02,343 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-16 11:54:02,353 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-16 11:54:02,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:02,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-16 11:54:02,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:02,727 INFO L130 PetriNetUnfolder]: 629/1867 cut-off events. [2022-11-16 11:54:02,728 INFO L131 PetriNetUnfolder]: For 11724/11893 co-relation queries the response was YES. [2022-11-16 11:54:02,741 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-16 11:54:02,753 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 20 selfloop transitions, 7 changer transitions 0/184 dead transitions. [2022-11-16 11:54:02,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 184 transitions, 1891 flow [2022-11-16 11:54:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:54:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:54:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-11-16 11:54:02,755 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8458715596330275 [2022-11-16 11:54:02,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2022-11-16 11:54:02,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2022-11-16 11:54:02,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:02,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2022-11-16 11:54:02,757 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-16 11:54:02,758 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-16 11:54:02,759 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-16 11:54:02,759 INFO L175 Difference]: Start difference. First operand has 165 places, 179 transitions, 1810 flow. Second operand 5 states and 461 transitions. [2022-11-16 11:54:02,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 184 transitions, 1891 flow [2022-11-16 11:54:02,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 184 transitions, 1883 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:54:02,822 INFO L231 Difference]: Finished difference. Result has 167 places, 180 transitions, 1831 flow [2022-11-16 11:54:02,823 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-16 11:54:02,823 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 69 predicate places. [2022-11-16 11:54:02,823 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 180 transitions, 1831 flow [2022-11-16 11:54:02,824 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-16 11:54:02,824 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:02,824 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-16 11:54:02,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:54:02,825 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-16 11:54:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1486518978, now seen corresponding path program 1 times [2022-11-16 11:54:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:02,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920461307] [2022-11-16 11:54:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:03,068 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-16 11:54:03,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:03,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920461307] [2022-11-16 11:54:03,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920461307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:03,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162220512] [2022-11-16 11:54:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:03,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:03,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:03,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:03,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:54:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:03,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:54:03,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:03,369 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-16 11:54:03,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:03,514 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-16 11:54:03,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162220512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:54:03,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:54:03,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-11-16 11:54:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603686822] [2022-11-16 11:54:03,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:03,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:54:03,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:03,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:54:03,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:54:03,518 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-16 11:54:03,520 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-16 11:54:03,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:03,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-16 11:54:03,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:05,205 INFO L130 PetriNetUnfolder]: 2096/5348 cut-off events. [2022-11-16 11:54:05,205 INFO L131 PetriNetUnfolder]: For 37821/37989 co-relation queries the response was YES. [2022-11-16 11:54:05,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22597 conditions, 5348 events. 2096/5348 cut-off events. For 37821/37989 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-16 11:54:05,435 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 101 selfloop transitions, 118 changer transitions 166/465 dead transitions. [2022-11-16 11:54:05,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 465 transitions, 6561 flow [2022-11-16 11:54:05,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:54:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 11:54:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1809 transitions. [2022-11-16 11:54:05,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7903014416775884 [2022-11-16 11:54:05,441 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1809 transitions. [2022-11-16 11:54:05,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1809 transitions. [2022-11-16 11:54:05,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:05,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1809 transitions. [2022-11-16 11:54:05,448 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-16 11:54:05,453 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-16 11:54:05,455 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-16 11:54:05,455 INFO L175 Difference]: Start difference. First operand has 167 places, 180 transitions, 1831 flow. Second operand 21 states and 1809 transitions. [2022-11-16 11:54:05,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 465 transitions, 6561 flow [2022-11-16 11:54:05,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 465 transitions, 6550 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:54:05,655 INFO L231 Difference]: Finished difference. Result has 193 places, 258 transitions, 3423 flow [2022-11-16 11:54:05,655 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-16 11:54:05,656 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 95 predicate places. [2022-11-16 11:54:05,656 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 258 transitions, 3423 flow [2022-11-16 11:54:05,657 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-16 11:54:05,657 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:05,658 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-16 11:54:05,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:05,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:54:05,869 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-16 11:54:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1924608023, now seen corresponding path program 1 times [2022-11-16 11:54:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:05,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751199088] [2022-11-16 11:54:05,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:06,135 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-16 11:54:06,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:06,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751199088] [2022-11-16 11:54:06,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751199088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:06,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:06,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:54:06,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221105724] [2022-11-16 11:54:06,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:54:06,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:06,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:54:06,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:06,140 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-16 11:54:06,141 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-16 11:54:06,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:06,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-16 11:54:06,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:06,878 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-16 11:54:06,879 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-11-16 11:54:06,879 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-16 11:54:06,879 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-16 11:54:06,880 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-16 11:54:07,146 INFO L130 PetriNetUnfolder]: 1293/4073 cut-off events. [2022-11-16 11:54:07,147 INFO L131 PetriNetUnfolder]: For 42368/43073 co-relation queries the response was YES. [2022-11-16 11:54:07,182 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-16 11:54:07,211 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 43 selfloop transitions, 10 changer transitions 4/269 dead transitions. [2022-11-16 11:54:07,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 269 transitions, 3616 flow [2022-11-16 11:54:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:54:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:54:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-11-16 11:54:07,213 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8532110091743119 [2022-11-16 11:54:07,214 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2022-11-16 11:54:07,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2022-11-16 11:54:07,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:07,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2022-11-16 11:54:07,215 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-16 11:54:07,217 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-16 11:54:07,218 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-16 11:54:07,218 INFO L175 Difference]: Start difference. First operand has 193 places, 258 transitions, 3423 flow. Second operand 5 states and 465 transitions. [2022-11-16 11:54:07,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 269 transitions, 3616 flow [2022-11-16 11:54:07,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 269 transitions, 3482 flow, removed 62 selfloop flow, removed 6 redundant places. [2022-11-16 11:54:07,534 INFO L231 Difference]: Finished difference. Result has 187 places, 253 transitions, 3231 flow [2022-11-16 11:54:07,534 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-16 11:54:07,535 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 89 predicate places. [2022-11-16 11:54:07,535 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 253 transitions, 3231 flow [2022-11-16 11:54:07,535 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-16 11:54:07,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:07,536 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-16 11:54:07,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:54:07,536 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-16 11:54:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2102261404, now seen corresponding path program 2 times [2022-11-16 11:54:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:07,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463482452] [2022-11-16 11:54:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:07,777 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-16 11:54:07,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:07,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463482452] [2022-11-16 11:54:07,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463482452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:07,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679465078] [2022-11-16 11:54:07,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:54:07,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:07,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:07,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:54:07,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:54:07,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:07,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:54:07,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:08,028 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-16 11:54:08,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:08,106 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-16 11:54:08,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679465078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:54:08,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:54:08,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-11-16 11:54:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576783483] [2022-11-16 11:54:08,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:08,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:54:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:54:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:54:08,109 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-16 11:54:08,110 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-16 11:54:08,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:08,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-16 11:54:08,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:10,293 INFO L130 PetriNetUnfolder]: 2522/7805 cut-off events. [2022-11-16 11:54:10,293 INFO L131 PetriNetUnfolder]: For 79570/80425 co-relation queries the response was YES. [2022-11-16 11:54:10,354 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-16 11:54:10,411 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 76 selfloop transitions, 20 changer transitions 0/308 dead transitions. [2022-11-16 11:54:10,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 308 transitions, 3936 flow [2022-11-16 11:54:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:54:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-11-16 11:54:10,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-11-16 11:54:10,413 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-11-16 11:54:10,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-11-16 11:54:10,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:10,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-11-16 11:54:10,415 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-16 11:54:10,417 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-16 11:54:10,417 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-16 11:54:10,417 INFO L175 Difference]: Start difference. First operand has 187 places, 253 transitions, 3231 flow. Second operand 7 states and 652 transitions. [2022-11-16 11:54:10,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 308 transitions, 3936 flow [2022-11-16 11:54:10,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 308 transitions, 3917 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-16 11:54:10,783 INFO L231 Difference]: Finished difference. Result has 192 places, 265 transitions, 3437 flow [2022-11-16 11:54:10,784 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-16 11:54:10,784 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 94 predicate places. [2022-11-16 11:54:10,784 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 265 transitions, 3437 flow [2022-11-16 11:54:10,785 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-16 11:54:10,785 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:10,785 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-16 11:54:10,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:10,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:54:10,992 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-16 11:54:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -996978199, now seen corresponding path program 1 times [2022-11-16 11:54:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:10,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617345275] [2022-11-16 11:54:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:11,362 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-16 11:54:11,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:11,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617345275] [2022-11-16 11:54:11,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617345275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:11,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946294953] [2022-11-16 11:54:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:11,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:11,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:11,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:54:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:11,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:54:11,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:11,676 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-16 11:54:11,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:11,828 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-16 11:54:11,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946294953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:54:11,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:54:11,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-11-16 11:54:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634875057] [2022-11-16 11:54:11,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:11,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:54:11,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:11,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:54:11,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:54:11,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-16 11:54:11,834 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-16 11:54:11,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:11,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-16 11:54:11,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:17,597 INFO L130 PetriNetUnfolder]: 8450/21732 cut-off events. [2022-11-16 11:54:17,597 INFO L131 PetriNetUnfolder]: For 256655/258261 co-relation queries the response was YES. [2022-11-16 11:54:17,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114620 conditions, 21732 events. 8450/21732 cut-off events. For 256655/258261 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-16 11:54:17,873 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 124 selfloop transitions, 307 changer transitions 241/752 dead transitions. [2022-11-16 11:54:17,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 752 transitions, 12837 flow [2022-11-16 11:54:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:54:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-16 11:54:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2244 transitions. [2022-11-16 11:54:17,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7918136908962597 [2022-11-16 11:54:17,878 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2244 transitions. [2022-11-16 11:54:17,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2244 transitions. [2022-11-16 11:54:17,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:17,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2244 transitions. [2022-11-16 11:54:17,887 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-16 11:54:17,892 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-16 11:54:17,909 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-16 11:54:17,909 INFO L175 Difference]: Start difference. First operand has 192 places, 265 transitions, 3437 flow. Second operand 26 states and 2244 transitions. [2022-11-16 11:54:17,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 752 transitions, 12837 flow [2022-11-16 11:54:19,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 752 transitions, 12775 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-11-16 11:54:19,382 INFO L231 Difference]: Finished difference. Result has 228 places, 459 transitions, 7833 flow [2022-11-16 11:54:19,383 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-16 11:54:19,383 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 130 predicate places. [2022-11-16 11:54:19,384 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 459 transitions, 7833 flow [2022-11-16 11:54:19,385 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-16 11:54:19,385 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:19,385 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-16 11:54:19,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:19,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 11:54:19,591 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-16 11:54:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1640528810, now seen corresponding path program 2 times [2022-11-16 11:54:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:19,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180525233] [2022-11-16 11:54:19,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:19,888 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-16 11:54:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:19,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180525233] [2022-11-16 11:54:19,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180525233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:19,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440683201] [2022-11-16 11:54:19,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:54:19,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:19,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:19,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:19,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:54:20,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:54:20,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:20,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:54:20,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:20,163 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-16 11:54:20,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:20,264 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-16 11:54:20,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440683201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:54:20,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:54:20,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-11-16 11:54:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130997131] [2022-11-16 11:54:20,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:20,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:54:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:54:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:54:20,269 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-16 11:54:20,270 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-16 11:54:20,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:20,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-16 11:54:20,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:54:21,393 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-16 11:54:21,394 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-11-16 11:54:21,394 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-16 11:54:21,394 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-16 11:54:21,394 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-16 11:54:22,248 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-16 11:54:22,249 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-11-16 11:54:22,249 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-16 11:54:22,249 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-16 11:54:22,249 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-16 11:54:26,213 INFO L130 PetriNetUnfolder]: 7045/22414 cut-off events. [2022-11-16 11:54:26,213 INFO L131 PetriNetUnfolder]: For 436850/440412 co-relation queries the response was YES. [2022-11-16 11:54:26,512 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-16 11:54:26,717 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 167 selfloop transitions, 50 changer transitions 40/576 dead transitions. [2022-11-16 11:54:26,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 576 transitions, 10186 flow [2022-11-16 11:54:26,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:54:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2022-11-16 11:54:26,723 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2022-11-16 11:54:26,723 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2022-11-16 11:54:26,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2022-11-16 11:54:26,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:54:26,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2022-11-16 11:54:26,725 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-16 11:54:26,727 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-16 11:54:26,727 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-16 11:54:26,728 INFO L175 Difference]: Start difference. First operand has 228 places, 459 transitions, 7833 flow. Second operand 7 states and 658 transitions. [2022-11-16 11:54:26,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 576 transitions, 10186 flow [2022-11-16 11:54:31,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 576 transitions, 9502 flow, removed 331 selfloop flow, removed 5 redundant places. [2022-11-16 11:54:31,781 INFO L231 Difference]: Finished difference. Result has 230 places, 457 transitions, 7599 flow [2022-11-16 11:54:31,782 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-16 11:54:31,782 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 132 predicate places. [2022-11-16 11:54:31,783 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 457 transitions, 7599 flow [2022-11-16 11:54:31,783 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-16 11:54:31,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:54:31,784 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-16 11:54:31,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 11:54:31,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:54:31,985 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-16 11:54:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -101082531, now seen corresponding path program 3 times [2022-11-16 11:54:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:31,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955905549] [2022-11-16 11:54:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:32,294 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-16 11:54:32,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:32,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955905549] [2022-11-16 11:54:32,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955905549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:32,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680457899] [2022-11-16 11:54:32,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:54:32,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:32,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:32,298 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:32,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb409116-8693-4fcc-940a-4e3a2f8e0700/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:54:32,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 11:54:32,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:32,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 11:54:32,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:32,714 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-16 11:54:32,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:33,078 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-16 11:54:33,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680457899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:54:33,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:54:33,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 21 [2022-11-16 11:54:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158711349] [2022-11-16 11:54:33,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:33,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 11:54:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:33,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 11:54:33,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:54:33,084 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-16 11:54:33,087 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-16 11:54:33,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:54:33,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-16 11:54:33,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand