./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro --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 7a18ee378e36a8b6ec16846ba26aa7ebab799f55311c04bb5b266d3aa0d0986d --- 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-8393723 [2022-11-18 18:34:56,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:34:56,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:34:56,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:34:56,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:34:56,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:34:56,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:34:56,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:34:56,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:34:56,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:34:56,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:34:56,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:34:56,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:34:56,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:34:56,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:34:56,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:34:56,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:34:56,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:34:56,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:34:56,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:34:56,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:34:56,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:34:56,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:34:56,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:34:56,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:34:56,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:34:56,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:34:56,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:34:56,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:34:56,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:34:56,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:34:56,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:34:56,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:34:56,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:34:56,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:34:56,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:34:56,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:34:56,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:34:56,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:34:56,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:34:56,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:34:56,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 18:34:56,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:34:56,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:34:56,156 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:34:56,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:34:56,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:34:56,158 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:34:56,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:34:56,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:34:56,159 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:34:56,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:34:56,160 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:34:56,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:34:56,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:34:56,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:34:56,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:34:56,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:34:56,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:34:56,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:34:56,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:34:56,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:34:56,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:34:56,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:34:56,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:34:56,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:34:56,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:34:56,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:34:56,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:34:56,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:34:56,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:34:56,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:34:56,166 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:34:56,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:34:56,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:34:56,167 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_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/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_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro 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 -> 7a18ee378e36a8b6ec16846ba26aa7ebab799f55311c04bb5b266d3aa0d0986d [2022-11-18 18:34:56,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:34:56,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:34:56,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:34:56,505 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:34:56,506 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:34:56,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2022-11-18 18:34:56,617 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/data/9c6212287/5b068368cbda42efb5ea446bce2c2e15/FLAG59bb382ee [2022-11-18 18:34:57,116 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:34:57,117 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2022-11-18 18:34:57,125 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/data/9c6212287/5b068368cbda42efb5ea446bce2c2e15/FLAG59bb382ee [2022-11-18 18:34:57,495 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/data/9c6212287/5b068368cbda42efb5ea446bce2c2e15 [2022-11-18 18:34:57,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:34:57,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:34:57,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:34:57,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:34:57,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:34:57,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:57,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531209ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57, skipping insertion in model container [2022-11-18 18:34:57,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:57,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:34:57,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:34:57,794 WARN L234 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_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c[4788,4801] [2022-11-18 18:34:57,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:34:57,817 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:34:57,855 WARN L234 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_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c[4788,4801] [2022-11-18 18:34:57,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:34:57,879 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:34:57,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57 WrapperNode [2022-11-18 18:34:57,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:34:57,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:34:57,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:34:57,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:34:57,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:57,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:57,958 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 297 [2022-11-18 18:34:57,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:34:57,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:34:57,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:34:57,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:34:57,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:57,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:57,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:57,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:58,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:58,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:58,029 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:58,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:58,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:34:58,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:34:58,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:34:58,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:34:58,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (1/1) ... [2022-11-18 18:34:58,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:34:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:34:58,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:34:58,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:34:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:34:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:34:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:34:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 18:34:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 18:34:58,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 18:34:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 18:34:58,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 18:34:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 18:34:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 18:34:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:34:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 18:34:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:34:58,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:34:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:34:58,155 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:34:58,309 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:34:58,326 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:34:58,976 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:34:58,992 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:34:58,992 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 18:34:58,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:34:58 BoogieIcfgContainer [2022-11-18 18:34:58,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:34:58,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:34:58,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:34:59,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:34:59,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:34:57" (1/3) ... [2022-11-18 18:34:59,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26144ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:34:59, skipping insertion in model container [2022-11-18 18:34:59,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:57" (2/3) ... [2022-11-18 18:34:59,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26144ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:34:59, skipping insertion in model container [2022-11-18 18:34:59,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:34:58" (3/3) ... [2022-11-18 18:34:59,008 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2022-11-18 18:34:59,027 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 18:34:59,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:34:59,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 18:34:59,042 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:34:59,216 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 18:34:59,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 359 places, 375 transitions, 774 flow [2022-11-18 18:34:59,597 INFO L130 PetriNetUnfolder]: 26/372 cut-off events. [2022-11-18 18:34:59,597 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 18:34:59,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 372 events. 26/372 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 882 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 274. Up to 2 conditions per place. [2022-11-18 18:34:59,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 359 places, 375 transitions, 774 flow [2022-11-18 18:34:59,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 345 places, 361 transitions, 740 flow [2022-11-18 18:34:59,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:34:59,677 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;@2341bca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:34:59,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 18:34:59,783 INFO L130 PetriNetUnfolder]: 26/360 cut-off events. [2022-11-18 18:34:59,783 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 18:34:59,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:34:59,785 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:34:59,785 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-18 18:34:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1119500786, now seen corresponding path program 1 times [2022-11-18 18:34:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:59,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499663584] [2022-11-18 18:34:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:35:00,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499663584] [2022-11-18 18:35:00,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499663584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:00,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:00,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:35:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945056605] [2022-11-18 18:35:00,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:00,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 18:35:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:35:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 18:35:00,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:35:00,314 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 375 [2022-11-18 18:35:00,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 361 transitions, 740 flow. Second operand has 2 states, 2 states have (on average 354.0) internal successors, (708), 2 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:00,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:35:00,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 375 [2022-11-18 18:35:00,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:35:00,423 INFO L130 PetriNetUnfolder]: 7/342 cut-off events. [2022-11-18 18:35:00,423 INFO L131 PetriNetUnfolder]: For 14/16 co-relation queries the response was YES. [2022-11-18 18:35:00,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 342 events. 7/342 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 845 event pairs, 0 based on Foata normal form. 36/356 useless extension candidates. Maximal degree in co-relation 263. Up to 7 conditions per place. [2022-11-18 18:35:00,430 INFO L137 encePairwiseOnDemand]: 356/375 looper letters, 6 selfloop transitions, 0 changer transitions 3/342 dead transitions. [2022-11-18 18:35:00,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 342 transitions, 714 flow [2022-11-18 18:35:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 18:35:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 18:35:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 723 transitions. [2022-11-18 18:35:00,459 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.964 [2022-11-18 18:35:00,459 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 723 transitions. [2022-11-18 18:35:00,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 723 transitions. [2022-11-18 18:35:00,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:35:00,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 723 transitions. [2022-11-18 18:35:00,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 361.5) internal successors, (723), 2 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:00,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:00,487 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:00,489 INFO L175 Difference]: Start difference. First operand has 345 places, 361 transitions, 740 flow. Second operand 2 states and 723 transitions. [2022-11-18 18:35:00,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 342 transitions, 714 flow [2022-11-18 18:35:00,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 342 transitions, 702 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 18:35:00,510 INFO L231 Difference]: Finished difference. Result has 340 places, 339 transitions, 684 flow [2022-11-18 18:35:00,513 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=684, PETRI_PLACES=340, PETRI_TRANSITIONS=339} [2022-11-18 18:35:00,519 INFO L288 CegarLoopForPetriNet]: 345 programPoint places, -5 predicate places. [2022-11-18 18:35:00,519 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 339 transitions, 684 flow [2022-11-18 18:35:00,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 354.0) internal successors, (708), 2 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:00,520 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:35:00,521 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:35:00,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:35:00,523 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-18 18:35:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1914866916, now seen corresponding path program 1 times [2022-11-18 18:35:00,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:35:00,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701394060] [2022-11-18 18:35:00,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:35:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:01,038 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-18 18:35:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:35:01,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701394060] [2022-11-18 18:35:01,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701394060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:01,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:01,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:35:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767950909] [2022-11-18 18:35:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:01,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:35:01,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:35:01,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:35:01,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:35:01,049 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 375 [2022-11-18 18:35:01,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 339 transitions, 684 flow. Second operand has 5 states, 5 states have (on average 339.8) internal successors, (1699), 5 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:01,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:35:01,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 375 [2022-11-18 18:35:01,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:35:01,259 INFO L130 PetriNetUnfolder]: 7/345 cut-off events. [2022-11-18 18:35:01,259 INFO L131 PetriNetUnfolder]: For 3/5 co-relation queries the response was YES. [2022-11-18 18:35:01,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 345 events. 7/345 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 841 event pairs, 0 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 370. Up to 16 conditions per place. [2022-11-18 18:35:01,265 INFO L137 encePairwiseOnDemand]: 370/375 looper letters, 18 selfloop transitions, 4 changer transitions 0/343 dead transitions. [2022-11-18 18:35:01,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 343 transitions, 736 flow [2022-11-18 18:35:01,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:35:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 18:35:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1708 transitions. [2022-11-18 18:35:01,271 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9109333333333334 [2022-11-18 18:35:01,271 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1708 transitions. [2022-11-18 18:35:01,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1708 transitions. [2022-11-18 18:35:01,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:35:01,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1708 transitions. [2022-11-18 18:35:01,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 341.6) internal successors, (1708), 5 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:01,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 375.0) internal successors, (2250), 6 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:01,284 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 375.0) internal successors, (2250), 6 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:01,284 INFO L175 Difference]: Start difference. First operand has 340 places, 339 transitions, 684 flow. Second operand 5 states and 1708 transitions. [2022-11-18 18:35:01,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 343 transitions, 736 flow [2022-11-18 18:35:01,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 343 transitions, 736 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 18:35:01,295 INFO L231 Difference]: Finished difference. Result has 342 places, 340 transitions, 700 flow [2022-11-18 18:35:01,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=700, PETRI_PLACES=342, PETRI_TRANSITIONS=340} [2022-11-18 18:35:01,297 INFO L288 CegarLoopForPetriNet]: 345 programPoint places, -3 predicate places. [2022-11-18 18:35:01,297 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 340 transitions, 700 flow [2022-11-18 18:35:01,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 339.8) internal successors, (1699), 5 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:01,300 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:35:01,300 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:35:01,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:35:01,301 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-18 18:35:01,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1502566695, now seen corresponding path program 1 times [2022-11-18 18:35:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:35:01,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122086361] [2022-11-18 18:35:01,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:01,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:35:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:01,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:35:01,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122086361] [2022-11-18 18:35:01,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122086361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:35:01,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861556977] [2022-11-18 18:35:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:35:01,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:35:01,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:35:01,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 18:35:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:02,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 18:35:02,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:02,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:35:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:02,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861556977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:35:02,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:35:02,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-18 18:35:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115098724] [2022-11-18 18:35:02,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:35:02,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 18:35:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:35:02,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 18:35:02,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-18 18:35:02,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 375 [2022-11-18 18:35:02,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 340 transitions, 700 flow. Second operand has 14 states, 14 states have (on average 338.7857142857143) internal successors, (4743), 14 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:02,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:35:02,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 375 [2022-11-18 18:35:02,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:35:02,727 INFO L130 PetriNetUnfolder]: 7/354 cut-off events. [2022-11-18 18:35:02,728 INFO L131 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2022-11-18 18:35:02,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 354 events. 7/354 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 839 event pairs, 0 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 395. Up to 13 conditions per place. [2022-11-18 18:35:02,735 INFO L137 encePairwiseOnDemand]: 367/375 looper letters, 19 selfloop transitions, 11 changer transitions 0/350 dead transitions. [2022-11-18 18:35:02,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 350 transitions, 782 flow [2022-11-18 18:35:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:35:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 18:35:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3728 transitions. [2022-11-18 18:35:02,744 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9037575757575758 [2022-11-18 18:35:02,745 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3728 transitions. [2022-11-18 18:35:02,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3728 transitions. [2022-11-18 18:35:02,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:35:02,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3728 transitions. [2022-11-18 18:35:02,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 338.90909090909093) internal successors, (3728), 11 states have internal predecessors, (3728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:02,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 375.0) internal successors, (4500), 12 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:02,772 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 375.0) internal successors, (4500), 12 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:02,772 INFO L175 Difference]: Start difference. First operand has 342 places, 340 transitions, 700 flow. Second operand 11 states and 3728 transitions. [2022-11-18 18:35:02,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 350 transitions, 782 flow [2022-11-18 18:35:02,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 350 transitions, 776 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 18:35:02,782 INFO L231 Difference]: Finished difference. Result has 352 places, 346 transitions, 749 flow [2022-11-18 18:35:02,783 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=749, PETRI_PLACES=352, PETRI_TRANSITIONS=346} [2022-11-18 18:35:02,786 INFO L288 CegarLoopForPetriNet]: 345 programPoint places, 7 predicate places. [2022-11-18 18:35:02,786 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 346 transitions, 749 flow [2022-11-18 18:35:02,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 338.7857142857143) internal successors, (4743), 14 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:02,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:35:02,792 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:35:02,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 18:35:02,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-18 18:35:03,000 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-18 18:35:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1397789449, now seen corresponding path program 2 times [2022-11-18 18:35:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:35:03,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281922567] [2022-11-18 18:35:03,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:35:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 18:35:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:35:03,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281922567] [2022-11-18 18:35:03,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281922567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:03,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:03,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 18:35:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583002034] [2022-11-18 18:35:03,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:03,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 18:35:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:35:03,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 18:35:03,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:35:03,862 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 375 [2022-11-18 18:35:03,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 346 transitions, 749 flow. Second operand has 10 states, 10 states have (on average 294.6) internal successors, (2946), 10 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:03,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:35:03,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 375 [2022-11-18 18:35:03,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:35:09,269 INFO L130 PetriNetUnfolder]: 5237/18963 cut-off events. [2022-11-18 18:35:09,270 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2022-11-18 18:35:09,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27218 conditions, 18963 events. 5237/18963 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 235010 event pairs, 1876 based on Foata normal form. 1/17341 useless extension candidates. Maximal degree in co-relation 27210. Up to 3101 conditions per place. [2022-11-18 18:35:09,529 INFO L137 encePairwiseOnDemand]: 359/375 looper letters, 158 selfloop transitions, 14 changer transitions 4/460 dead transitions. [2022-11-18 18:35:09,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 460 transitions, 1343 flow [2022-11-18 18:35:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:35:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 18:35:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3077 transitions. [2022-11-18 18:35:09,540 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8205333333333333 [2022-11-18 18:35:09,540 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3077 transitions. [2022-11-18 18:35:09,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3077 transitions. [2022-11-18 18:35:09,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:35:09,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3077 transitions. [2022-11-18 18:35:09,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 307.7) internal successors, (3077), 10 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:09,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 375.0) internal successors, (4125), 11 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:09,566 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 375.0) internal successors, (4125), 11 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:09,567 INFO L175 Difference]: Start difference. First operand has 352 places, 346 transitions, 749 flow. Second operand 10 states and 3077 transitions. [2022-11-18 18:35:09,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 460 transitions, 1343 flow [2022-11-18 18:35:09,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 460 transitions, 1334 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-18 18:35:09,581 INFO L231 Difference]: Finished difference. Result has 364 places, 352 transitions, 811 flow [2022-11-18 18:35:09,582 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=811, PETRI_PLACES=364, PETRI_TRANSITIONS=352} [2022-11-18 18:35:09,584 INFO L288 CegarLoopForPetriNet]: 345 programPoint places, 19 predicate places. [2022-11-18 18:35:09,585 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 352 transitions, 811 flow [2022-11-18 18:35:09,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 294.6) internal successors, (2946), 10 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:09,586 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:35:09,587 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:35:09,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:35:09,588 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-18 18:35:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 781691246, now seen corresponding path program 1 times [2022-11-18 18:35:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:35:09,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780016020] [2022-11-18 18:35:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:35:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 18:35:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:35:10,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780016020] [2022-11-18 18:35:10,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780016020] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:35:10,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931958038] [2022-11-18 18:35:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:10,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:35:10,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:35:10,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:35:10,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 18:35:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:10,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 18:35:10,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 18:35:11,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:11,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931958038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:11,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 18:35:11,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2022-11-18 18:35:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384821963] [2022-11-18 18:35:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:11,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 18:35:11,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:35:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 18:35:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-11-18 18:35:11,447 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 375 [2022-11-18 18:35:11,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 352 transitions, 811 flow. Second operand has 12 states, 12 states have (on average 268.9166666666667) internal successors, (3227), 12 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:11,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:35:11,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 375 [2022-11-18 18:35:11,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:35:50,080 INFO L130 PetriNetUnfolder]: 67001/190159 cut-off events. [2022-11-18 18:35:50,080 INFO L131 PetriNetUnfolder]: For 13078/13084 co-relation queries the response was YES. [2022-11-18 18:35:51,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304268 conditions, 190159 events. 67001/190159 cut-off events. For 13078/13084 co-relation queries the response was YES. Maximal size of possible extension queue 4290. Compared 2805707 event pairs, 31883 based on Foata normal form. 0/171751 useless extension candidates. Maximal degree in co-relation 304254. Up to 52957 conditions per place. [2022-11-18 18:35:51,986 INFO L137 encePairwiseOnDemand]: 339/375 looper letters, 520 selfloop transitions, 82 changer transitions 42/903 dead transitions. [2022-11-18 18:35:51,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 903 transitions, 3453 flow [2022-11-18 18:35:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 18:35:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-18 18:35:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 7244 transitions. [2022-11-18 18:35:52,012 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7726933333333333 [2022-11-18 18:35:52,012 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 7244 transitions. [2022-11-18 18:35:52,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 7244 transitions. [2022-11-18 18:35:52,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:35:52,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 7244 transitions. [2022-11-18 18:35:52,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 289.76) internal successors, (7244), 25 states have internal predecessors, (7244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:52,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 375.0) internal successors, (9750), 26 states have internal predecessors, (9750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:52,083 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 375.0) internal successors, (9750), 26 states have internal predecessors, (9750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:52,083 INFO L175 Difference]: Start difference. First operand has 364 places, 352 transitions, 811 flow. Second operand 25 states and 7244 transitions. [2022-11-18 18:35:52,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 903 transitions, 3453 flow [2022-11-18 18:35:52,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 903 transitions, 3416 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-18 18:35:52,460 INFO L231 Difference]: Finished difference. Result has 402 places, 434 transitions, 1374 flow [2022-11-18 18:35:52,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1374, PETRI_PLACES=402, PETRI_TRANSITIONS=434} [2022-11-18 18:35:52,464 INFO L288 CegarLoopForPetriNet]: 345 programPoint places, 57 predicate places. [2022-11-18 18:35:52,464 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 434 transitions, 1374 flow [2022-11-18 18:35:52,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 268.9166666666667) internal successors, (3227), 12 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:52,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:35:52,467 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:35:52,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 18:35:52,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5feb5ff8-d5a9-46fe-935e-5799dd5d9f4c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:35:52,674 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-18 18:35:52,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:52,675 INFO L85 PathProgramCache]: Analyzing trace with hash -365941512, now seen corresponding path program 2 times [2022-11-18 18:35:52,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:35:52,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263614615] [2022-11-18 18:35:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:52,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:35:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 18:35:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:35:53,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263614615] [2022-11-18 18:35:53,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263614615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:53,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:53,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 18:35:53,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981697877] [2022-11-18 18:35:53,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:53,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:35:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:35:53,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:35:53,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:35:53,348 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 375 [2022-11-18 18:35:53,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 434 transitions, 1374 flow. Second operand has 9 states, 9 states have (on average 304.44444444444446) internal successors, (2740), 9 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:53,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:35:53,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 375 [2022-11-18 18:35:53,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:35:57,326 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L77-->L78: Formula: (= v_~result_8~0_1 (ite (= v_~name_2~0_6 v_~current_10~0_2) 1 v_~result_8~0_2)) InVars {~name_2~0=v_~name_2~0_6, ~result_8~0=v_~result_8~0_2, ~current_10~0=v_~current_10~0_2} OutVars{~name_2~0=v_~name_2~0_6, ~result_8~0=v_~result_8~0_1, ~current_10~0=v_~current_10~0_2} AuxVars[] AssignedVars[~result_8~0][354], [Black: 1605#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1599#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 259#L78true, Black: 2356#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), 1591#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 2425#(and (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= ~result_4~0 0)), Black: 2388#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2384#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1)), Black: 2366#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2354#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2364#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1)), Black: 2374#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 2372#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 2358#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (= ~break_7~0 0)), Black: 2378#(and (= ~name_2~0 ~name_1~0) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1) (or (and (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 1623#(and (or (= ~result_8~0 0) (not (= ~name_3~0 ~name_2~0))) (= ~break_11~0 0)), Black: 1625#(and (= ~result_8~0 0) (= |thread2Thread1of1ForFork2_#t~ite10#1| 0)), Black: 2362#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2386#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 1615#(= ~result_8~0 0), Black: 2360#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~break_7~0 1)), Black: 2103#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 1613#(or (= ~result_8~0 0) (and (not (= ~name_3~0 ~name_2~0)) (= ~break_11~0 0))), Black: 2370#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1) (or (and (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2083#(and (= ~break_15~0 0) (= ~break_7~0 0)), Black: 2368#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 362#true, 14#L136-4true, Black: 2382#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2090#(and (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 1610#true, 310#L101true, Black: 373#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 64#L63-11true, 1637#true]) [2022-11-18 18:35:57,326 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-11-18 18:35:57,326 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-18 18:35:57,326 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-18 18:35:57,326 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-18 18:35:57,940 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L77-->L78: Formula: (= v_~result_8~0_1 (ite (= v_~name_2~0_6 v_~current_10~0_2) 1 v_~result_8~0_2)) InVars {~name_2~0=v_~name_2~0_6, ~result_8~0=v_~result_8~0_2, ~current_10~0=v_~current_10~0_2} OutVars{~name_2~0=v_~name_2~0_6, ~result_8~0=v_~result_8~0_1, ~current_10~0=v_~current_10~0_2} AuxVars[] AssignedVars[~result_8~0][355], [Black: 1605#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1599#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 259#L78true, 158#L63-12true, Black: 2356#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), 1591#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2388#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2384#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1)), Black: 2366#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2354#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2364#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1)), Black: 2374#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 2372#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 2358#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (= ~break_7~0 0)), Black: 2378#(and (= ~name_2~0 ~name_1~0) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1) (or (and (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 1623#(and (or (= ~result_8~0 0) (not (= ~name_3~0 ~name_2~0))) (= ~break_11~0 0)), Black: 1625#(and (= ~result_8~0 0) (= |thread2Thread1of1ForFork2_#t~ite10#1| 0)), Black: 2362#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2386#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 1615#(= ~result_8~0 0), Black: 2360#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~break_7~0 1)), Black: 2103#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 1613#(or (= ~result_8~0 0) (and (not (= ~name_3~0 ~name_2~0)) (= ~break_11~0 0))), Black: 2370#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1) (or (and (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2083#(and (= ~break_15~0 0) (= ~break_7~0 0)), Black: 2368#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 362#true, 14#L136-4true, Black: 2382#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2090#(and (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 1610#true, 310#L101true, Black: 373#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 2415#(= ~result_4~0 0), 1637#true]) [2022-11-18 18:35:57,941 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-18 18:35:57,941 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-18 18:35:57,941 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-18 18:35:57,942 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-18 18:35:58,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L77-->L78: Formula: (= v_~result_8~0_1 (ite (= v_~name_2~0_6 v_~current_10~0_2) 1 v_~result_8~0_2)) InVars {~name_2~0=v_~name_2~0_6, ~result_8~0=v_~result_8~0_2, ~current_10~0=v_~current_10~0_2} OutVars{~name_2~0=v_~name_2~0_6, ~result_8~0=v_~result_8~0_1, ~current_10~0=v_~current_10~0_2} AuxVars[] AssignedVars[~result_8~0][355], [Black: 1605#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1599#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 259#L78true, Black: 2356#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), 1591#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2388#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2384#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1)), Black: 2366#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2354#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2364#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1)), Black: 2374#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 2372#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), 327#L137-2true, Black: 2358#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (= ~break_7~0 0)), Black: 2378#(and (= ~name_2~0 ~name_1~0) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1) (or (and (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 1623#(and (or (= ~result_8~0 0) (not (= ~name_3~0 ~name_2~0))) (= ~break_11~0 0)), Black: 1625#(and (= ~result_8~0 0) (= |thread2Thread1of1ForFork2_#t~ite10#1| 0)), Black: 2362#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2386#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 1615#(= ~result_8~0 0), Black: 2360#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~break_7~0 1)), Black: 1613#(or (= ~result_8~0 0) (and (not (= ~name_3~0 ~name_2~0)) (= ~break_11~0 0))), Black: 2103#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2370#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1) (or (and (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2083#(and (= ~break_15~0 0) (= ~break_7~0 0)), Black: 2368#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 362#true, Black: 2382#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2090#(and (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 1610#true, 310#L101true, Black: 373#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 2415#(= ~result_4~0 0), 1637#true]) [2022-11-18 18:35:58,654 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 18:35:58,654 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 18:35:58,654 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 18:35:58,654 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 18:36:00,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L77-->L78: Formula: (= v_~result_8~0_1 (ite (= v_~name_2~0_6 v_~current_10~0_2) 1 v_~result_8~0_2)) InVars {~name_2~0=v_~name_2~0_6, ~result_8~0=v_~result_8~0_2, ~current_10~0=v_~current_10~0_2} OutVars{~name_2~0=v_~name_2~0_6, ~result_8~0=v_~result_8~0_1, ~current_10~0=v_~current_10~0_2} AuxVars[] AssignedVars[~result_8~0][355], [Black: 1605#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1599#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 259#L78true, 166#L107-3true, 158#L63-12true, Black: 2356#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), 1591#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2388#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2384#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1)), Black: 2366#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2354#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 2073#(= ~break_15~0 0), Black: 2364#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1)), Black: 2374#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 2372#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 2358#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (= ~break_7~0 0)), Black: 2378#(and (= ~name_2~0 ~name_1~0) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1) (or (and (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 1623#(and (or (= ~result_8~0 0) (not (= ~name_3~0 ~name_2~0))) (= ~break_11~0 0)), Black: 1625#(and (= ~result_8~0 0) (= |thread2Thread1of1ForFork2_#t~ite10#1| 0)), Black: 2362#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 2386#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)), Black: 2360#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~break_7~0 1)), Black: 1615#(= ~result_8~0 0), Black: 2103#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), Black: 1613#(or (= ~result_8~0 0) (and (not (= ~name_3~0 ~name_2~0)) (= ~break_11~0 0))), Black: 2370#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (or (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_7~0 1) (or (and (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 2083#(and (= ~break_15~0 0) (= ~break_7~0 0)), Black: 2368#(and (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (not (= ~name_3~0 ~name_1~0)) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= ~break_15~0 0) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 14#L136-4true, 362#true, Black: 2382#(and (= ~name_2~0 ~name_1~0) (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (not (= ~name_3~0 ~name_1~0)) (= ~break_7~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 1)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))), Black: 1637#true, Black: 2090#(and (= ~break_15~0 0) (or (and (= ~name_2~0 ~name_1~0) (= ~break_7~0 1)) (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)))), 1610#true, Black: 373#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 2415#(= ~result_4~0 0)]) [2022-11-18 18:36:00,891 INFO L383 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-11-18 18:36:00,891 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-18 18:36:00,891 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-18 18:36:00,891 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event