./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R --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 cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --- 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-38b53e6 [2022-11-25 15:47:14,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:47:14,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:47:14,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:47:14,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:47:14,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:47:14,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:47:14,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:47:14,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:47:14,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:47:14,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:47:14,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:47:14,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:47:14,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:47:14,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:47:14,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:47:14,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:47:14,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:47:14,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:47:14,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:47:14,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:47:14,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:47:14,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:47:14,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:47:14,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:47:14,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:47:14,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:47:14,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:47:14,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:47:14,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:47:14,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:47:14,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:47:14,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:47:14,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:47:14,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:47:14,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:47:14,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:47:14,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:47:14,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:47:14,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:47:14,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:47:14,306 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:47:14,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:47:14,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:47:14,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:47:14,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:47:14,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:47:14,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:47:14,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:47:14,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:47:14,359 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:47:14,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:47:14,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:47:14,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:47:14,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:47:14,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:47:14,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:47:14,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:47:14,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:47:14,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:47:14,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:47:14,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:47:14,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:47:14,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:47:14,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:47:14,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:47:14,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:47:14,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:47:14,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:47:14,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:47:14,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:47:14,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:47:14,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:47:14,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:47:14,367 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:47:14,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:47:14,368 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/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_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R 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 -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 [2022-11-25 15:47:14,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:47:14,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:47:14,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:47:14,757 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:47:14,758 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:47:14,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2022-11-25 15:47:18,002 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:47:18,320 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:47:18,321 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2022-11-25 15:47:18,347 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/data/00034d5bd/1f4ee4d461e3454fbbbe90938eb81ad6/FLAG1d8d0717d [2022-11-25 15:47:18,362 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/data/00034d5bd/1f4ee4d461e3454fbbbe90938eb81ad6 [2022-11-25 15:47:18,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:47:18,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:47:18,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:47:18,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:47:18,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:47:18,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:47:18" (1/1) ... [2022-11-25 15:47:18,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb05298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:18, skipping insertion in model container [2022-11-25 15:47:18,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:47:18" (1/1) ... [2022-11-25 15:47:18,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:47:18,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:47:18,669 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2022-11-25 15:47:18,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:47:18,916 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:47:18,932 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2022-11-25 15:47:18,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:47:19,028 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:47:19,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19 WrapperNode [2022-11-25 15:47:19,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:47:19,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:47:19,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:47:19,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:47:19,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,113 INFO L138 Inliner]: procedures = 165, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2022-11-25 15:47:19,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:47:19,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:47:19,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:47:19,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:47:19,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,157 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:47:19,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:47:19,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:47:19,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:47:19,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (1/1) ... [2022-11-25 15:47:19,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:47:19,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:19,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:47:19,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:47:19,285 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-11-25 15:47:19,285 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-11-25 15:47:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:47:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 15:47:19,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:47:19,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:47:19,287 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2022-11-25 15:47:19,287 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2022-11-25 15:47:19,287 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-25 15:47:19,288 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-25 15:47:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:47:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:47:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:47:19,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:47:19,290 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:47:19,521 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:47:19,536 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:47:19,868 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:47:19,875 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:47:19,875 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:47:19,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:47:19 BoogieIcfgContainer [2022-11-25 15:47:19,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:47:19,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:47:19,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:47:19,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:47:19,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:47:18" (1/3) ... [2022-11-25 15:47:19,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92603f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:47:19, skipping insertion in model container [2022-11-25 15:47:19,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:47:19" (2/3) ... [2022-11-25 15:47:19,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92603f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:47:19, skipping insertion in model container [2022-11-25 15:47:19,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:47:19" (3/3) ... [2022-11-25 15:47:19,886 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2022-11-25 15:47:19,894 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:47:19,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:47:19,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 15:47:19,906 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:47:20,010 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:47:20,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 167 transitions, 349 flow [2022-11-25 15:47:20,203 INFO L130 PetriNetUnfolder]: 5/164 cut-off events. [2022-11-25 15:47:20,203 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:47:20,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 5/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2022-11-25 15:47:20,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 167 transitions, 349 flow [2022-11-25 15:47:20,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 164 transitions, 337 flow [2022-11-25 15:47:20,225 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:47:20,250 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 164 transitions, 337 flow [2022-11-25 15:47:20,254 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 164 transitions, 337 flow [2022-11-25 15:47:20,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 164 transitions, 337 flow [2022-11-25 15:47:20,331 INFO L130 PetriNetUnfolder]: 5/164 cut-off events. [2022-11-25 15:47:20,332 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:47:20,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 5/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2022-11-25 15:47:20,344 INFO L119 LiptonReduction]: Number of co-enabled transitions 9784 [2022-11-25 15:47:28,051 INFO L134 LiptonReduction]: Checked pairs total: 21434 [2022-11-25 15:47:28,051 INFO L136 LiptonReduction]: Total number of compositions: 157 [2022-11-25 15:47:28,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:47:28,091 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;@289a05ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:47:28,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-25 15:47:28,108 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-25 15:47:28,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:47:28,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:28,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:28,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:28,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:28,117 INFO L85 PathProgramCache]: Analyzing trace with hash 961430036, now seen corresponding path program 1 times [2022-11-25 15:47:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:28,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606446805] [2022-11-25 15:47:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,437 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-25 15:47:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:28,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606446805] [2022-11-25 15:47:28,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606446805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:28,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:28,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:47:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781147450] [2022-11-25 15:47:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:28,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:47:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:47:28,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:47:28,494 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 324 [2022-11-25 15:47:28,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 85 flow. Second operand has 2 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:28,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:28,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 324 [2022-11-25 15:47:28,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:29,079 INFO L130 PetriNetUnfolder]: 2021/3182 cut-off events. [2022-11-25 15:47:29,079 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-25 15:47:29,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6111 conditions, 3182 events. 2021/3182 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 19702 event pairs, 1851 based on Foata normal form. 0/2340 useless extension candidates. Maximal degree in co-relation 6100. Up to 2873 conditions per place. [2022-11-25 15:47:29,108 INFO L137 encePairwiseOnDemand]: 323/324 looper letters, 25 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2022-11-25 15:47:29,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 133 flow [2022-11-25 15:47:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:47:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:47:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 338 transitions. [2022-11-25 15:47:29,135 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2022-11-25 15:47:29,136 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 338 transitions. [2022-11-25 15:47:29,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 338 transitions. [2022-11-25 15:47:29,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:29,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 338 transitions. [2022-11-25 15:47:29,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.0) internal successors, (338), 2 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:29,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:29,160 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:29,162 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 85 flow. Second operand 2 states and 338 transitions. [2022-11-25 15:47:29,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 133 flow [2022-11-25 15:47:29,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:47:29,171 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow [2022-11-25 15:47:29,173 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-11-25 15:47:29,178 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2022-11-25 15:47:29,179 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow [2022-11-25 15:47:29,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:29,179 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:29,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:29,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:47:29,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash 962226555, now seen corresponding path program 1 times [2022-11-25 15:47:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:29,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829100114] [2022-11-25 15:47:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:29,448 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-25 15:47:29,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:29,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829100114] [2022-11-25 15:47:29,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829100114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:29,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:29,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:47:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271805705] [2022-11-25 15:47:29,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:29,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:47:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:47:29,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:47:29,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 324 [2022-11-25 15:47:29,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:29,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:29,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 324 [2022-11-25 15:47:29,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:30,635 INFO L130 PetriNetUnfolder]: 4378/6753 cut-off events. [2022-11-25 15:47:30,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:47:30,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13145 conditions, 6753 events. 4378/6753 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 44765 event pairs, 839 based on Foata normal form. 0/5416 useless extension candidates. Maximal degree in co-relation 13142. Up to 2825 conditions per place. [2022-11-25 15:47:30,680 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 116 selfloop transitions, 10 changer transitions 0/135 dead transitions. [2022-11-25 15:47:30,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 135 transitions, 542 flow [2022-11-25 15:47:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:47:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:47:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1305 transitions. [2022-11-25 15:47:30,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2022-11-25 15:47:30,685 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1305 transitions. [2022-11-25 15:47:30,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1305 transitions. [2022-11-25 15:47:30,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:30,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1305 transitions. [2022-11-25 15:47:30,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 163.125) internal successors, (1305), 8 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:30,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:30,697 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:30,698 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 8 states and 1305 transitions. [2022-11-25 15:47:30,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 135 transitions, 542 flow [2022-11-25 15:47:30,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 135 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:47:30,701 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 149 flow [2022-11-25 15:47:30,701 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2022-11-25 15:47:30,702 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2022-11-25 15:47:30,702 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 149 flow [2022-11-25 15:47:30,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:30,703 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:30,703 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:30,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:47:30,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash 514360148, now seen corresponding path program 1 times [2022-11-25 15:47:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:30,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55430707] [2022-11-25 15:47:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:30,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:30,900 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-25 15:47:30,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:30,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55430707] [2022-11-25 15:47:30,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55430707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:30,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:30,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:47:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267591755] [2022-11-25 15:47:30,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:30,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:47:30,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:30,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:47:30,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:47:30,951 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 324 [2022-11-25 15:47:30,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:30,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:30,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 324 [2022-11-25 15:47:30,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:32,316 INFO L130 PetriNetUnfolder]: 5135/7929 cut-off events. [2022-11-25 15:47:32,317 INFO L131 PetriNetUnfolder]: For 7087/7625 co-relation queries the response was YES. [2022-11-25 15:47:32,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19861 conditions, 7929 events. 5135/7929 cut-off events. For 7087/7625 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 53637 event pairs, 758 based on Foata normal form. 126/7060 useless extension candidates. Maximal degree in co-relation 19852. Up to 2699 conditions per place. [2022-11-25 15:47:32,397 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 96 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2022-11-25 15:47:32,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 128 transitions, 651 flow [2022-11-25 15:47:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:47:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:47:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1269 transitions. [2022-11-25 15:47:32,401 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2022-11-25 15:47:32,402 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1269 transitions. [2022-11-25 15:47:32,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1269 transitions. [2022-11-25 15:47:32,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:32,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1269 transitions. [2022-11-25 15:47:32,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 158.625) internal successors, (1269), 8 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:32,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:32,414 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:32,414 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 149 flow. Second operand 8 states and 1269 transitions. [2022-11-25 15:47:32,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 128 transitions, 651 flow [2022-11-25 15:47:32,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 128 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:47:32,517 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 326 flow [2022-11-25 15:47:32,518 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2022-11-25 15:47:32,518 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2022-11-25 15:47:32,518 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 326 flow [2022-11-25 15:47:32,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:32,519 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:32,519 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:32,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:47:32,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1057373478, now seen corresponding path program 1 times [2022-11-25 15:47:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:32,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411521788] [2022-11-25 15:47:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:32,667 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-25 15:47:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:32,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411521788] [2022-11-25 15:47:32,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411521788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:32,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:32,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:47:32,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752834325] [2022-11-25 15:47:32,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:32,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:47:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:32,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:47:32,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:47:32,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 324 [2022-11-25 15:47:32,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:32,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:32,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 324 [2022-11-25 15:47:32,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:33,537 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 214#true, 69#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 17#L694true, 51#L736true, 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,538 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,538 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,542 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,542 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,543 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 59#t3_funEXITtrue, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, 51#L736true, Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 196#true, 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,543 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,543 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,543 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,544 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,612 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 69#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 51#L736true, 17#L694true, Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,613 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,618 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,619 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,619 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,619 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,620 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 59#t3_funEXITtrue, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, 51#L736true, Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,620 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,620 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,621 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,621 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,621 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:47:33,642 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 125#L737-2true, 214#true, 69#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 17#L694true, 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,642 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,643 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,643 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,643 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 59#t3_funEXITtrue, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 125#L737-2true, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 196#true, 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,644 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,644 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,644 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,645 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,782 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 125#L737-2true, 69#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,782 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,783 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,783 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,783 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,783 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,784 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 59#t3_funEXITtrue, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 125#L737-2true, 214#true, 17#L694true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,784 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,784 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,784 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,784 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,784 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:47:33,805 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, t_funThread1of1ForFork1InUse, 131#ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTIONtrue, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 69#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 17#L694true, 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,805 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,806 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 69#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 17#L694true, 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,806 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,807 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,807 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,807 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,807 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 59#t3_funEXITtrue, t_funThread1of1ForFork1InUse, 131#ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTIONtrue, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 196#true, 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,808 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,808 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,808 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,808 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 2#ULTIMATE.startEXITtrue, 59#t3_funEXITtrue, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 214#true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 196#true, 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,809 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,809 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,809 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,809 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,858 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, t_funThread1of1ForFork1InUse, 131#ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTIONtrue, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 69#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 214#true, 17#L694true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,859 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,859 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,860 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,860 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,860 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,860 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 69#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 214#true, 17#L694true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,861 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,861 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,861 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,861 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,861 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,862 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 59#t3_funEXITtrue, t_funThread1of1ForFork1InUse, 131#ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTIONtrue, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 214#true, 17#L694true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,862 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,862 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,862 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,862 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,862 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,863 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 178#true, 59#t3_funEXITtrue, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, 166#t2_funEXITtrue, t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 214#true, 17#L694true, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)]) [2022-11-25 15:47:33,863 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,863 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,863 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,864 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,864 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:47:33,991 INFO L130 PetriNetUnfolder]: 4423/7983 cut-off events. [2022-11-25 15:47:33,992 INFO L131 PetriNetUnfolder]: For 8206/8567 co-relation queries the response was YES. [2022-11-25 15:47:34,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20728 conditions, 7983 events. 4423/7983 cut-off events. For 8206/8567 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 60467 event pairs, 1927 based on Foata normal form. 795/7749 useless extension candidates. Maximal degree in co-relation 20713. Up to 4700 conditions per place. [2022-11-25 15:47:34,075 INFO L137 encePairwiseOnDemand]: 309/324 looper letters, 51 selfloop transitions, 17 changer transitions 0/88 dead transitions. [2022-11-25 15:47:34,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 88 transitions, 569 flow [2022-11-25 15:47:34,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:47:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:47:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2022-11-25 15:47:34,078 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49794238683127573 [2022-11-25 15:47:34,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2022-11-25 15:47:34,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2022-11-25 15:47:34,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:34,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2022-11-25 15:47:34,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:34,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:34,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:34,084 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 326 flow. Second operand 3 states and 484 transitions. [2022-11-25 15:47:34,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 88 transitions, 569 flow [2022-11-25 15:47:34,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 565 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-11-25 15:47:34,257 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 421 flow [2022-11-25 15:47:34,257 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2022-11-25 15:47:34,258 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2022-11-25 15:47:34,258 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 421 flow [2022-11-25 15:47:34,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:34,259 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:34,259 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:34,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:47:34,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:34,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1524339831, now seen corresponding path program 1 times [2022-11-25 15:47:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:34,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614721217] [2022-11-25 15:47:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:34,429 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-25 15:47:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:34,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614721217] [2022-11-25 15:47:34,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614721217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:34,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:34,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:47:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254064490] [2022-11-25 15:47:34,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:34,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:47:34,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:34,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:47:34,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:47:34,490 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 324 [2022-11-25 15:47:34,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 421 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:34,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:34,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 324 [2022-11-25 15:47:34,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:36,093 INFO L130 PetriNetUnfolder]: 4879/8475 cut-off events. [2022-11-25 15:47:36,093 INFO L131 PetriNetUnfolder]: For 15587/16271 co-relation queries the response was YES. [2022-11-25 15:47:36,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28676 conditions, 8475 events. 4879/8475 cut-off events. For 15587/16271 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 61193 event pairs, 1016 based on Foata normal form. 131/7585 useless extension candidates. Maximal degree in co-relation 28659. Up to 3862 conditions per place. [2022-11-25 15:47:36,167 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 120 selfloop transitions, 31 changer transitions 0/169 dead transitions. [2022-11-25 15:47:36,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 169 transitions, 1275 flow [2022-11-25 15:47:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:47:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:47:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1273 transitions. [2022-11-25 15:47:36,172 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49112654320987653 [2022-11-25 15:47:36,172 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1273 transitions. [2022-11-25 15:47:36,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1273 transitions. [2022-11-25 15:47:36,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:36,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1273 transitions. [2022-11-25 15:47:36,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 159.125) internal successors, (1273), 8 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:36,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:36,181 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:36,182 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 421 flow. Second operand 8 states and 1273 transitions. [2022-11-25 15:47:36,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 169 transitions, 1275 flow [2022-11-25 15:47:36,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 169 transitions, 1225 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:47:36,307 INFO L231 Difference]: Finished difference. Result has 85 places, 90 transitions, 711 flow [2022-11-25 15:47:36,308 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=711, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2022-11-25 15:47:36,308 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2022-11-25 15:47:36,308 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 711 flow [2022-11-25 15:47:36,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:36,309 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:36,309 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:36,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:47:36,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash 406385765, now seen corresponding path program 1 times [2022-11-25 15:47:36,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:36,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604426871] [2022-11-25 15:47:36,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:36,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:36,450 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-25 15:47:36,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:36,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604426871] [2022-11-25 15:47:36,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604426871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:36,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:36,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:47:36,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618324874] [2022-11-25 15:47:36,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:36,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:47:36,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:47:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:47:36,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 324 [2022-11-25 15:47:36,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:36,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:36,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 324 [2022-11-25 15:47:36,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:38,371 INFO L130 PetriNetUnfolder]: 6367/10897 cut-off events. [2022-11-25 15:47:38,371 INFO L131 PetriNetUnfolder]: For 23752/23938 co-relation queries the response was YES. [2022-11-25 15:47:38,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36620 conditions, 10897 events. 6367/10897 cut-off events. For 23752/23938 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 78265 event pairs, 1449 based on Foata normal form. 313/10206 useless extension candidates. Maximal degree in co-relation 36598. Up to 4733 conditions per place. [2022-11-25 15:47:38,502 INFO L137 encePairwiseOnDemand]: 318/324 looper letters, 158 selfloop transitions, 35 changer transitions 0/211 dead transitions. [2022-11-25 15:47:38,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 211 transitions, 1729 flow [2022-11-25 15:47:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:47:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:47:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1134 transitions. [2022-11-25 15:47:38,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 15:47:38,508 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1134 transitions. [2022-11-25 15:47:38,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1134 transitions. [2022-11-25 15:47:38,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:38,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1134 transitions. [2022-11-25 15:47:38,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:38,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:38,519 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:38,519 INFO L175 Difference]: Start difference. First operand has 85 places, 90 transitions, 711 flow. Second operand 7 states and 1134 transitions. [2022-11-25 15:47:38,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 211 transitions, 1729 flow [2022-11-25 15:47:38,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 211 transitions, 1723 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-25 15:47:38,764 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 822 flow [2022-11-25 15:47:38,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=822, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2022-11-25 15:47:38,768 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 49 predicate places. [2022-11-25 15:47:38,768 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 822 flow [2022-11-25 15:47:38,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:38,769 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:38,769 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:38,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:47:38,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1141529096, now seen corresponding path program 1 times [2022-11-25 15:47:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:38,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368820706] [2022-11-25 15:47:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:38,877 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-25 15:47:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:38,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368820706] [2022-11-25 15:47:38,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368820706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:38,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:38,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:47:38,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747349954] [2022-11-25 15:47:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:38,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:47:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:38,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:47:38,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:47:38,899 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 324 [2022-11-25 15:47:38,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 822 flow. Second operand has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:38,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:38,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 324 [2022-11-25 15:47:38,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:39,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][71], [Black: 249#(and (<= (+ |t2_funThread1of1ForFork2_~y~0#1| 17) |t2_funThread1of1ForFork2_~x~1#1|) (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork2_~x~1#1|)), Black: 180#(<= ~h~0 ~g~0), Black: 186#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), Black: 188#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), 262#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 95#t2_funENTRYtrue, Black: 199#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 206#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 198#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 196#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 244#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 216#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), 223#(and (<= |t3_funThread1of1ForFork0_~x~2#1| |t3_funThread1of1ForFork0_~y~1#1|) (< |t3_funThread1of1ForFork0_~y~1#1| (+ |t3_funThread1of1ForFork0_~x~2#1| 1))), 59#t3_funEXITtrue, Black: 227#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork0_~x~2#1| |t3_funThread1of1ForFork0_~y~1#1|) (<= ~h~0 ~g~0) (<= ~h~0 |t3_funThread1of1ForFork0_~x~2#1|) (< |t3_funThread1of1ForFork0_~y~1#1| (+ |t3_funThread1of1ForFork0_~x~2#1| 1)) (<= |t3_funThread1of1ForFork0_~x~2#1| ~h~0)), Black: 229#(and (<= |t3_funThread1of1ForFork0_~x~2#1| |t3_funThread1of1ForFork0_~y~1#1|) (<= ~h~0 |t3_funThread1of1ForFork0_~x~2#1|) (< |t3_funThread1of1ForFork0_~y~1#1| (+ |t3_funThread1of1ForFork0_~x~2#1| 1)) (<= |t3_funThread1of1ForFork0_~x~2#1| ~h~0)), Black: 221#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t_funThread1of1ForFork1InUse, Black: 219#true, Black: 222#(and (<= ~h~0 |t3_funThread1of1ForFork0_~x~2#1|) (<= |t3_funThread1of1ForFork0_~x~2#1| ~h~0)), t3_funThread1of1ForFork0InUse, t2_funThread1of1ForFork2InUse, 125#L737-2true, 17#L694true, 200#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 175#true, Black: 247#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork2_~x~1#1|)), Black: 182#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 251#(and (<= (+ |t2_funThread1of1ForFork2_~y~0#1| 17) |t2_funThread1of1ForFork2_~x~1#1|) (<= t_funThread1of1ForFork1_~x~0 ~g~0)), Black: 181#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 178#true]) [2022-11-25 15:47:39,590 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:47:39,590 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:47:39,590 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:47:39,591 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:47:40,128 INFO L130 PetriNetUnfolder]: 3793/6978 cut-off events. [2022-11-25 15:47:40,128 INFO L131 PetriNetUnfolder]: For 22568/23155 co-relation queries the response was YES. [2022-11-25 15:47:40,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25729 conditions, 6978 events. 3793/6978 cut-off events. For 22568/23155 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 52462 event pairs, 1318 based on Foata normal form. 99/6679 useless extension candidates. Maximal degree in co-relation 25702. Up to 3359 conditions per place. [2022-11-25 15:47:40,223 INFO L137 encePairwiseOnDemand]: 322/324 looper letters, 75 selfloop transitions, 4 changer transitions 4/117 dead transitions. [2022-11-25 15:47:40,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 117 transitions, 1158 flow [2022-11-25 15:47:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:47:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:47:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2022-11-25 15:47:40,226 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 15:47:40,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2022-11-25 15:47:40,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2022-11-25 15:47:40,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:40,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2022-11-25 15:47:40,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:40,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:40,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:40,378 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 822 flow. Second operand 3 states and 486 transitions. [2022-11-25 15:47:40,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 117 transitions, 1158 flow [2022-11-25 15:47:40,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 117 transitions, 1101 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 15:47:40,534 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 747 flow [2022-11-25 15:47:40,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2022-11-25 15:47:40,535 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places. [2022-11-25 15:47:40,536 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 747 flow [2022-11-25 15:47:40,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:40,536 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:40,537 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:40,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:47:40,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash -395430464, now seen corresponding path program 1 times [2022-11-25 15:47:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:40,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114652689] [2022-11-25 15:47:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:40,761 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-25 15:47:40,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:40,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114652689] [2022-11-25 15:47:40,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114652689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:40,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:40,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:47:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838975309] [2022-11-25 15:47:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:40,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:47:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:40,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:47:40,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:47:40,851 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 324 [2022-11-25 15:47:40,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 747 flow. Second operand has 5 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:40,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:40,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 324 [2022-11-25 15:47:40,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:41,266 INFO L130 PetriNetUnfolder]: 1186/2708 cut-off events. [2022-11-25 15:47:41,266 INFO L131 PetriNetUnfolder]: For 8348/8589 co-relation queries the response was YES. [2022-11-25 15:47:41,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9678 conditions, 2708 events. 1186/2708 cut-off events. For 8348/8589 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 20089 event pairs, 221 based on Foata normal form. 374/2979 useless extension candidates. Maximal degree in co-relation 9651. Up to 1523 conditions per place. [2022-11-25 15:47:41,295 INFO L137 encePairwiseOnDemand]: 315/324 looper letters, 53 selfloop transitions, 17 changer transitions 2/102 dead transitions. [2022-11-25 15:47:41,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 917 flow [2022-11-25 15:47:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:47:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:47:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2022-11-25 15:47:41,299 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4737654320987654 [2022-11-25 15:47:41,299 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2022-11-25 15:47:41,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2022-11-25 15:47:41,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:41,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2022-11-25 15:47:41,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:41,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:41,305 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:41,305 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 747 flow. Second operand 4 states and 614 transitions. [2022-11-25 15:47:41,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 917 flow [2022-11-25 15:47:41,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 892 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 15:47:41,353 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 692 flow [2022-11-25 15:47:41,353 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=692, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2022-11-25 15:47:41,354 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places. [2022-11-25 15:47:41,354 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 692 flow [2022-11-25 15:47:41,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:41,355 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:41,355 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:41,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:47:41,356 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1144602741, now seen corresponding path program 1 times [2022-11-25 15:47:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:41,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677118435] [2022-11-25 15:47:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:41,603 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-25 15:47:41,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:41,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677118435] [2022-11-25 15:47:41,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677118435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:41,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:41,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:47:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724198042] [2022-11-25 15:47:41,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:41,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:47:41,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:41,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:47:41,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:47:41,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 324 [2022-11-25 15:47:41,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:41,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:41,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 324 [2022-11-25 15:47:41,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:42,485 INFO L130 PetriNetUnfolder]: 1435/3128 cut-off events. [2022-11-25 15:47:42,485 INFO L131 PetriNetUnfolder]: For 8241/8398 co-relation queries the response was YES. [2022-11-25 15:47:42,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 3128 events. 1435/3128 cut-off events. For 8241/8398 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 22676 event pairs, 171 based on Foata normal form. 159/3260 useless extension candidates. Maximal degree in co-relation 11565. Up to 1233 conditions per place. [2022-11-25 15:47:42,500 INFO L137 encePairwiseOnDemand]: 316/324 looper letters, 155 selfloop transitions, 39 changer transitions 14/224 dead transitions. [2022-11-25 15:47:42,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 224 transitions, 1904 flow [2022-11-25 15:47:42,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 15:47:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 15:47:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2037 transitions. [2022-11-25 15:47:42,507 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48361823361823364 [2022-11-25 15:47:42,508 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2037 transitions. [2022-11-25 15:47:42,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2037 transitions. [2022-11-25 15:47:42,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:42,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2037 transitions. [2022-11-25 15:47:42,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 156.69230769230768) internal successors, (2037), 13 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:42,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 324.0) internal successors, (4536), 14 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:42,527 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 324.0) internal successors, (4536), 14 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:42,528 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 692 flow. Second operand 13 states and 2037 transitions. [2022-11-25 15:47:42,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 224 transitions, 1904 flow [2022-11-25 15:47:42,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 224 transitions, 1824 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 15:47:42,571 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 858 flow [2022-11-25 15:47:42,571 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=858, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2022-11-25 15:47:42,572 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 61 predicate places. [2022-11-25 15:47:42,572 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 858 flow [2022-11-25 15:47:42,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:42,573 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:42,573 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:42,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:47:42,573 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2129391117, now seen corresponding path program 1 times [2022-11-25 15:47:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:42,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360823625] [2022-11-25 15:47:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:42,746 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-25 15:47:42,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360823625] [2022-11-25 15:47:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360823625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:42,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:47:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627777846] [2022-11-25 15:47:42,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:42,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:47:42,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:47:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:47:42,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 324 [2022-11-25 15:47:42,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 858 flow. Second operand has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:42,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:42,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 324 [2022-11-25 15:47:42,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:43,077 INFO L130 PetriNetUnfolder]: 297/1047 cut-off events. [2022-11-25 15:47:43,077 INFO L131 PetriNetUnfolder]: For 2129/2217 co-relation queries the response was YES. [2022-11-25 15:47:43,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3747 conditions, 1047 events. 297/1047 cut-off events. For 2129/2217 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7380 event pairs, 119 based on Foata normal form. 53/1088 useless extension candidates. Maximal degree in co-relation 3718. Up to 450 conditions per place. [2022-11-25 15:47:43,084 INFO L137 encePairwiseOnDemand]: 313/324 looper letters, 36 selfloop transitions, 14 changer transitions 3/73 dead transitions. [2022-11-25 15:47:43,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 73 transitions, 675 flow [2022-11-25 15:47:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:47:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:47:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-11-25 15:47:43,086 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.466820987654321 [2022-11-25 15:47:43,087 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2022-11-25 15:47:43,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2022-11-25 15:47:43,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:43,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2022-11-25 15:47:43,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,092 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,092 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 858 flow. Second operand 4 states and 605 transitions. [2022-11-25 15:47:43,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 73 transitions, 675 flow [2022-11-25 15:47:43,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 73 transitions, 547 flow, removed 18 selfloop flow, removed 21 redundant places. [2022-11-25 15:47:43,103 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 419 flow [2022-11-25 15:47:43,104 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=419, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2022-11-25 15:47:43,104 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 38 predicate places. [2022-11-25 15:47:43,104 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 419 flow [2022-11-25 15:47:43,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,105 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:43,105 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:43,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:47:43,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1768477834, now seen corresponding path program 1 times [2022-11-25 15:47:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:43,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476681298] [2022-11-25 15:47:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:43,201 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-25 15:47:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:43,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476681298] [2022-11-25 15:47:43,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476681298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:43,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:43,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:47:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56305240] [2022-11-25 15:47:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:43,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:47:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:43,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:47:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:47:43,279 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 324 [2022-11-25 15:47:43,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:43,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 324 [2022-11-25 15:47:43,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:43,633 INFO L130 PetriNetUnfolder]: 340/1132 cut-off events. [2022-11-25 15:47:43,633 INFO L131 PetriNetUnfolder]: For 1521/1569 co-relation queries the response was YES. [2022-11-25 15:47:43,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 1132 events. 340/1132 cut-off events. For 1521/1569 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7712 event pairs, 97 based on Foata normal form. 24/1133 useless extension candidates. Maximal degree in co-relation 3888. Up to 319 conditions per place. [2022-11-25 15:47:43,639 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 67 selfloop transitions, 15 changer transitions 30/125 dead transitions. [2022-11-25 15:47:43,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 125 transitions, 972 flow [2022-11-25 15:47:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:47:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 15:47:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1825 transitions. [2022-11-25 15:47:43,645 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46939300411522633 [2022-11-25 15:47:43,646 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1825 transitions. [2022-11-25 15:47:43,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1825 transitions. [2022-11-25 15:47:43,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:43,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1825 transitions. [2022-11-25 15:47:43,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 152.08333333333334) internal successors, (1825), 12 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 324.0) internal successors, (4212), 13 states have internal predecessors, (4212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,659 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 324.0) internal successors, (4212), 13 states have internal predecessors, (4212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,659 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 419 flow. Second operand 12 states and 1825 transitions. [2022-11-25 15:47:43,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 125 transitions, 972 flow [2022-11-25 15:47:43,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 125 transitions, 926 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-25 15:47:43,666 INFO L231 Difference]: Finished difference. Result has 91 places, 53 transitions, 340 flow [2022-11-25 15:47:43,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=340, PETRI_PLACES=91, PETRI_TRANSITIONS=53} [2022-11-25 15:47:43,667 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 45 predicate places. [2022-11-25 15:47:43,667 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 53 transitions, 340 flow [2022-11-25 15:47:43,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:43,668 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] [2022-11-25 15:47:43,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:47:43,668 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-11-25 15:47:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash -535623413, now seen corresponding path program 1 times [2022-11-25 15:47:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:43,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819396143] [2022-11-25 15:47:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:43,790 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-25 15:47:43,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:43,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819396143] [2022-11-25 15:47:43,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819396143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:43,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:43,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:47:43,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916906152] [2022-11-25 15:47:43,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:43,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:47:43,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:43,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:47:43,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:47:43,856 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 324 [2022-11-25 15:47:43,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 53 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:43,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:43,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 324 [2022-11-25 15:47:43,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:44,101 INFO L130 PetriNetUnfolder]: 186/655 cut-off events. [2022-11-25 15:47:44,101 INFO L131 PetriNetUnfolder]: For 824/849 co-relation queries the response was YES. [2022-11-25 15:47:44,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 655 events. 186/655 cut-off events. For 824/849 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3809 event pairs, 82 based on Foata normal form. 29/669 useless extension candidates. Maximal degree in co-relation 2066. Up to 247 conditions per place. [2022-11-25 15:47:44,104 INFO L137 encePairwiseOnDemand]: 318/324 looper letters, 0 selfloop transitions, 0 changer transitions 75/75 dead transitions. [2022-11-25 15:47:44,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 75 transitions, 538 flow [2022-11-25 15:47:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:47:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:47:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1071 transitions. [2022-11-25 15:47:44,108 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-11-25 15:47:44,108 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1071 transitions. [2022-11-25 15:47:44,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1071 transitions. [2022-11-25 15:47:44,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:44,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1071 transitions. [2022-11-25 15:47:44,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:44,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:44,117 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:44,117 INFO L175 Difference]: Start difference. First operand has 91 places, 53 transitions, 340 flow. Second operand 7 states and 1071 transitions. [2022-11-25 15:47:44,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 75 transitions, 538 flow [2022-11-25 15:47:44,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 491 flow, removed 5 selfloop flow, removed 11 redundant places. [2022-11-25 15:47:44,121 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2022-11-25 15:47:44,122 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2022-11-25 15:47:44,122 INFO L288 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2022-11-25 15:47:44,122 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2022-11-25 15:47:44,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:44,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-11-25 15:47:44,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-11-25 15:47:44,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-11-25 15:47:44,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2022-11-25 15:47:44,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-11-25 15:47:44,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-11-25 15:47:44,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-11-25 15:47:44,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-11-25 15:47:44,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-11-25 15:47:44,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:47:44,138 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:44,144 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:47:44,144 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:47:44,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:47:44 BasicIcfg [2022-11-25 15:47:44,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:47:44,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:47:44,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:47:44,150 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:47:44,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:47:19" (3/4) ... [2022-11-25 15:47:44,154 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 15:47:44,160 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2022-11-25 15:47:44,160 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t3_fun [2022-11-25 15:47:44,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-11-25 15:47:44,168 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-25 15:47:44,168 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 15:47:44,168 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 15:47:44,169 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 15:47:44,213 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:47:44,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:47:44,214 INFO L158 Benchmark]: Toolchain (without parser) took 25847.97ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 152.4MB in the beginning and 435.5MB in the end (delta: -283.1MB). Peak memory consumption was 734.7MB. Max. memory is 16.1GB. [2022-11-25 15:47:44,214 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 127.9MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:47:44,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.14ms. Allocated memory is still 182.5MB. Free memory was 152.4MB in the beginning and 132.4MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 15:47:44,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.69ms. Allocated memory is still 182.5MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:47:44,215 INFO L158 Benchmark]: Boogie Preprocessor took 67.69ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 151.2MB in the end (delta: -21.0MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-11-25 15:47:44,216 INFO L158 Benchmark]: RCFGBuilder took 694.84ms. Allocated memory is still 182.5MB. Free memory was 151.2MB in the beginning and 133.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 15:47:44,216 INFO L158 Benchmark]: TraceAbstraction took 24269.08ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 132.4MB in the beginning and 438.6MB in the end (delta: -306.3MB). Peak memory consumption was 712.4MB. Max. memory is 16.1GB. [2022-11-25 15:47:44,217 INFO L158 Benchmark]: Witness Printer took 63.88ms. Allocated memory is still 1.2GB. Free memory was 438.6MB in the beginning and 435.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:47:44,219 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 127.9MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.14ms. Allocated memory is still 182.5MB. Free memory was 152.4MB in the beginning and 132.4MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.69ms. Allocated memory is still 182.5MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.69ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 151.2MB in the end (delta: -21.0MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * RCFGBuilder took 694.84ms. Allocated memory is still 182.5MB. Free memory was 151.2MB in the beginning and 133.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24269.08ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 132.4MB in the beginning and 438.6MB in the end (delta: -306.3MB). Peak memory consumption was 712.4MB. Max. memory is 16.1GB. * Witness Printer took 63.88ms. Allocated memory is still 1.2GB. Free memory was 438.6MB in the beginning and 435.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 169 PlacesBefore, 46 PlacesAfterwards, 164 TransitionsBefore, 38 TransitionsAfterwards, 9784 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 95 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 3 ChoiceCompositions, 157 TotalNumberOfCompositions, 21434 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11237, independent: 10838, independent conditional: 0, independent unconditional: 10838, dependent: 399, dependent conditional: 0, dependent unconditional: 399, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6880, independent: 6776, independent conditional: 0, independent unconditional: 6776, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6880, independent: 6684, independent conditional: 0, independent unconditional: 6684, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 196, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 637, independent: 240, independent conditional: 0, independent unconditional: 240, dependent: 397, dependent conditional: 0, dependent unconditional: 397, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11237, independent: 4062, independent conditional: 0, independent unconditional: 4062, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 6880, unknown conditional: 0, unknown unconditional: 6880] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 384, Positive conditional cache size: 0, Positive unconditional cache size: 384, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 237 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1270 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 988 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2586 IncrementalHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 110 mSDtfsCounter, 2586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=858occurred in iteration=9, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 15:47:44,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f7e4538-0409-481f-8590-771e9e1b7f72/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE