./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 20:10:28,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:10:28,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:10:28,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:10:28,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:10:28,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:10:28,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:10:28,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:10:28,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:10:28,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:10:28,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:10:28,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:10:28,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:10:28,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:10:28,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:10:28,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:10:28,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:10:28,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:10:28,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:10:28,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:10:28,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:10:28,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:10:28,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:10:28,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:10:28,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:10:28,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:10:28,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:10:28,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:10:28,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:10:28,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:10:28,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:10:28,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:10:28,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:10:28,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:10:28,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:10:28,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:10:28,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:10:28,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:10:28,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:10:28,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:10:28,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:10:28,456 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:10:28,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:10:28,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:10:28,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:10:28,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:10:28,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:10:28,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:10:28,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:10:28,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:10:28,505 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:10:28,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:10:28,507 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:10:28,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:10:28,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:10:28,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:10:28,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:10:28,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:10:28,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:10:28,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:10:28,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:10:28,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:10:28,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:10:28,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:10:28,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:10:28,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:10:28,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:10:28,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:10:28,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:10:28,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:10:28,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:10:28,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:10:28,512 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:10:28,512 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:10:28,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:10:28,513 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_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/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_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc 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-02 20:10:28,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:10:28,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:10:28,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:10:28,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:10:28,808 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:10:28,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-11-02 20:10:28,879 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/data/1afdc4ecd/b305bd39a87c41faa9bcb6e59e64173d/FLAG27e5f9a09 [2022-11-02 20:10:29,322 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:10:29,323 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-11-02 20:10:29,329 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/data/1afdc4ecd/b305bd39a87c41faa9bcb6e59e64173d/FLAG27e5f9a09 [2022-11-02 20:10:29,710 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/data/1afdc4ecd/b305bd39a87c41faa9bcb6e59e64173d [2022-11-02 20:10:29,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:10:29,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:10:29,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:10:29,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:10:29,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:10:29,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:10:29" (1/1) ... [2022-11-02 20:10:29,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3e87c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:29, skipping insertion in model container [2022-11-02 20:10:29,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:10:29" (1/1) ... [2022-11-02 20:10:29,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:10:29,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:10:29,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-11-02 20:10:29,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:10:29,979 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:10:30,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-11-02 20:10:30,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:10:30,017 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:10:30,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30 WrapperNode [2022-11-02 20:10:30,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:10:30,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:10:30,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:10:30,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:10:30,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,056 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-02 20:10:30,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:10:30,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:10:30,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:10:30,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:10:30,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,080 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:10:30,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:10:30,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:10:30,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:10:30,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (1/1) ... [2022-11-02 20:10:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:10:30,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:30,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:10:30,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:10:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:10:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:10:30,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:10:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:10:30,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:10:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:10:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:10:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:10:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:10:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:10:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:10:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:10:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:10:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:10:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:10:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:10:30,165 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:10:30,265 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:10:30,267 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:10:30,630 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:10:30,761 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:10:30,762 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:10:30,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:10:30 BoogieIcfgContainer [2022-11-02 20:10:30,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:10:30,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:10:30,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:10:30,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:10:30,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:10:29" (1/3) ... [2022-11-02 20:10:30,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcfbcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:10:30, skipping insertion in model container [2022-11-02 20:10:30,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:10:30" (2/3) ... [2022-11-02 20:10:30,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcfbcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:10:30, skipping insertion in model container [2022-11-02 20:10:30,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:10:30" (3/3) ... [2022-11-02 20:10:30,775 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-11-02 20:10:30,784 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:10:30,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:10:30,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:10:30,796 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:10:30,869 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:10:30,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-11-02 20:10:30,974 INFO L130 PetriNetUnfolder]: 7/106 cut-off events. [2022-11-02 20:10:30,975 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:10:30,979 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-02 20:10:30,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 242 flow [2022-11-02 20:10:30,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 208 flow [2022-11-02 20:10:30,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:10:31,002 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;@7c5ba842, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:10:31,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 20:10:31,036 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2022-11-02 20:10:31,037 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:10:31,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:31,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:31,038 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-02 20:10:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash -865060603, now seen corresponding path program 1 times [2022-11-02 20:10:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:31,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340183339] [2022-11-02 20:10:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:31,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:31,942 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-02 20:10:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:31,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340183339] [2022-11-02 20:10:31,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340183339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:31,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:31,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:10:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891320343] [2022-11-02 20:10:31,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:31,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:10:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:32,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:10:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:10:32,019 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-11-02 20:10:32,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:32,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:32,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-11-02 20:10:32,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:32,292 INFO L130 PetriNetUnfolder]: 105/322 cut-off events. [2022-11-02 20:10:32,292 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-02 20:10:32,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 322 events. 105/322 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1269 event pairs, 13 based on Foata normal form. 15/309 useless extension candidates. Maximal degree in co-relation 436. Up to 71 conditions per place. [2022-11-02 20:10:32,297 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 34 selfloop transitions, 6 changer transitions 1/109 dead transitions. [2022-11-02 20:10:32,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 327 flow [2022-11-02 20:10:32,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:10:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:10:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions. [2022-11-02 20:10:32,319 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8165137614678899 [2022-11-02 20:10:32,320 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 534 transitions. [2022-11-02 20:10:32,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions. [2022-11-02 20:10:32,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:32,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions. [2022-11-02 20:10:32,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:32,345 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-02 20:10:32,347 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-02 20:10:32,348 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 208 flow. Second operand 6 states and 534 transitions. [2022-11-02 20:10:32,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 327 flow [2022-11-02 20:10:32,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 309 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:10:32,360 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 213 flow [2022-11-02 20:10:32,362 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2022-11-02 20:10:32,367 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2022-11-02 20:10:32,367 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 213 flow [2022-11-02 20:10:32,368 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-02 20:10:32,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:32,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:32,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:10:32,369 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-02 20:10:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1188549913, now seen corresponding path program 2 times [2022-11-02 20:10:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:32,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638513154] [2022-11-02 20:10:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:32,890 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-02 20:10:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:32,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638513154] [2022-11-02 20:10:32,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638513154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:32,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:32,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:10:32,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375154333] [2022-11-02 20:10:32,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:32,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:10:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:32,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:10:32,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:10:32,902 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-11-02 20:10:32,909 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-02 20:10:32,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:32,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-11-02 20:10:32,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:33,150 INFO L130 PetriNetUnfolder]: 95/285 cut-off events. [2022-11-02 20:10:33,150 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-02 20:10:33,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 285 events. 95/285 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1031 event pairs, 2 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 262. Up to 71 conditions per place. [2022-11-02 20:10:33,156 INFO L137 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2022-11-02 20:10:33,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 339 flow [2022-11-02 20:10:33,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:10:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:10:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-11-02 20:10:33,161 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8042813455657493 [2022-11-02 20:10:33,162 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2022-11-02 20:10:33,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2022-11-02 20:10:33,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:33,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2022-11-02 20:10:33,165 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-02 20:10:33,167 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-02 20:10:33,168 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-02 20:10:33,168 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 213 flow. Second operand 6 states and 526 transitions. [2022-11-02 20:10:33,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 339 flow [2022-11-02 20:10:33,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 330 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:10:33,173 INFO L231 Difference]: Finished difference. Result has 102 places, 96 transitions, 243 flow [2022-11-02 20:10:33,174 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=102, PETRI_TRANSITIONS=96} [2022-11-02 20:10:33,175 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2022-11-02 20:10:33,175 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 243 flow [2022-11-02 20:10:33,175 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-02 20:10:33,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:33,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:33,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:10:33,176 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-02 20:10:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2012930813, now seen corresponding path program 3 times [2022-11-02 20:10:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:33,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690297394] [2022-11-02 20:10:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:33,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:33,496 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-02 20:10:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:33,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690297394] [2022-11-02 20:10:33,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690297394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:33,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:33,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:10:33,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196294082] [2022-11-02 20:10:33,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:33,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:10:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:33,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:10:33,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:10:33,500 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-11-02 20:10:33,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 96 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:33,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:33,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-11-02 20:10:33,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:33,675 INFO L130 PetriNetUnfolder]: 99/292 cut-off events. [2022-11-02 20:10:33,676 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-02 20:10:33,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 292 events. 99/292 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1050 event pairs, 2 based on Foata normal form. 3/271 useless extension candidates. Maximal degree in co-relation 301. Up to 71 conditions per place. [2022-11-02 20:10:33,679 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2022-11-02 20:10:33,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 114 transitions, 379 flow [2022-11-02 20:10:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:10:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:10:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-11-02 20:10:33,683 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-11-02 20:10:33,684 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-11-02 20:10:33,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-11-02 20:10:33,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:33,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-11-02 20:10:33,686 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-02 20:10:33,688 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-02 20:10:33,688 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-02 20:10:33,689 INFO L175 Difference]: Start difference. First operand has 102 places, 96 transitions, 243 flow. Second operand 7 states and 612 transitions. [2022-11-02 20:10:33,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 114 transitions, 379 flow [2022-11-02 20:10:33,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 114 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:10:33,693 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 273 flow [2022-11-02 20:10:33,693 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2022-11-02 20:10:33,694 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2022-11-02 20:10:33,694 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 273 flow [2022-11-02 20:10:33,694 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-02 20:10:33,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:33,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:10:33,695 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-02 20:10:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 881553717, now seen corresponding path program 4 times [2022-11-02 20:10:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820636678] [2022-11-02 20:10:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:33,921 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-02 20:10:33,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:33,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820636678] [2022-11-02 20:10:33,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820636678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:33,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:33,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:10:33,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567375680] [2022-11-02 20:10:33,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:33,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:10:33,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:33,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:10:33,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:10:33,924 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-11-02 20:10:33,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:33,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:33,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-11-02 20:10:33,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:34,102 INFO L130 PetriNetUnfolder]: 114/363 cut-off events. [2022-11-02 20:10:34,102 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-11-02 20:10:34,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 363 events. 114/363 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1559 event pairs, 14 based on Foata normal form. 5/342 useless extension candidates. Maximal degree in co-relation 400. Up to 63 conditions per place. [2022-11-02 20:10:34,105 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2022-11-02 20:10:34,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 415 flow [2022-11-02 20:10:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:10:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:10:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-11-02 20:10:34,134 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-11-02 20:10:34,134 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-11-02 20:10:34,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-11-02 20:10:34,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:34,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-11-02 20:10:34,141 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-02 20:10:34,143 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-02 20:10:34,144 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-02 20:10:34,144 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 273 flow. Second operand 7 states and 612 transitions. [2022-11-02 20:10:34,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 415 flow [2022-11-02 20:10:34,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 402 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:10:34,150 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 301 flow [2022-11-02 20:10:34,152 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2022-11-02 20:10:34,154 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 13 predicate places. [2022-11-02 20:10:34,154 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 301 flow [2022-11-02 20:10:34,155 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-02 20:10:34,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:34,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:34,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:10:34,155 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-02 20:10:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1556043023, now seen corresponding path program 5 times [2022-11-02 20:10:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:34,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368550107] [2022-11-02 20:10:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:34,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:34,481 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-02 20:10:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368550107] [2022-11-02 20:10:34,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368550107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:34,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:34,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:10:34,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071503759] [2022-11-02 20:10:34,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:34,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:10:34,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:10:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:10:34,485 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-02 20:10:34,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:34,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:34,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-02 20:10:34,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:34,769 INFO L130 PetriNetUnfolder]: 264/720 cut-off events. [2022-11-02 20:10:34,769 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-11-02 20:10:34,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 720 events. 264/720 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4109 event pairs, 32 based on Foata normal form. 8/667 useless extension candidates. Maximal degree in co-relation 1126. Up to 179 conditions per place. [2022-11-02 20:10:34,775 INFO L137 encePairwiseOnDemand]: 98/109 looper letters, 36 selfloop transitions, 7 changer transitions 38/148 dead transitions. [2022-11-02 20:10:34,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 148 transitions, 660 flow [2022-11-02 20:10:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:10:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:10:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2022-11-02 20:10:34,777 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.799184505606524 [2022-11-02 20:10:34,777 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2022-11-02 20:10:34,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2022-11-02 20:10:34,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:34,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2022-11-02 20:10:34,780 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-02 20:10:34,782 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-02 20:10:34,782 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-02 20:10:34,783 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 301 flow. Second operand 9 states and 784 transitions. [2022-11-02 20:10:34,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 148 transitions, 660 flow [2022-11-02 20:10:34,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 148 transitions, 644 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:10:34,788 INFO L231 Difference]: Finished difference. Result has 120 places, 101 transitions, 333 flow [2022-11-02 20:10:34,789 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=120, PETRI_TRANSITIONS=101} [2022-11-02 20:10:34,789 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 22 predicate places. [2022-11-02 20:10:34,790 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 101 transitions, 333 flow [2022-11-02 20:10:34,790 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-02 20:10:34,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:34,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:34,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:10:34,791 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-02 20:10:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1039507564, now seen corresponding path program 1 times [2022-11-02 20:10:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:34,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445812874] [2022-11-02 20:10:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:34,973 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-02 20:10:34,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:34,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445812874] [2022-11-02 20:10:34,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445812874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:34,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:34,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:10:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821213948] [2022-11-02 20:10:34,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:34,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:10:34,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:34,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:10:34,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:10:34,976 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-02 20:10:34,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 101 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:34,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:34,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-02 20:10:34,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:35,057 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][80], [72#L96true, 83#L57true, Black: 154#true, 56#L115-4true, Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 167#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 141#true, Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 172#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 19#L83true, Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 188#true, Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:35,057 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,057 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,057 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,057 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,069 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][80], [72#L96true, 83#L57true, Black: 154#true, 56#L115-4true, Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 167#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 141#true, Black: 172#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 19#L83true, Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 188#true, Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:35,069 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,070 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,070 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,070 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,070 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:10:35,088 INFO L130 PetriNetUnfolder]: 98/393 cut-off events. [2022-11-02 20:10:35,088 INFO L131 PetriNetUnfolder]: For 479/488 co-relation queries the response was YES. [2022-11-02 20:10:35,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 393 events. 98/393 cut-off events. For 479/488 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1722 event pairs, 2 based on Foata normal form. 11/367 useless extension candidates. Maximal degree in co-relation 721. Up to 89 conditions per place. [2022-11-02 20:10:35,093 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 21 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2022-11-02 20:10:35,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 110 transitions, 419 flow [2022-11-02 20:10:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:10:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:10:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-11-02 20:10:35,095 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8532110091743119 [2022-11-02 20:10:35,095 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2022-11-02 20:10:35,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2022-11-02 20:10:35,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:35,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2022-11-02 20:10:35,097 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-02 20:10:35,098 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-02 20:10:35,098 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-02 20:10:35,099 INFO L175 Difference]: Start difference. First operand has 120 places, 101 transitions, 333 flow. Second operand 5 states and 465 transitions. [2022-11-02 20:10:35,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 110 transitions, 419 flow [2022-11-02 20:10:35,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 403 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-02 20:10:35,104 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 342 flow [2022-11-02 20:10:35,104 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2022-11-02 20:10:35,105 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2022-11-02 20:10:35,105 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 342 flow [2022-11-02 20:10:35,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:35,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:35,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:35,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:10:35,106 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-02 20:10:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash 351082327, now seen corresponding path program 1 times [2022-11-02 20:10:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:35,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135560836] [2022-11-02 20:10:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:35,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:35,445 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-02 20:10:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:35,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135560836] [2022-11-02 20:10:35,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135560836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:10:35,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:10:35,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:10:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746105774] [2022-11-02 20:10:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:35,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:10:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:10:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:10:35,449 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-02 20:10:35,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:35,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:35,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-02 20:10:35,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:35,865 INFO L130 PetriNetUnfolder]: 412/1150 cut-off events. [2022-11-02 20:10:35,865 INFO L131 PetriNetUnfolder]: For 1383/1447 co-relation queries the response was YES. [2022-11-02 20:10:35,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 1150 events. 412/1150 cut-off events. For 1383/1447 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7370 event pairs, 46 based on Foata normal form. 13/1047 useless extension candidates. Maximal degree in co-relation 2008. Up to 332 conditions per place. [2022-11-02 20:10:35,876 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 48 selfloop transitions, 10 changer transitions 30/153 dead transitions. [2022-11-02 20:10:35,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 153 transitions, 809 flow [2022-11-02 20:10:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:10:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:10:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 922 transitions. [2022-11-02 20:10:35,879 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7689741451209341 [2022-11-02 20:10:35,879 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 922 transitions. [2022-11-02 20:10:35,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 922 transitions. [2022-11-02 20:10:35,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:35,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 922 transitions. [2022-11-02 20:10:35,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.81818181818181) internal successors, (922), 11 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:35,884 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-02 20:10:35,885 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-02 20:10:35,885 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 342 flow. Second operand 11 states and 922 transitions. [2022-11-02 20:10:35,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 153 transitions, 809 flow [2022-11-02 20:10:35,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 153 transitions, 797 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:10:35,892 INFO L231 Difference]: Finished difference. Result has 129 places, 106 transitions, 410 flow [2022-11-02 20:10:35,892 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=410, PETRI_PLACES=129, PETRI_TRANSITIONS=106} [2022-11-02 20:10:35,893 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 31 predicate places. [2022-11-02 20:10:35,893 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 106 transitions, 410 flow [2022-11-02 20:10:35,894 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-02 20:10:35,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:35,894 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:35,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:10:35,895 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-02 20:10:35,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:35,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1555529728, now seen corresponding path program 1 times [2022-11-02 20:10:35,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:35,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863897193] [2022-11-02 20:10:35,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:35,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:36,202 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-02 20:10:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:36,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863897193] [2022-11-02 20:10:36,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863897193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:36,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85701071] [2022-11-02 20:10:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:36,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:36,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:36,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:36,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:10:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:36,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:10:36,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:36,602 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-02 20:10:36,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:36,844 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-02 20:10:36,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85701071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:36,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:36,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-11-02 20:10:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638359262] [2022-11-02 20:10:36,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:36,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:10:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:36,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:10:36,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:10:36,849 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-02 20:10:36,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 106 transitions, 410 flow. Second operand has 14 states, 14 states have (on average 81.85714285714286) internal successors, (1146), 14 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:36,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:36,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-02 20:10:36,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:37,791 INFO L130 PetriNetUnfolder]: 725/1948 cut-off events. [2022-11-02 20:10:37,791 INFO L131 PetriNetUnfolder]: For 4218/4301 co-relation queries the response was YES. [2022-11-02 20:10:37,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 1948 events. 725/1948 cut-off events. For 4218/4301 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14575 event pairs, 14 based on Foata normal form. 20/1800 useless extension candidates. Maximal degree in co-relation 5291. Up to 334 conditions per place. [2022-11-02 20:10:37,814 INFO L137 encePairwiseOnDemand]: 95/109 looper letters, 66 selfloop transitions, 37 changer transitions 78/248 dead transitions. [2022-11-02 20:10:37,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 248 transitions, 1729 flow [2022-11-02 20:10:37,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:10:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:10:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1807 transitions. [2022-11-02 20:10:37,819 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7894276976845784 [2022-11-02 20:10:37,819 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1807 transitions. [2022-11-02 20:10:37,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1807 transitions. [2022-11-02 20:10:37,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:37,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1807 transitions. [2022-11-02 20:10:37,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.04761904761905) internal successors, (1807), 21 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:37,830 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-02 20:10:37,831 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-02 20:10:37,831 INFO L175 Difference]: Start difference. First operand has 129 places, 106 transitions, 410 flow. Second operand 21 states and 1807 transitions. [2022-11-02 20:10:37,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 248 transitions, 1729 flow [2022-11-02 20:10:37,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 248 transitions, 1636 flow, removed 38 selfloop flow, removed 8 redundant places. [2022-11-02 20:10:37,852 INFO L231 Difference]: Finished difference. Result has 150 places, 131 transitions, 743 flow [2022-11-02 20:10:37,853 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=743, PETRI_PLACES=150, PETRI_TRANSITIONS=131} [2022-11-02 20:10:37,856 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 52 predicate places. [2022-11-02 20:10:37,856 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 131 transitions, 743 flow [2022-11-02 20:10:37,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.85714285714286) internal successors, (1146), 14 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:37,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:37,858 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:37,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:10:38,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:10:38,082 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-02 20:10:38,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1195515545, now seen corresponding path program 2 times [2022-11-02 20:10:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:38,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634526742] [2022-11-02 20:10:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:38,361 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-02 20:10:38,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:38,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634526742] [2022-11-02 20:10:38,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634526742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:38,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873124428] [2022-11-02 20:10:38,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:10:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:38,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:38,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:38,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:10:38,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:10:38,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:10:38,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:10:38,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:38,670 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-02 20:10:38,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:38,770 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-02 20:10:38,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873124428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:38,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:38,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-11-02 20:10:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703611032] [2022-11-02 20:10:38,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:38,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:10:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:38,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:10:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:10:38,781 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-02 20:10:38,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 131 transitions, 743 flow. Second operand has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:38,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:38,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-02 20:10:38,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:39,135 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][148], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 766#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 229#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 192#(<= ~c1~0 0), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 764#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 752#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 56#L115-4true, Black: 762#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 894#(= ~c1~0 0), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:39,135 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:10:39,136 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:10:39,136 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:10:39,136 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:10:39,237 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][128], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 766#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 229#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 764#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 752#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 762#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:39,238 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:10:39,238 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:10:39,238 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:10:39,238 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:10:39,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][106], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 766#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 229#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 192#(<= ~c1~0 0), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 764#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 752#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 56#L115-4true, Black: 762#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 786#(<= ~c1~0 1), Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:39,240 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:10:39,241 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:10:39,241 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:10:39,241 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:10:39,277 INFO L130 PetriNetUnfolder]: 493/1518 cut-off events. [2022-11-02 20:10:39,277 INFO L131 PetriNetUnfolder]: For 7621/7750 co-relation queries the response was YES. [2022-11-02 20:10:39,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 1518 events. 493/1518 cut-off events. For 7621/7750 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10723 event pairs, 14 based on Foata normal form. 45/1395 useless extension candidates. Maximal degree in co-relation 5209. Up to 363 conditions per place. [2022-11-02 20:10:39,302 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 84 selfloop transitions, 20 changer transitions 0/192 dead transitions. [2022-11-02 20:10:39,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 192 transitions, 1506 flow [2022-11-02 20:10:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:10:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:10:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2022-11-02 20:10:39,304 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2022-11-02 20:10:39,305 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2022-11-02 20:10:39,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2022-11-02 20:10:39,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:39,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2022-11-02 20:10:39,307 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-02 20:10:39,309 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-02 20:10:39,310 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-02 20:10:39,310 INFO L175 Difference]: Start difference. First operand has 150 places, 131 transitions, 743 flow. Second operand 7 states and 658 transitions. [2022-11-02 20:10:39,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 192 transitions, 1506 flow [2022-11-02 20:10:39,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 192 transitions, 1296 flow, removed 102 selfloop flow, removed 8 redundant places. [2022-11-02 20:10:39,349 INFO L231 Difference]: Finished difference. Result has 141 places, 143 transitions, 866 flow [2022-11-02 20:10:39,349 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=866, PETRI_PLACES=141, PETRI_TRANSITIONS=143} [2022-11-02 20:10:39,350 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 43 predicate places. [2022-11-02 20:10:39,351 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 143 transitions, 866 flow [2022-11-02 20:10:39,351 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-02 20:10:39,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:39,352 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:39,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:39,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:39,578 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-02 20:10:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1555698558, now seen corresponding path program 1 times [2022-11-02 20:10:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:39,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92421779] [2022-11-02 20:10:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:39,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:40,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:40,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92421779] [2022-11-02 20:10:40,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92421779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:40,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484799989] [2022-11-02 20:10:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:40,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:40,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:40,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:40,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:10:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:40,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:10:40,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:40,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:10:40,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484799989] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:40,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:10:40,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 16 [2022-11-02 20:10:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977865263] [2022-11-02 20:10:40,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:10:40,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:10:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:40,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:10:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:10:40,578 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-02 20:10:40,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 143 transitions, 866 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:40,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:40,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-02 20:10:40,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:40,869 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][113], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, Black: 786#(<= ~c1~0 1), Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:40,869 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-02 20:10:40,869 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:40,870 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:40,870 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:40,909 INFO L130 PetriNetUnfolder]: 370/1273 cut-off events. [2022-11-02 20:10:40,909 INFO L131 PetriNetUnfolder]: For 5509/5567 co-relation queries the response was YES. [2022-11-02 20:10:40,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4031 conditions, 1273 events. 370/1273 cut-off events. For 5509/5567 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8543 event pairs, 14 based on Foata normal form. 64/1192 useless extension candidates. Maximal degree in co-relation 3744. Up to 369 conditions per place. [2022-11-02 20:10:40,927 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 49 selfloop transitions, 11 changer transitions 0/148 dead transitions. [2022-11-02 20:10:40,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 148 transitions, 998 flow [2022-11-02 20:10:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:10:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:10:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-11-02 20:10:40,930 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8513761467889909 [2022-11-02 20:10:40,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 464 transitions. [2022-11-02 20:10:40,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 464 transitions. [2022-11-02 20:10:40,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:40,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 464 transitions. [2022-11-02 20:10:40,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:40,934 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-02 20:10:40,934 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-02 20:10:40,934 INFO L175 Difference]: Start difference. First operand has 141 places, 143 transitions, 866 flow. Second operand 5 states and 464 transitions. [2022-11-02 20:10:40,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 148 transitions, 998 flow [2022-11-02 20:10:40,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 148 transitions, 952 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-11-02 20:10:40,951 INFO L231 Difference]: Finished difference. Result has 142 places, 136 transitions, 777 flow [2022-11-02 20:10:40,952 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=777, PETRI_PLACES=142, PETRI_TRANSITIONS=136} [2022-11-02 20:10:40,953 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 44 predicate places. [2022-11-02 20:10:40,954 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 136 transitions, 777 flow [2022-11-02 20:10:40,954 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-02 20:10:40,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:40,955 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:40,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:41,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:10:41,168 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-02 20:10:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1076316002, now seen corresponding path program 1 times [2022-11-02 20:10:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:41,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640570668] [2022-11-02 20:10:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:41,399 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-02 20:10:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:41,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640570668] [2022-11-02 20:10:41,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640570668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:41,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175924819] [2022-11-02 20:10:41,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:41,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:41,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:41,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:41,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:10:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:41,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:10:41,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:41,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:41,838 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-02 20:10:41,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175924819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:41,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:41,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 11 [2022-11-02 20:10:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746137406] [2022-11-02 20:10:41,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:41,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:10:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:10:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:10:41,847 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2022-11-02 20:10:41,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 136 transitions, 777 flow. Second operand has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:41,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:41,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2022-11-02 20:10:41,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:42,498 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][189], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1683#(<= ~c2~0 0), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 786#(<= ~c1~0 1), 17#L46true, Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:42,499 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-02 20:10:42,499 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:42,499 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:42,499 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:42,651 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][168], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1683#(<= ~c2~0 0), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 786#(<= ~c1~0 1), 17#L46true, Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 1885#true, Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:42,651 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,652 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,652 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,652 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,659 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][189], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 192#(<= ~c1~0 0), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 786#(<= ~c1~0 1), Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1683#(<= ~c2~0 0), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 17#L46true, Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:42,659 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,659 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,659 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,659 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,665 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][189], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 192#(<= ~c1~0 0), Black: 744#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 227#(<= 0 ~pos~0), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), Black: 206#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), 72#L96true, Black: 154#true, 1331#true, 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 786#(<= ~c1~0 1), 17#L46true, Black: 894#(= ~c1~0 0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:42,665 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-02 20:10:42,666 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:42,666 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:42,666 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:42,666 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:10:42,715 INFO L130 PetriNetUnfolder]: 759/2658 cut-off events. [2022-11-02 20:10:42,715 INFO L131 PetriNetUnfolder]: For 13576/13922 co-relation queries the response was YES. [2022-11-02 20:10:42,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 2658 events. 759/2658 cut-off events. For 13576/13922 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 22109 event pairs, 5 based on Foata normal form. 115/2456 useless extension candidates. Maximal degree in co-relation 8615. Up to 542 conditions per place. [2022-11-02 20:10:42,764 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 80 selfloop transitions, 48 changer transitions 0/211 dead transitions. [2022-11-02 20:10:42,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 211 transitions, 1736 flow [2022-11-02 20:10:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:10:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:10:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 995 transitions. [2022-11-02 20:10:42,768 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8298582151793161 [2022-11-02 20:10:42,768 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 995 transitions. [2022-11-02 20:10:42,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 995 transitions. [2022-11-02 20:10:42,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:42,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 995 transitions. [2022-11-02 20:10:42,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:42,776 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-02 20:10:42,777 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-02 20:10:42,778 INFO L175 Difference]: Start difference. First operand has 142 places, 136 transitions, 777 flow. Second operand 11 states and 995 transitions. [2022-11-02 20:10:42,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 211 transitions, 1736 flow [2022-11-02 20:10:42,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 211 transitions, 1695 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-11-02 20:10:42,821 INFO L231 Difference]: Finished difference. Result has 154 places, 171 transitions, 1334 flow [2022-11-02 20:10:42,822 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1334, PETRI_PLACES=154, PETRI_TRANSITIONS=171} [2022-11-02 20:10:42,822 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 56 predicate places. [2022-11-02 20:10:42,823 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 171 transitions, 1334 flow [2022-11-02 20:10:42,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:42,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:42,824 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:42,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:43,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:10:43,050 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-02 20:10:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash 318194657, now seen corresponding path program 3 times [2022-11-02 20:10:43,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:43,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818952384] [2022-11-02 20:10:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:43,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:10:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:43,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818952384] [2022-11-02 20:10:43,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818952384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:43,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113836755] [2022-11-02 20:10:43,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:10:43,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:43,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:43,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:43,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:10:43,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 20:10:43,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:10:43,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:10:43,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:10:43,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:10:43,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113836755] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:43,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:43,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-11-02 20:10:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025136504] [2022-11-02 20:10:43,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:43,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:10:43,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:43,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:10:43,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:10:43,914 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-02 20:10:43,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 171 transitions, 1334 flow. Second operand has 15 states, 15 states have (on average 81.86666666666666) internal successors, (1228), 15 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:43,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:43,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-02 20:10:43,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:46,727 INFO L130 PetriNetUnfolder]: 2949/8198 cut-off events. [2022-11-02 20:10:46,727 INFO L131 PetriNetUnfolder]: For 53692/54604 co-relation queries the response was YES. [2022-11-02 20:10:46,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32000 conditions, 8198 events. 2949/8198 cut-off events. For 53692/54604 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 82000 event pairs, 81 based on Foata normal form. 272/7795 useless extension candidates. Maximal degree in co-relation 28688. Up to 1537 conditions per place. [2022-11-02 20:10:46,870 INFO L137 encePairwiseOnDemand]: 95/109 looper letters, 93 selfloop transitions, 126 changer transitions 185/471 dead transitions. [2022-11-02 20:10:46,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 471 transitions, 5701 flow [2022-11-02 20:10:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:10:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-02 20:10:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2241 transitions. [2022-11-02 20:10:46,879 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7907551164431899 [2022-11-02 20:10:46,879 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2241 transitions. [2022-11-02 20:10:46,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2241 transitions. [2022-11-02 20:10:46,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:46,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2241 transitions. [2022-11-02 20:10:46,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 86.1923076923077) internal successors, (2241), 26 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:46,896 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-02 20:10:46,898 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-02 20:10:46,899 INFO L175 Difference]: Start difference. First operand has 154 places, 171 transitions, 1334 flow. Second operand 26 states and 2241 transitions. [2022-11-02 20:10:46,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 471 transitions, 5701 flow [2022-11-02 20:10:46,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 471 transitions, 5390 flow, removed 150 selfloop flow, removed 4 redundant places. [2022-11-02 20:10:47,010 INFO L231 Difference]: Finished difference. Result has 191 places, 227 transitions, 2551 flow [2022-11-02 20:10:47,011 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2551, PETRI_PLACES=191, PETRI_TRANSITIONS=227} [2022-11-02 20:10:47,012 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 93 predicate places. [2022-11-02 20:10:47,012 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 227 transitions, 2551 flow [2022-11-02 20:10:47,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 81.86666666666666) internal successors, (1228), 15 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:47,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:47,013 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:47,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-02 20:10:47,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:10:47,234 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-02 20:10:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1876076310, now seen corresponding path program 4 times [2022-11-02 20:10:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:47,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331864955] [2022-11-02 20:10:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:47,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:47,630 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-02 20:10:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:47,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331864955] [2022-11-02 20:10:47,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331864955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:47,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979611329] [2022-11-02 20:10:47,631 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:10:47,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:47,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:47,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:47,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:10:47,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:10:47,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:10:47,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:10:47,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:10:47,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:48,053 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-02 20:10:48,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979611329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:48,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:48,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 10 [2022-11-02 20:10:48,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175561911] [2022-11-02 20:10:48,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:48,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:10:48,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:10:48,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:10:48,058 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-11-02 20:10:48,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 227 transitions, 2551 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:48,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:48,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-11-02 20:10:48,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:49,636 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][354], [Black: 3043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1998#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 227#(<= 0 ~pos~0), Black: 2065#(and (= ~pos~0 1) (<= ~c2~0 ~pos~0)), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2081#(and (= ~pos~0 0) (<= ~c2~0 0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 1890#(<= ~c2~0 1), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 2435#(and (= ~pos~0 1) (<= ~c2~0 0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1889#(<= ~c2~0 0), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, 72#L96true, Black: 154#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 786#(<= ~c1~0 1), 2801#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 894#(= ~c1~0 0), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 3073#true, Black: 192#(<= ~c1~0 0), Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3055#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 17#L46true, Black: 3035#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2449#(<= 2 ~pos~0), Black: 3045#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3037#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2448#(<= 1 ~pos~0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 3033#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3053#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2450#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2447#(<= 0 ~pos~0), Black: 3039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3049#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3031#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3029#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3041#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:49,637 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-02 20:10:49,637 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-02 20:10:49,637 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-02 20:10:49,637 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-02 20:10:49,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][394], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1998#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 227#(<= 0 ~pos~0), Black: 2065#(and (= ~pos~0 1) (<= ~c2~0 ~pos~0)), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2081#(and (= ~pos~0 0) (<= ~c2~0 0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 1890#(<= ~c2~0 1), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 1889#(<= ~c2~0 0), 56#L115-4true, Black: 2435#(and (= ~pos~0 1) (<= ~c2~0 0)), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, 72#L96true, Black: 154#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 2801#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 786#(<= ~c1~0 1), Black: 894#(= ~c1~0 0), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 1885#true, 3073#true, Black: 192#(<= ~c1~0 0), Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3055#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 17#L46true, Black: 3035#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2449#(<= 2 ~pos~0), Black: 3045#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3037#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2448#(<= 1 ~pos~0), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 3033#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3053#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2450#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2447#(<= 0 ~pos~0), Black: 3039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3049#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3031#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3029#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3041#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:10:49,742 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-11-02 20:10:49,742 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:10:49,742 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:10:49,742 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:10:49,745 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][405], [Black: 3043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1998#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 227#(<= 0 ~pos~0), Black: 2065#(and (= ~pos~0 1) (<= ~c2~0 ~pos~0)), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2081#(and (= ~pos~0 0) (<= ~c2~0 0)), Black: 1890#(<= ~c2~0 1), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 2435#(and (= ~pos~0 1) (<= ~c2~0 0)), 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, 72#L96true, Black: 154#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 2801#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 786#(<= ~c1~0 1), Black: 894#(= ~c1~0 0), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 192#(<= ~c1~0 0), Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), 3078#(<= ~c1~0 1), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3055#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 17#L46true, Black: 3035#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2449#(<= 2 ~pos~0), Black: 3045#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3037#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 2448#(<= 1 ~pos~0), Black: 3033#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3053#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2450#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2447#(<= 0 ~pos~0), Black: 3039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3049#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3031#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3029#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3041#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0))]) [2022-11-02 20:10:49,745 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-11-02 20:10:49,745 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:10:49,745 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:10:49,745 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:10:49,790 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][416], [Black: 756#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 754#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1998#(and (= ~pos~0 0) (= ~pos~0 ~c2~0)), Black: 227#(<= 0 ~pos~0), Black: 2065#(and (= ~pos~0 1) (<= ~c2~0 ~pos~0)), Black: 748#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 2081#(and (= ~pos~0 0) (<= ~c2~0 0)), Black: 746#(and (= ~pos~0 0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 1890#(<= ~c2~0 1), Black: 750#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), 56#L115-4true, Black: 2435#(and (= ~pos~0 1) (<= ~c2~0 0)), 1889#(<= ~c2~0 0), Black: 132#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 137#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 228#(<= 1 ~pos~0), 781#true, Black: 141#true, 72#L96true, Black: 154#true, 146#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 2801#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 786#(<= ~c1~0 1), Black: 894#(= ~c1~0 0), Black: 171#(<= 0 ~pos~0), Black: 177#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 179#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 3079#(<= ~c1~0 2), Black: 192#(<= ~c1~0 0), Black: 201#(or (<= ~c2~0 0) (<= ~c2~0 ~pos~0)), 19#L83true, Black: 1683#(<= ~c2~0 0), 159#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3055#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 17#L46true, Black: 3035#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2449#(<= 2 ~pos~0), Black: 3045#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3037#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 538#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 2448#(<= 1 ~pos~0), Black: 3033#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3053#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2450#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 2447#(<= 0 ~pos~0), Black: 3039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3049#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3031#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 124#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3029#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 119#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 3041#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0))]) [2022-11-02 20:10:49,791 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-11-02 20:10:49,791 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-02 20:10:49,791 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-02 20:10:49,791 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-02 20:10:49,817 INFO L130 PetriNetUnfolder]: 1768/5907 cut-off events. [2022-11-02 20:10:49,817 INFO L131 PetriNetUnfolder]: For 99119/100272 co-relation queries the response was YES. [2022-11-02 20:10:49,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29180 conditions, 5907 events. 1768/5907 cut-off events. For 99119/100272 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 57117 event pairs, 35 based on Foata normal form. 243/5505 useless extension candidates. Maximal degree in co-relation 28891. Up to 1276 conditions per place. [2022-11-02 20:10:50,080 INFO L137 encePairwiseOnDemand]: 102/109 looper letters, 268 selfloop transitions, 59 changer transitions 0/425 dead transitions. [2022-11-02 20:10:50,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 425 transitions, 6420 flow [2022-11-02 20:10:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:10:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 20:10:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 755 transitions. [2022-11-02 20:10:50,084 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8658256880733946 [2022-11-02 20:10:50,084 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 755 transitions. [2022-11-02 20:10:50,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 755 transitions. [2022-11-02 20:10:50,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:50,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 755 transitions. [2022-11-02 20:10:50,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:50,092 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-02 20:10:50,093 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-02 20:10:50,093 INFO L175 Difference]: Start difference. First operand has 191 places, 227 transitions, 2551 flow. Second operand 8 states and 755 transitions. [2022-11-02 20:10:50,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 425 transitions, 6420 flow [2022-11-02 20:10:50,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 425 transitions, 5609 flow, removed 390 selfloop flow, removed 16 redundant places. [2022-11-02 20:10:50,491 INFO L231 Difference]: Finished difference. Result has 171 places, 253 transitions, 2785 flow [2022-11-02 20:10:50,492 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2785, PETRI_PLACES=171, PETRI_TRANSITIONS=253} [2022-11-02 20:10:50,493 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 73 predicate places. [2022-11-02 20:10:50,493 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 253 transitions, 2785 flow [2022-11-02 20:10:50,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:50,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:50,494 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:50,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:50,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:50,715 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-02 20:10:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1465219959, now seen corresponding path program 2 times [2022-11-02 20:10:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:50,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417258577] [2022-11-02 20:10:50,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:10:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:51,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417258577] [2022-11-02 20:10:51,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417258577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:51,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133110437] [2022-11-02 20:10:51,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:10:51,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:51,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:51,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:51,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:10:51,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:10:51,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:10:51,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:10:51,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:10:51,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:51,845 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-02 20:10:51,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133110437] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:51,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:51,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2022-11-02 20:10:51,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358156951] [2022-11-02 20:10:51,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:51,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:10:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:10:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:10:51,850 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-02 20:10:51,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 253 transitions, 2785 flow. Second operand has 16 states, 16 states have (on average 80.625) internal successors, (1290), 16 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:51,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:10:51,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-02 20:10:51,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:10:58,301 INFO L130 PetriNetUnfolder]: 9597/23994 cut-off events. [2022-11-02 20:10:58,302 INFO L131 PetriNetUnfolder]: For 240397/241541 co-relation queries the response was YES. [2022-11-02 20:10:58,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109088 conditions, 23994 events. 9597/23994 cut-off events. For 240397/241541 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 268785 event pairs, 742 based on Foata normal form. 368/22274 useless extension candidates. Maximal degree in co-relation 107135. Up to 4437 conditions per place. [2022-11-02 20:10:58,971 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 425 selfloop transitions, 213 changer transitions 57/768 dead transitions. [2022-11-02 20:10:58,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 768 transitions, 11466 flow [2022-11-02 20:10:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:10:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 20:10:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1544 transitions. [2022-11-02 20:10:58,985 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7869520897043832 [2022-11-02 20:10:58,985 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1544 transitions. [2022-11-02 20:10:58,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1544 transitions. [2022-11-02 20:10:58,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:10:58,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1544 transitions. [2022-11-02 20:10:58,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.77777777777777) internal successors, (1544), 18 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:58,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:59,001 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 109.0) internal successors, (2071), 19 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:59,009 INFO L175 Difference]: Start difference. First operand has 171 places, 253 transitions, 2785 flow. Second operand 18 states and 1544 transitions. [2022-11-02 20:10:59,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 768 transitions, 11466 flow [2022-11-02 20:10:59,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 768 transitions, 10647 flow, removed 368 selfloop flow, removed 5 redundant places. [2022-11-02 20:10:59,561 INFO L231 Difference]: Finished difference. Result has 194 places, 412 transitions, 6087 flow [2022-11-02 20:10:59,562 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6087, PETRI_PLACES=194, PETRI_TRANSITIONS=412} [2022-11-02 20:10:59,562 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 96 predicate places. [2022-11-02 20:10:59,562 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 412 transitions, 6087 flow [2022-11-02 20:10:59,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 80.625) internal successors, (1290), 16 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:10:59,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:10:59,564 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:59,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:59,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:59,778 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-02 20:10:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1183258656, now seen corresponding path program 5 times [2022-11-02 20:10:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:59,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109355929] [2022-11-02 20:10:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:11:00,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109355929] [2022-11-02 20:11:00,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109355929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:00,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729437751] [2022-11-02 20:11:00,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:11:00,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:00,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:00,125 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:00,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:11:00,257 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-02 20:11:00,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:00,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:11:00,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:11:00,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:11:00,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729437751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:00,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:00,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-11-02 20:11:00,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284598936] [2022-11-02 20:11:00,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:00,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:11:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:00,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:11:00,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:11:00,662 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-11-02 20:11:00,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 412 transitions, 6087 flow. Second operand has 16 states, 16 states have (on average 82.0) internal successors, (1312), 16 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:00,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:11:00,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-11-02 20:11:00,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:11:11,900 INFO L130 PetriNetUnfolder]: 13681/35230 cut-off events. [2022-11-02 20:11:11,901 INFO L131 PetriNetUnfolder]: For 548994/557887 co-relation queries the response was YES. [2022-11-02 20:11:12,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184105 conditions, 35230 events. 13681/35230 cut-off events. For 548994/557887 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 416704 event pairs, 195 based on Foata normal form. 1859/34128 useless extension candidates. Maximal degree in co-relation 178670. Up to 6730 conditions per place. [2022-11-02 20:11:13,240 INFO L137 encePairwiseOnDemand]: 96/109 looper letters, 141 selfloop transitions, 546 changer transitions 412/1166 dead transitions. [2022-11-02 20:11:13,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1166 transitions, 22379 flow [2022-11-02 20:11:13,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:11:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-11-02 20:11:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2672 transitions. [2022-11-02 20:11:13,251 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7907664989641906 [2022-11-02 20:11:13,251 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2672 transitions. [2022-11-02 20:11:13,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2672 transitions. [2022-11-02 20:11:13,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:11:13,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2672 transitions. [2022-11-02 20:11:13,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 86.19354838709677) internal successors, (2672), 31 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:13,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 109.0) internal successors, (3488), 32 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:13,267 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 109.0) internal successors, (3488), 32 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:13,268 INFO L175 Difference]: Start difference. First operand has 194 places, 412 transitions, 6087 flow. Second operand 31 states and 2672 transitions. [2022-11-02 20:11:13,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1166 transitions, 22379 flow [2022-11-02 20:11:15,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1166 transitions, 20178 flow, removed 1059 selfloop flow, removed 11 redundant places. [2022-11-02 20:11:15,109 INFO L231 Difference]: Finished difference. Result has 224 places, 697 transitions, 12923 flow [2022-11-02 20:11:15,110 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=5659, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=12923, PETRI_PLACES=224, PETRI_TRANSITIONS=697} [2022-11-02 20:11:15,110 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 126 predicate places. [2022-11-02 20:11:15,110 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 697 transitions, 12923 flow [2022-11-02 20:11:15,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 82.0) internal successors, (1312), 16 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:15,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:11:15,111 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:15,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:15,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:11:15,314 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-02 20:11:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1277198809, now seen corresponding path program 6 times [2022-11-02 20:11:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:15,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605731634] [2022-11-02 20:11:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:15,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-02 20:11:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:15,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605731634] [2022-11-02 20:11:15,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605731634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:15,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040087557] [2022-11-02 20:11:15,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:11:15,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:15,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:15,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:15,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:11:16,004 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-02 20:11:16,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:16,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-02 20:11:16,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:11:16,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:11:16,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040087557] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:16,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:16,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 23 [2022-11-02 20:11:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270830998] [2022-11-02 20:11:16,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:16,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:11:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:11:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:11:16,911 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-02 20:11:16,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 697 transitions, 12923 flow. Second operand has 23 states, 23 states have (on average 80.52173913043478) internal successors, (1852), 23 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:16,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:11:16,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-02 20:11:16,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:11:49,030 INFO L130 PetriNetUnfolder]: 31690/77188 cut-off events. [2022-11-02 20:11:49,031 INFO L131 PetriNetUnfolder]: For 1334503/1352302 co-relation queries the response was YES. [2022-11-02 20:11:49,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428233 conditions, 77188 events. 31690/77188 cut-off events. For 1334503/1352302 co-relation queries the response was YES. Maximal size of possible extension queue 3170. Compared 980987 event pairs, 787 based on Foata normal form. 5050/75602 useless extension candidates. Maximal degree in co-relation 415405. Up to 14041 conditions per place. [2022-11-02 20:11:50,777 INFO L137 encePairwiseOnDemand]: 94/109 looper letters, 990 selfloop transitions, 2079 changer transitions 378/3512 dead transitions. [2022-11-02 20:11:50,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 3512 transitions, 73744 flow [2022-11-02 20:11:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-02 20:11:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2022-11-02 20:11:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 7755 transitions. [2022-11-02 20:11:50,796 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7733346629437575 [2022-11-02 20:11:50,796 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 7755 transitions. [2022-11-02 20:11:50,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 7755 transitions. [2022-11-02 20:11:50,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:11:50,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 7755 transitions. [2022-11-02 20:11:50,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 84.29347826086956) internal successors, (7755), 92 states have internal predecessors, (7755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:50,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 109.0) internal successors, (10137), 93 states have internal predecessors, (10137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:50,834 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 109.0) internal successors, (10137), 93 states have internal predecessors, (10137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:50,834 INFO L175 Difference]: Start difference. First operand has 224 places, 697 transitions, 12923 flow. Second operand 92 states and 7755 transitions. [2022-11-02 20:11:50,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 3512 transitions, 73744 flow [2022-11-02 20:12:04,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 3512 transitions, 68193 flow, removed 2768 selfloop flow, removed 11 redundant places. [2022-11-02 20:12:04,719 INFO L231 Difference]: Finished difference. Result has 326 places, 2726 transitions, 56739 flow [2022-11-02 20:12:04,720 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=12052, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=523, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=56739, PETRI_PLACES=326, PETRI_TRANSITIONS=2726} [2022-11-02 20:12:04,720 INFO L287 CegarLoopForPetriNet]: 98 programPoint places, 228 predicate places. [2022-11-02 20:12:04,720 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 2726 transitions, 56739 flow [2022-11-02 20:12:04,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 80.52173913043478) internal successors, (1852), 23 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:04,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:04,722 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 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-02 20:12:04,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:12:04,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:12:04,942 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-02 20:12:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1380408863, now seen corresponding path program 1 times [2022-11-02 20:12:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:04,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523946196] [2022-11-02 20:12:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:12:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:05,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523946196] [2022-11-02 20:12:05,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523946196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:12:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844787007] [2022-11-02 20:12:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:05,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:05,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:05,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:05,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71223f54-68f4-4c7f-b80b-605beb85502d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:12:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:05,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:12:05,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 39 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:12:05,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:12:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:12:06,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844787007] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:12:06,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:12:06,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 23 [2022-11-02 20:12:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008402280] [2022-11-02 20:12:06,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:12:06,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:12:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:06,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:12:06,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:12:06,174 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-11-02 20:12:06,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 2726 transitions, 56739 flow. Second operand has 23 states, 23 states have (on average 80.43478260869566) internal successors, (1850), 23 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:06,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:06,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-11-02 20:12:06,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand